{"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/line-search","entry":"line_search","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":14,"n_papers_ran":13,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":9,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":4,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":15,"n_places_pointer_only":6,"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":3,"ran_fixture":1,"ran":3,"unverified":1},"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/solvers.py","file_url":"https://github.com/landrarwolf/CDEQ/blob/HEAD/CDEQ-src/lib/solvers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","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":"cf5710371bcfb0ab","code_sha256_prefix":"cf5710371bcfb0ab","mcp_get_code":{"code_sha256":"cf5710371bcfb0ab"}},{"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/solvers.py","file_url":"https://github.com/WeizhiGao/Serialized-Randomized-Smoothing/blob/HEAD/DEQ/lib/solvers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf5710371bcfb0ab","code_sha256_prefix":"cf5710371bcfb0ab","mcp_get_code":{"code_sha256":"cf5710371bcfb0ab"}},{"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/solver/broyden.py","file_url":"https://github.com/locuslab/torchdeq/blob/HEAD/torchdeq/solver/broyden.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3c0e1781de7876ee","code_sha256_prefix":"3c0e1781de7876ee","mcp_get_code":{"code_sha256":"3c0e1781de7876ee"}},{"arxiv_id":"2308.10873","arxiv_id_is_arxiv":true,"paper":"/paper/spikingbert-distilling-bert-to-train-spiking","title":"SpikingBERT: Distilling BERT to Train Spiking Language Models Using Implicit Differentiation","date":"2023-08-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"neurocomplab-psu/spikingbert","path":"implicit_bert/modules/broyden.py","file_url":"https://github.com/neurocomplab-psu/spikingbert/blob/HEAD/implicit_bert/modules/broyden.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, neurocomplab-psu/spikingbert when it was checked","code_sha256":"cf5710371bcfb0ab","code_sha256_prefix":"cf5710371bcfb0ab","mcp_get_code":{"code_sha256":"cf5710371bcfb0ab"}},{"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/solvers.py","file_url":"https://github.com/locuslab/deq/blob/HEAD/lib/solvers.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf5710371bcfb0ab","code_sha256_prefix":"cf5710371bcfb0ab","mcp_get_code":{"code_sha256":"cf5710371bcfb0ab"}},{"arxiv_id":"2304.00600","arxiv_id_is_arxiv":true,"paper":"/paper/recurrence-without-recurrence-stable-video","title":"Recurrence without Recurrence: Stable Video Landmark Detection with Deep Equilibrium Models","date":"2023-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"polo5/LDEQ_RwR","path":"models/ldeq.py","file_url":"https://github.com/polo5/LDEQ_RwR/blob/HEAD/models/ldeq.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, polo5/LDEQ_RwR (NOASSERTION)","code_sha256":"f90371a4652d3eba","code_sha256_prefix":"f90371a4652d3eba","mcp_get_code":{"code_sha256":"f90371a4652d3eba"}},{"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/modules/broyden.py","file_url":"https://github.com/gsunshine/phantom_grad/blob/HEAD/MDEQ/MDEQ_ImageNet/modules/broyden.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"cf5710371bcfb0ab","code_sha256_prefix":"cf5710371bcfb0ab","mcp_get_code":{"code_sha256":"cf5710371bcfb0ab"}},{"arxiv_id":"2110.10249","arxiv_id_is_arxiv":true,"paper":"/paper/neural-stochastic-partial-differential","title":"Neural Stochastic PDEs: Resolution-Invariant Learning of Continuous Spatiotemporal Dynamics","date":"2021-10-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"crispitagorico/neural-spdes","path":"torchspde/root_finding_algorithms.py","file_url":"https://github.com/crispitagorico/neural-spdes/blob/HEAD/torchspde/root_finding_algorithms.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e551f7f67056cb3","code_sha256_prefix":"2e551f7f67056cb3","mcp_get_code":{"code_sha256":"2e551f7f67056cb3"}},{"arxiv_id":"2109.14247","arxiv_id_is_arxiv":true,"paper":"/paper/training-feedback-spiking-neural-networks-by","title":"Training Feedback Spiking Neural Networks by Implicit Differentiation on the Equilibrium State","date":"2021-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"deterministic","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":"cf5710371bcfb0ab","code_sha256_prefix":"cf5710371bcfb0ab","mcp_get_code":{"code_sha256":"cf5710371bcfb0ab"}},{"arxiv_id":"2106.08748","arxiv_id_is_arxiv":true,"paper":"/paper/input-invex-neural-network","title":"Input Invex Neural Network","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tsumansapkota/Input-Invex-Neural-Network","path":"nflib/utils/broyden.py","file_url":"https://github.com/tsumansapkota/Input-Invex-Neural-Network/blob/HEAD/nflib/utils/broyden.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2e551f7f67056cb3","code_sha256_prefix":"2e551f7f67056cb3","mcp_get_code":{"code_sha256":"2e551f7f67056cb3"}},{"arxiv_id":"2106.00553","arxiv_id_is_arxiv":true,"paper":"/paper/shine-sharing-the-inverse-estimate-from-the","title":"SHINE: SHaring the INverse Estimate from the forward pass for bi-level optimization and implicit models","date":"2021-06-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zaccharieramzi/shine","path":"mdeq_lib/modules/broyden.py","file_url":"https://github.com/zaccharieramzi/shine/blob/HEAD/mdeq_lib/modules/broyden.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":"966302ea67632045","code_sha256_prefix":"966302ea67632045","mcp_get_code":{"code_sha256":"966302ea67632045"}},{"arxiv_id":"1901.05134","arxiv_id_is_arxiv":true,"paper":"/paper/dingo-distributed-newton-type-method-for","title":"DINGO: Distributed Newton-Type Method for Gradient-Norm Optimization","date":"2019-01-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"RixonC/DINGO","path":"GIANT.py","file_url":"https://github.com/RixonC/DINGO/blob/HEAD/GIANT.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9da5748a7cdf1878","code_sha256_prefix":"9da5748a7cdf1878","mcp_get_code":{"code_sha256":"9da5748a7cdf1878"}},{"arxiv_id":"1705.10528","arxiv_id_is_arxiv":true,"paper":"/paper/constrained-policy-optimization","title":"Constrained Policy Optimization","date":"2017-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Bigpig4396/PyTorch-Constrained-Policy-Optimization-CPO","path":"CPO.py","file_url":"https://github.com/Bigpig4396/PyTorch-Constrained-Policy-Optimization-CPO/blob/HEAD/CPO.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Bigpig4396/PyTorch-Constrained-Policy-Optimization-CPO when it was checked","code_sha256":"8ef3c4473d33a01b","code_sha256_prefix":"8ef3c4473d33a01b","mcp_get_code":{"code_sha256":"8ef3c4473d33a01b"}},{"arxiv_id":"1705.10528","arxiv_id_is_arxiv":true,"paper":"/paper/constrained-policy-optimization","title":"Constrained Policy Optimization","date":"2017-05-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sapanachaudhary/pytorch-cpo","path":"algos/cpo.py","file_url":"https://github.com/sapanachaudhary/pytorch-cpo/blob/HEAD/algos/cpo.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":"f7c68d288ffc351b","code_sha256_prefix":"f7c68d288ffc351b","mcp_get_code":{"code_sha256":"f7c68d288ffc351b"}},{"arxiv_id":"1502.05477","arxiv_id_is_arxiv":true,"paper":"/paper/trust-region-policy-optimization","title":"Trust Region Policy Optimization","date":"2015-02-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"unverified","verification_level":0,"contract_check":null,"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":"f7c68d288ffc351b","code_sha256_prefix":"f7c68d288ffc351b","mcp_get_code":{"code_sha256":"f7c68d288ffc351b"}}],"record_sha256":"81e65e583cb104ec40169eab129760508814bf03bd803dfec624bdf4c3d4d38d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}