{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/code/power-method","entry":"power_method","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-10-05T00:36:11+00:00","claim":"Names are grouped by exact entry-name string. Same-named routines are NOT asserted to be equivalent; 'ran' means executed on a synthesized fixture, not correctness. n_samples_ran = sum of by_status over every status except 'unverified' (ran_draft_wrong and ran_fixture are failures of Syntology's instrument, not of the code); n_papers_ran = papers with at least one such sample = n_papers_ran_no_instrument_failure (papers with a run with no instrument failure) + n_papers_ran_instrument_only (papers where every run was a failure of Syntology's instrument); n_samples_ran = n_samples_ran_checked (honoured, violated, no contract) + n_samples_instrument (failures of Syntology's instrument, not of the code).","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":8,"n_papers_ran":4,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":4,"units":"n_samples, n_samples_ran, n_samples_fingerprinted and by_status count distinct code bodies (code_sha256); n_places and n_places_pointer_only count places, one per (paper, code body) pair, which is also the unit of the samples list","n_samples":7,"n_samples_ran":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":5,"n_samples_fingerprinted":1,"n_places":10,"n_places_pointer_only":3,"n_places_pointer_only_link_open":0,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_places_pointer_only_link_open counts the places where this paper's link allows the text and the stored copy does not","by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":2,"ran_fixture":0,"ran":0,"unverified":5},"key_notes":{"n_samples_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_samples_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology":{"atlas_url":null,"mcp":null,"mcp_per_sample":{"tool":"get_code","arguments_in":"samples[].mcp_get_code"},"developers":"https://syntology.ai/developers"},"samples":[{"arxiv_id":"2602.03024","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03024","title":"Consistency Deep Equilibrium Models","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"landrarwolf/CDEQ","path":"CDEQ-src/lib/jacobian.py","file_url":"https://github.com/landrarwolf/CDEQ/blob/HEAD/CDEQ-src/lib/jacobian.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, landrarwolf/CDEQ when it was checked","code_sha256":"3c120cc50bc8c55f","code_sha256_prefix":"3c120cc50bc8c55f","mcp_get_code":{"code_sha256":"3c120cc50bc8c55f"}},{"arxiv_id":"2411.00899","arxiv_id_is_arxiv":true,"paper":"/paper/certified-robustness-for-deep-equilibrium-1","title":"Certified Robustness for Deep Equilibrium Models via Serialized Random Smoothing","date":"2024-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"WeizhiGao/Serialized-Randomized-Smoothing","path":"DEQ/lib/jacobian.py","file_url":"https://github.com/WeizhiGao/Serialized-Randomized-Smoothing/blob/HEAD/DEQ/lib/jacobian.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c120cc50bc8c55f","code_sha256_prefix":"3c120cc50bc8c55f","mcp_get_code":{"code_sha256":"3c120cc50bc8c55f"}},{"arxiv_id":"2310.18605","arxiv_id_is_arxiv":true,"paper":"/paper/torchdeq-a-library-for-deep-equilibrium","title":"TorchDEQ: A Library for Deep Equilibrium Models","date":"2023-10-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/torchdeq","path":"torchdeq/loss/jacobian.py","file_url":"https://github.com/locuslab/torchdeq/blob/HEAD/torchdeq/loss/jacobian.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"e2bb819b499ea264","code_sha256_prefix":"e2bb819b499ea264","mcp_get_code":{"code_sha256":"e2bb819b499ea264"}},{"arxiv_id":"2304.11663","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-training-of-deep-equilibrium-models","title":"Efficient Training of Deep Equilibrium Models","date":"2023-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/deq","path":"lib/jacobian.py","file_url":"https://github.com/locuslab/deq/blob/HEAD/lib/jacobian.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c120cc50bc8c55f","code_sha256_prefix":"3c120cc50bc8c55f","mcp_get_code":{"code_sha256":"3c120cc50bc8c55f"}},{"arxiv_id":"2304.11663","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-training-of-deep-equilibrium-models","title":"Efficient Training of Deep Equilibrium Models","date":"2023-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"8a2cfe51ec1c04e7","code_sha256_prefix":"8a2cfe51ec1c04e7","mcp_get_code":{"code_sha256":"8a2cfe51ec1c04e7"}},{"arxiv_id":"2302.02451","arxiv_id_is_arxiv":true,"paper":"/paper/kdeformer-accelerating-transformers-via","title":"KDEformer: Accelerating Transformers via Kernel Density Estimation","date":"2023-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"majid-daliri/kdeformer","path":"KDEformer.py","file_url":"https://github.com/majid-daliri/kdeformer/blob/HEAD/KDEformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"00be53f1a2a197a4","code_sha256_prefix":"00be53f1a2a197a4","mcp_get_code":{"code_sha256":"00be53f1a2a197a4"}},{"arxiv_id":"2302.02451","arxiv_id_is_arxiv":true,"paper":"/paper/kdeformer-accelerating-transformers-via","title":"KDEformer: Accelerating Transformers via Kernel Density Estimation","date":"2023-02-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"majid-daliri/kdeformer","path":"vit_models/kdeformer.py","file_url":"https://github.com/majid-daliri/kdeformer/blob/HEAD/vit_models/kdeformer.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a1a0332373feae9e","code_sha256_prefix":"a1a0332373feae9e","mcp_get_code":{"code_sha256":"a1a0332373feae9e"}},{"arxiv_id":"2111.05177","arxiv_id_is_arxiv":true,"paper":"/paper/on-training-implicit-models","title":"On Training Implicit Models","date":"2021-11-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gsunshine/phantom_grad","path":"MDEQ/MDEQ_ImageNet/models/mdeq_forward_backward.py","file_url":"https://github.com/gsunshine/phantom_grad/blob/HEAD/MDEQ/MDEQ_ImageNet/models/mdeq_forward_backward.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb0f3b20cb022fb0","code_sha256_prefix":"eb0f3b20cb022fb0","mcp_get_code":{"code_sha256":"eb0f3b20cb022fb0"}},{"arxiv_id":"2106.14342","arxiv_id_is_arxiv":true,"paper":"/paper/stabilizing-equilibrium-models-by-jacobian","title":"Stabilizing Equilibrium Models by Jacobian Regularization","date":"2021-06-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/deq","path":"lib/jacobian.py","file_url":"https://github.com/locuslab/deq/blob/HEAD/lib/jacobian.py","status":"unverified","verification_level":0,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8a2cfe51ec1c04e7","code_sha256_prefix":"8a2cfe51ec1c04e7","mcp_get_code":{"code_sha256":"8a2cfe51ec1c04e7"}},{"arxiv_id":"2012.04524","arxiv_id_is_arxiv":true,"paper":"/paper/construction-of-optimal-spectral-methods-in","title":"Construction of optimal spectral methods in phase retrieval","date":null,"month_inferred_from_arxiv_id":"2020-12","title_source":"archive","repo":"AnMaillard/Optimal_Spectral_Methods_PR","path":"Class/Spectral.py","file_url":"https://github.com/AnMaillard/Optimal_Spectral_Methods_PR/blob/HEAD/Class/Spectral.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, AnMaillard/Optimal_Spectral_Methods_PR when it was checked","code_sha256":"75f9a00d5a1af5e0","code_sha256_prefix":"75f9a00d5a1af5e0","mcp_get_code":{"code_sha256":"75f9a00d5a1af5e0"}}],"record_sha256":"fc47988cd847f76510ddf075e8c973050c9ed2ae847c64c4d847c0148bd2b923","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}