{"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/sparsify","entry":"sparsify","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":4,"n_papers_ran_no_instrument_failure":3,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":5,"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":1,"ran_fixture":0,"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":"2606.03391","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-03391","title":"When Model Merging Breaks Routing: Training-Free Calibration for MoE","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"huangcb01/HARC","path":"src/merge_method/gta.py","file_url":"https://github.com/huangcb01/HARC/blob/HEAD/src/merge_method/gta.py","status":"ran","verification_level":1,"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, huangcb01/HARC when it was checked","code_sha256":"46980fa811f69587","code_sha256_prefix":"46980fa811f69587","mcp_get_code":{"code_sha256":"46980fa811f69587"}},{"arxiv_id":"2305.14294","arxiv_id_is_arxiv":true,"paper":"/paper/unbiasing-time-dependent-variational-monte","title":"Unbiasing time-dependent Variational Monte Carlo by projected quantum evolution","date":null,"month_inferred_from_arxiv_id":"2023-05","title_source":"archive","repo":"netket/netket_fidelity","path":"netket_fidelity/infidelity/overlap_U/exact.py","file_url":"https://github.com/netket/netket_fidelity/blob/HEAD/netket_fidelity/infidelity/overlap_U/exact.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fd95f3900ca50143","code_sha256_prefix":"fd95f3900ca50143","mcp_get_code":{"code_sha256":"fd95f3900ca50143"}},{"arxiv_id":"2210.01738","arxiv_id_is_arxiv":true,"paper":"/paper/asif-coupled-data-turns-unimodal-models-to-1","title":"ASIF: Coupled Data Turns Unimodal Models to Multimodal Without Training","date":"2022-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"noranta4/asif","path":"relreps.py","file_url":"https://github.com/noranta4/asif/blob/HEAD/relreps.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":"b2e3d82412c09f49","code_sha256_prefix":"b2e3d82412c09f49","mcp_get_code":{"code_sha256":"b2e3d82412c09f49"}},{"arxiv_id":"1910.00130","arxiv_id_is_arxiv":true,"paper":"/paper/track-to-reconstruct-and-reconstruct-to-track","title":"Track to Reconstruct and Reconstruct to Track","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tobiasfshr/MOTSFusion","path":"tracker/create_dynamic_transforms.py","file_url":"https://github.com/tobiasfshr/MOTSFusion/blob/HEAD/tracker/create_dynamic_transforms.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":"3ca7f3e091c53787","code_sha256_prefix":"3ca7f3e091c53787","mcp_get_code":{"code_sha256":"3ca7f3e091c53787"}},{"arxiv_id":"1810.04468","arxiv_id_is_arxiv":true,"paper":"/paper/decentralized-cooperative-stochastic-multi","title":"Decentralized Cooperative Stochastic Bandits","date":"2018-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damaru2/decentralized-bandits","path":"utils.py","file_url":"https://github.com/damaru2/decentralized-bandits/blob/HEAD/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_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, damaru2/decentralized-bandits when it was checked","code_sha256":"57fd79bfdc9a457e","code_sha256_prefix":"57fd79bfdc9a457e","mcp_get_code":{"code_sha256":"57fd79bfdc9a457e"}}],"record_sha256":"a5614ffdd873b9d9efa004019f80a4d3e66054145c6f18c9e4e87e8733bbe98a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}