{"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/broyden","entry":"broyden","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":7,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":5,"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":2,"n_samples_instrument":5,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"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":0,"ran_fixture":5,"ran":2,"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.03297","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-03297","title":"Lipschitz Multiscale Deep Equilibrium Models: A Theoretically Guaranteed and Accelerated Approach","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"iiduka-researches/Lipschitz_mdeq","path":"MDEQ-Vision/lib/modules/deq2d.py","file_url":"https://github.com/iiduka-researches/Lipschitz_mdeq/blob/HEAD/MDEQ-Vision/lib/modules/deq2d.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":"26c7b046b91c7aeb","code_sha256_prefix":"26c7b046b91c7aeb","mcp_get_code":{"code_sha256":"26c7b046b91c7aeb"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"823ec2857d23bdea","code_sha256_prefix":"823ec2857d23bdea","mcp_get_code":{"code_sha256":"823ec2857d23bdea"}},{"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":"c41a2314e7abcf2d","code_sha256_prefix":"c41a2314e7abcf2d","mcp_get_code":{"code_sha256":"c41a2314e7abcf2d"}},{"arxiv_id":"2210.12867","arxiv_id_is_arxiv":true,"paper":"/paper/deep-equilibrium-approaches-to-diffusion","title":"Deep Equilibrium Approaches to Diffusion Models","date":"2022-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"locuslab/deq-ddim","path":"functions/latent_space_opt_anderson.py","file_url":"https://github.com/locuslab/deq-ddim/blob/HEAD/functions/latent_space_opt_anderson.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"dfda7d6ea8b826b5","code_sha256_prefix":"dfda7d6ea8b826b5","mcp_get_code":{"code_sha256":"dfda7d6ea8b826b5"}},{"arxiv_id":"2112.07471","arxiv_id_is_arxiv":true,"paper":"/paper/i-m-avatar-implicit-morphable-head-avatars","title":"I M Avatar: Implicit Morphable Head Avatars from Videos","date":"2021-12-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhengyuf/imavatar","path":"code/model/broyden.py","file_url":"https://github.com/zhengyuf/imavatar/blob/HEAD/code/model/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":"1d957d803f6ebba0","code_sha256_prefix":"1d957d803f6ebba0","mcp_get_code":{"code_sha256":"1d957d803f6ebba0"}},{"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":"pkuxmq/ide-fsnn","path":"modules/snnide_module.py","file_url":"https://github.com/pkuxmq/ide-fsnn/blob/HEAD/modules/snnide_module.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, pkuxmq/ide-fsnn when it was checked","code_sha256":"ddffc87f2eef8c29","code_sha256_prefix":"ddffc87f2eef8c29","mcp_get_code":{"code_sha256":"ddffc87f2eef8c29"}},{"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_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a81c836987d9cfc8","code_sha256_prefix":"a81c836987d9cfc8","mcp_get_code":{"code_sha256":"a81c836987d9cfc8"}},{"arxiv_id":"2104.03953","arxiv_id_is_arxiv":true,"paper":"/paper/snarf-differentiable-forward-skinning-for","title":"SNARF: Differentiable Forward Skinning for Animating Non-Rigid Neural Implicit Shapes","date":"2021-04-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xuchen-ethz/SNARF","path":"lib/model/broyden.py","file_url":"https://github.com/xuchen-ethz/SNARF/blob/HEAD/lib/model/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":"876e716af6ec6e34","code_sha256_prefix":"876e716af6ec6e34","mcp_get_code":{"code_sha256":"876e716af6ec6e34"}}],"record_sha256":"89b242e25309873d3e4321957b8921f9d31c2c11e1c63e0f91224bf2dd6847e9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}