{"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/forward-backward","entry":"forward_backward","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":5,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":1,"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":5,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":5,"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":0,"ran_fixture":1,"ran":0,"unverified":4},"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":"2406.08938","arxiv_id_is_arxiv":true,"paper":"/paper/mirror-and-preconditioned-gradient-descent-in","title":"Mirror and Preconditioned Gradient Descent in Wasserstein Space","date":"2024-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clbonet/Mirror_and_Preconditioned_Gradient_Descent_in_Wasserstein_Space","path":"lib_jax/mirror_gaussians.py","file_url":"https://github.com/clbonet/Mirror_and_Preconditioned_Gradient_Descent_in_Wasserstein_Space/blob/HEAD/lib_jax/mirror_gaussians.py","status":"unverified","verification_level":0,"contract_check":null,"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, clbonet/Mirror_and_Preconditioned_Gradient_Descent_in_Wasserstein_Space when it was checked","code_sha256":"becb8047c46a5257","code_sha256_prefix":"becb8047c46a5257","mcp_get_code":{"code_sha256":"becb8047c46a5257"}},{"arxiv_id":"2401.12973","arxiv_id_is_arxiv":true,"paper":"/paper/in-context-language-learning-arhitectures-and","title":"In-Context Language Learning: Architectures and Algorithms","date":"2024-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"berlino/seq_icl","path":"batched_baum_welch.py","file_url":"https://github.com/berlino/seq_icl/blob/HEAD/batched_baum_welch.py","status":"unverified","verification_level":0,"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":"7d16fa77eed96638","code_sha256_prefix":"7d16fa77eed96638","mcp_get_code":{"code_sha256":"7d16fa77eed96638"}},{"arxiv_id":"2012.14952","arxiv_id_is_arxiv":true,"paper":"/paper/bayesian-hmm-clustering-of-x-vector-sequences","title":"Bayesian HMM clustering of x-vector sequences (VBx) in speaker diarization: theory, implementation and analysis on standard tasks","date":null,"month_inferred_from_arxiv_id":"2020-12","title_source":"archive","repo":"BUTSpeechFIT/VBx","path":"VBx/VBx.py","file_url":"https://github.com/BUTSpeechFIT/VBx/blob/HEAD/VBx/VBx.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, BUTSpeechFIT/VBx when it was checked","code_sha256":"259e6f64ed883164","code_sha256_prefix":"259e6f64ed883164","mcp_get_code":{"code_sha256":"259e6f64ed883164"}},{"arxiv_id":"1711.10925","arxiv_id_is_arxiv":true,"paper":"/paper/deep-image-prior","title":"Deep Image Prior","date":"2017-11-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dniku/perceptual-gradient-networks","path":"train_pgn.py","file_url":"https://github.com/dniku/perceptual-gradient-networks/blob/HEAD/train_pgn.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MPL-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MPL-2.0, as GitHub detects it on this paper's repository, dniku/perceptual-gradient-networks, is not in the permissive set Syntology serves inline","code_sha256":"5be41c66fa843db4","code_sha256_prefix":"5be41c66fa843db4","mcp_get_code":{"code_sha256":"5be41c66fa843db4"}},{"arxiv_id":"Feng_Optimal_Gradient_Checkpoint_Search_for_Arbitrary_Computation_Graphs_CVPR_2021_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Feng_Optimal_Gradient_Checkpoint_Search_for_Arbitrary_Computation_Graphs_CVPR_2021_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"lordfjw/OptimalGradCheckpointing","path":"benchmark.py","file_url":"https://github.com/lordfjw/OptimalGradCheckpointing/blob/HEAD/benchmark.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":"1b8472ebfaaeee99","code_sha256_prefix":"1b8472ebfaaeee99","mcp_get_code":{"code_sha256":"1b8472ebfaaeee99"}}],"record_sha256":"b15ecfe0c1e37685f6c58a591c110fcd9d081bd0e3e996967d944e2e5f25d221","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}