{"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/cov","entry":"cov","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":6,"n_papers_ran_instrument_only":7,"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":13,"n_samples_ran":12,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":6,"n_samples_unverified":1,"n_samples_fingerprinted":8,"n_places":15,"n_places_pointer_only":8,"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":2,"ran_violates":0,"ran_draft_wrong":4,"ran_fixture":2,"ran":4,"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.20666","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-20666","title":"Robust Auto-associative Memory via Convolutional Restricted Hopfield Networks","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"C16Mftang/covariance-learning-PCNs","path":"src/utils.py","file_url":"https://github.com/C16Mftang/covariance-learning-PCNs/blob/HEAD/src/utils.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, C16Mftang/covariance-learning-PCNs when it was checked","code_sha256":"c363e320ee8aa869","code_sha256_prefix":"c363e320ee8aa869","mcp_get_code":{"code_sha256":"c363e320ee8aa869"}},{"arxiv_id":"2603.14987","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-14987","title":"Beyond Benchmark Islands: Toward Representative Trustworthiness Evaluation for Agentic AI","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"TonyQJH/haaf-pilot","path":"layer4_sampling.py","file_url":"https://github.com/TonyQJH/haaf-pilot/blob/HEAD/layer4_sampling.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, TonyQJH/haaf-pilot when it was checked","code_sha256":"497f94b5c4896850","code_sha256_prefix":"497f94b5c4896850","mcp_get_code":{"code_sha256":"497f94b5c4896850"}},{"arxiv_id":"2504.15983","arxiv_id_is_arxiv":true,"paper":"/paper/w-pca-based-gradient-free-proxy-for-efficient","title":"W-PCA Based Gradient-Free Proxy for Efficient Search of Lightweight Language Models","date":"2025-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ra225/w-pca","path":"models/pca_torch.py","file_url":"https://github.com/ra225/w-pca/blob/HEAD/models/pca_torch.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, ra225/w-pca when it was checked","code_sha256":"58b4423ccd324324","code_sha256_prefix":"58b4423ccd324324","mcp_get_code":{"code_sha256":"58b4423ccd324324"}},{"arxiv_id":"2410.01022","arxiv_id_is_arxiv":true,"paper":"/paper/learning-grid-cells-by-predictive-coding","title":"Learning grid cells by predictive coding","date":"2024-10-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"C16Mftang/place-cell-pred-coding","path":"src/utils.py","file_url":"https://github.com/C16Mftang/place-cell-pred-coding/blob/HEAD/src/utils.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, C16Mftang/place-cell-pred-coding when it was checked","code_sha256":"c363e320ee8aa869","code_sha256_prefix":"c363e320ee8aa869","mcp_get_code":{"code_sha256":"c363e320ee8aa869"}},{"arxiv_id":"2403.05659","arxiv_id_is_arxiv":true,"paper":"/paper/audio-synchronized-visual-animation","title":"Audio-Synchronized Visual Animation","date":"2024-03-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lzhangbj/ASVA","path":"avgen/evaluations/dists.py","file_url":"https://github.com/lzhangbj/ASVA/blob/HEAD/avgen/evaluations/dists.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lzhangbj/ASVA when it was checked","code_sha256":"dc842b5d99a54208","code_sha256_prefix":"dc842b5d99a54208","mcp_get_code":{"code_sha256":"dc842b5d99a54208"}},{"arxiv_id":"2205.15947","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-robustness-to-dataset-shift-via","title":"Evaluating Robustness to Dataset Shift via Parametric Robustness Sets","date":"2022-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"clinicalml/parametric-robustness-evaluation","path":"source/shift_gradients.py","file_url":"https://github.com/clinicalml/parametric-robustness-evaluation/blob/HEAD/source/shift_gradients.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2050a4e77741d9b2","code_sha256_prefix":"2050a4e77741d9b2","mcp_get_code":{"code_sha256":"2050a4e77741d9b2"}},{"arxiv_id":"2109.00150","arxiv_id_is_arxiv":true,"paper":"/paper/federated-reconnaissance-efficient","title":"Federated Reconnaissance: Efficient, Distributed, Class-Incremental Learning","date":"2021-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml4ai/fed-recon","path":"fed_recon/models/protonet/jsd.py","file_url":"https://github.com/ml4ai/fed-recon/blob/HEAD/fed_recon/models/protonet/jsd.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":"6e4be2f636908c33","code_sha256_prefix":"6e4be2f636908c33","mcp_get_code":{"code_sha256":"6e4be2f636908c33"}},{"arxiv_id":"2010.12760","arxiv_id_is_arxiv":true,"paper":"/paper/gradient-flows-in-dataset-space","title":"Dataset Dynamics via Gradient Flows in Probability Space","date":"2020-10-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"microsoft/otdd","path":"otdd/pytorch/moments.py","file_url":"https://github.com/microsoft/otdd/blob/HEAD/otdd/pytorch/moments.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":"55b79342272ecb51","code_sha256_prefix":"55b79342272ecb51","mcp_get_code":{"code_sha256":"55b79342272ecb51"}},{"arxiv_id":"1811.04968","arxiv_id_is_arxiv":true,"paper":"/paper/pennylane-automatic-differentiation-of-hybrid","title":"PennyLane: Automatic differentiation of hybrid quantum-classical computations","date":"2018-11-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rickyHong/Pennylane-repl","path":"pennylane/measure.py","file_url":"https://github.com/rickyHong/Pennylane-repl/blob/HEAD/pennylane/measure.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":"694c24f2d3f0ed8f","code_sha256_prefix":"694c24f2d3f0ed8f","mcp_get_code":{"code_sha256":"694c24f2d3f0ed8f"}},{"arxiv_id":"1804.09502","arxiv_id_is_arxiv":true,"paper":"/paper/unsupervised-disentangled-representation","title":"Unsupervised Disentangled Representation Learning with Analogical Relations","date":"2018-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZejianLi/analogical-training","path":"utils_torch.py","file_url":"https://github.com/ZejianLi/analogical-training/blob/HEAD/utils_torch.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"fdef71810898429e","code_sha256_prefix":"fdef71810898429e","mcp_get_code":{"code_sha256":"fdef71810898429e"}},{"arxiv_id":"1611.07865","arxiv_id_is_arxiv":true,"paper":"/paper/controlling-perceptual-factors-in-neural","title":"Controlling Perceptual Factors in Neural Style Transfer","date":"2016-11-23","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":"invariant","behaviour_fingerprint":true,"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":"89781f43f5f94876","code_sha256_prefix":"89781f43f5f94876","mcp_get_code":{"code_sha256":"89781f43f5f94876"}},{"arxiv_id":"1609.05140","arxiv_id_is_arxiv":true,"paper":"/paper/the-option-critic-architecture","title":"The Option-Critic Architecture","date":"2016-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elitalobo/Hierarchical-RL-Algorithms","path":"option-critic/hierarchical_dqn.py","file_url":"https://github.com/elitalobo/Hierarchical-RL-Algorithms/blob/HEAD/option-critic/hierarchical_dqn.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, elitalobo/Hierarchical-RL-Algorithms when it was checked","code_sha256":"7ebafde922686c8a","code_sha256_prefix":"7ebafde922686c8a","mcp_get_code":{"code_sha256":"7ebafde922686c8a"}},{"arxiv_id":"1609.05140","arxiv_id_is_arxiv":true,"paper":"/paper/the-option-critic-architecture","title":"The Option-Critic Architecture","date":"2016-09-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"elitalobo/Hierarchical-RL-Algorithms","path":"option-critic/hierarchical_dqn.py","file_url":"https://github.com/elitalobo/Hierarchical-RL-Algorithms/blob/HEAD/option-critic/hierarchical_dqn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, elitalobo/Hierarchical-RL-Algorithms when it was checked","code_sha256":"31775f7dff0837c8","code_sha256_prefix":"31775f7dff0837c8","mcp_get_code":{"code_sha256":"31775f7dff0837c8"}},{"arxiv_id":"1603.05027","arxiv_id_is_arxiv":true,"paper":"/paper/identity-mappings-in-deep-residual-networks","title":"Identity Mappings in Deep Residual Networks","date":"2016-03-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"brain-bzh/MCNN","path":"graph_processing/generate_graph.py","file_url":"https://github.com/brain-bzh/MCNN/blob/HEAD/graph_processing/generate_graph.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b360fb65c97f182b","code_sha256_prefix":"b360fb65c97f182b","mcp_get_code":{"code_sha256":"b360fb65c97f182b"}},{"arxiv_id":"1508.06576","arxiv_id_is_arxiv":true,"paper":"/paper/a-neural-algorithm-of-artistic-style","title":"A Neural Algorithm of Artistic Style","date":"2015-08-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dstein64/pastiche","path":"pastiche/pastiche.py","file_url":"https://github.com/dstein64/pastiche/blob/HEAD/pastiche/pastiche.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"89781f43f5f94876","code_sha256_prefix":"89781f43f5f94876","mcp_get_code":{"code_sha256":"89781f43f5f94876"}}],"record_sha256":"2f9710682125daf624e35aadc5671ec73dd348a2e41b5c466ef4583a35b05a62","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}