{"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/projection","entry":"projection","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":18,"n_papers_ran":17,"n_papers_ran_no_instrument_failure":9,"n_papers_ran_instrument_only":8,"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":18,"n_samples_ran":17,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":9,"n_samples_unverified":1,"n_samples_fingerprinted":10,"n_places":19,"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":7,"ran_fixture":2,"ran":8,"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.00160","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-00160","title":"DataShield: Safety-degrading Data Filtering for LLM Benign Instruction Fine-Tuning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"ZJunBo/DataShield","path":"datashield/compute_projections.py","file_url":"https://github.com/ZJunBo/DataShield/blob/HEAD/datashield/compute_projections.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, ZJunBo/DataShield when it was checked","code_sha256":"4ca5ec3965dafbde","code_sha256_prefix":"4ca5ec3965dafbde","mcp_get_code":{"code_sha256":"4ca5ec3965dafbde"}},{"arxiv_id":"2605.12813","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-12813","title":"REALISTA: Realistic Latent Adversarial Attacks that Elicit LLM Hallucinations","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"Buyun-Liang/REALISTA","path":"src/realista.py","file_url":"https://github.com/Buyun-Liang/REALISTA/blob/HEAD/src/realista.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90c470e61ee1a1fd","code_sha256_prefix":"90c470e61ee1a1fd","mcp_get_code":{"code_sha256":"90c470e61ee1a1fd"}},{"arxiv_id":"2510.11133","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-11133","title":"Test-Time Adaptation by Causal Trimming","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"NancyQuris/TACT","path":"methods/tact.py","file_url":"https://github.com/NancyQuris/TACT/blob/HEAD/methods/tact.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"ef39939a469e52e9","code_sha256_prefix":"ef39939a469e52e9","mcp_get_code":{"code_sha256":"ef39939a469e52e9"}},{"arxiv_id":"2506.06866","arxiv_id_is_arxiv":true,"paper":"/paper/safe-finding-sparse-and-flat-minima-to","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","date":"2025-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"log-postech/safe-jax","path":"sparsify/safe.py","file_url":"https://github.com/log-postech/safe-jax/blob/HEAD/sparsify/safe.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"5ce6dac896cdfdbd","code_sha256_prefix":"5ce6dac896cdfdbd","mcp_get_code":{"code_sha256":"5ce6dac896cdfdbd"}},{"arxiv_id":"2506.06866","arxiv_id_is_arxiv":true,"paper":"/paper/safe-finding-sparse-and-flat-minima-to","title":"SAFE: Finding Sparse and Flat Minima to Improve Pruning","date":"2025-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LOG-postech/safe-torch","path":"language/lib/prune.py","file_url":"https://github.com/LOG-postech/safe-torch/blob/HEAD/language/lib/prune.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":"f2be2a9f4b2b8076","code_sha256_prefix":"f2be2a9f4b2b8076","mcp_get_code":{"code_sha256":"f2be2a9f4b2b8076"}},{"arxiv_id":"2410.02762","arxiv_id_is_arxiv":true,"paper":"/paper/interpreting-and-editing-vision-language","title":"Interpreting and Editing Vision-Language Representations to Mitigate Hallucinations","date":"2024-10-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nickjiang2378/vl-interp","path":"methods/algorithms.py","file_url":"https://github.com/nickjiang2378/vl-interp/blob/HEAD/methods/algorithms.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"CC0-1.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f04ac0937ce8c5b5","code_sha256_prefix":"f04ac0937ce8c5b5","mcp_get_code":{"code_sha256":"f04ac0937ce8c5b5"}},{"arxiv_id":"2407.04699","arxiv_id_is_arxiv":true,"paper":"/paper/lara-efficient-large-baseline-radiance-fields","title":"LaRa: Efficient Large-Baseline Radiance Fields","date":"2024-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"autonomousvision/lara","path":"lightning/network.py","file_url":"https://github.com/autonomousvision/lara/blob/HEAD/lightning/network.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":"6c0f59b4d8f741f3","code_sha256_prefix":"6c0f59b4d8f741f3","mcp_get_code":{"code_sha256":"6c0f59b4d8f741f3"}},{"arxiv_id":"2305.19529","arxiv_id_is_arxiv":true,"paper":"/paper/offline-meta-reinforcement-learning-with-in","title":"Offline Meta Reinforcement Learning with In-Distribution Online Adaptation","date":"2023-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nagisazj/idaq_public","path":"generate_plot.py","file_url":"https://github.com/nagisazj/idaq_public/blob/HEAD/generate_plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, nagisazj/idaq_public, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"ed1753e7074e4847","code_sha256_prefix":"ed1753e7074e4847","mcp_get_code":{"code_sha256":"ed1753e7074e4847"}},{"arxiv_id":"2203.06442","arxiv_id_is_arxiv":true,"paper":"/paper/equivariant-graph-mechanics-networks-with","title":"Equivariant Graph Mechanics Networks with Constraints","date":"2022-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hanjq17/gmn","path":"spatial_graph/n_body_system/dataset/physical_objects.py","file_url":"https://github.com/hanjq17/gmn/blob/HEAD/spatial_graph/n_body_system/dataset/physical_objects.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":"0f4545be8210f37b","code_sha256_prefix":"0f4545be8210f37b","mcp_get_code":{"code_sha256":"0f4545be8210f37b"}},{"arxiv_id":"2012.06743","arxiv_id_is_arxiv":true,"paper":"/paper/are-we-ready-for-learned-cardinality","title":"Are We Ready For Learned Cardinality Estimation?","date":"2020-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sfu-db/AreCELearnedYet","path":"lecarb/estimator/deepdb/aqp_spn/aqp_spn.py","file_url":"https://github.com/sfu-db/AreCELearnedYet/blob/HEAD/lecarb/estimator/deepdb/aqp_spn/aqp_spn.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f48b43978866b103","code_sha256_prefix":"f48b43978866b103","mcp_get_code":{"code_sha256":"f48b43978866b103"}},{"arxiv_id":"2010.01112","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-fully-offline-meta-reinforcement","title":"FOCAL: Efficient Fully-Offline Meta-Reinforcement Learning via Distance Metric Learning and Behavior Regularization","date":"2020-10-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FOCAL-ICLR/FOCAL-ICLR","path":"generate_plot.py","file_url":"https://github.com/FOCAL-ICLR/FOCAL-ICLR/blob/HEAD/generate_plot.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, FOCAL-ICLR/FOCAL-ICLR, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"ed1753e7074e4847","code_sha256_prefix":"ed1753e7074e4847","mcp_get_code":{"code_sha256":"ed1753e7074e4847"}},{"arxiv_id":"2006.08217","arxiv_id_is_arxiv":true,"paper":"/paper/slowing-down-the-weight-norm-increase-in","title":"AdamP: Slowing Down the Slowdown for Momentum Optimizers on Scale-invariant Weights","date":"2020-06-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rwightman/pytorch-image-models","path":"timm/optim/adamp.py","file_url":"https://github.com/rwightman/pytorch-image-models/blob/HEAD/timm/optim/adamp.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"de5acc29c73a2126","code_sha256_prefix":"de5acc29c73a2126","mcp_get_code":{"code_sha256":"de5acc29c73a2126"}},{"arxiv_id":"2004.01314","arxiv_id_is_arxiv":true,"paper":"/paper/towards-better-generalization-joint-depth","title":"Towards Better Generalization: Joint Depth-Pose Learning without PoseNet","date":"2020-04-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"B1ueber2y/TrianFlow","path":"infer_vo.py","file_url":"https://github.com/B1ueber2y/TrianFlow/blob/HEAD/infer_vo.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":"722c49a1e9f7a775","code_sha256_prefix":"722c49a1e9f7a775","mcp_get_code":{"code_sha256":"722c49a1e9f7a775"}},{"arxiv_id":"1911.00822","arxiv_id_is_arxiv":true,"paper":"/paper/comprehensive-snn-compression-using-admm","title":"Comprehensive SNN Compression Using ADMM Optimization and Activity Regularization","date":"2019-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yjwu17/ADMM-Compression-for-SNNs","path":"torch_prune_utility.py","file_url":"https://github.com/yjwu17/ADMM-Compression-for-SNNs/blob/HEAD/torch_prune_utility.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":"a88bdd389d8a7d0b","code_sha256_prefix":"a88bdd389d8a7d0b","mcp_get_code":{"code_sha256":"a88bdd389d8a7d0b"}},{"arxiv_id":"1901.09216","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-generalized-recursive-reasoning","title":"Modelling Bounded Rationality in Multi-Agent Interactions by Generalized Recursive Reasoning","date":"2019-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ying-wen/gr2","path":"code/maci/utils.py","file_url":"https://github.com/ying-wen/gr2/blob/HEAD/code/maci/utils.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":"a292492441660b58","code_sha256_prefix":"a292492441660b58","mcp_get_code":{"code_sha256":"a292492441660b58"}},{"arxiv_id":"1808.07699","arxiv_id_is_arxiv":true,"paper":"/paper/end-to-end-neural-entity-linking","title":"End-to-End Neural Entity Linking","date":"2018-08-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dalab/end2end_neural_el","path":"code/model/util.py","file_url":"https://github.com/dalab/end2end_neural_el/blob/HEAD/code/model/util.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":"cc4b9136dc71723e","code_sha256_prefix":"cc4b9136dc71723e","mcp_get_code":{"code_sha256":"cc4b9136dc71723e"}},{"arxiv_id":"1807.10300","arxiv_id_is_arxiv":true,"paper":"/paper/discovering-physical-concepts-with-neural","title":"Discovering physical concepts with neural networks","date":"2018-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"eth-nn-physics/nn_physical_concepts","path":"scinet/ed_quantum.py","file_url":"https://github.com/eth-nn-physics/nn_physical_concepts/blob/HEAD/scinet/ed_quantum.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":"487e6d621bcc2fa7","code_sha256_prefix":"487e6d621bcc2fa7","mcp_get_code":{"code_sha256":"487e6d621bcc2fa7"}},{"arxiv_id":"1806.00088","arxiv_id_is_arxiv":true,"paper":"/paper/peernets-exploiting-peer-wisdom-against","title":"PeerNets: Exploiting Peer Wisdom Against Adversarial Attacks","date":"2018-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tantara/PeerNets-pytorch","path":"src/utee/universal_perturbation.py","file_url":"https://github.com/tantara/PeerNets-pytorch/blob/HEAD/src/utee/universal_perturbation.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":"2ec345a880b3d439","code_sha256_prefix":"2ec345a880b3d439","mcp_get_code":{"code_sha256":"2ec345a880b3d439"}},{"arxiv_id":"aaai_28994","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_28994","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Alrash/EDM","path":"mix.py","file_url":"https://github.com/Alrash/EDM/blob/HEAD/mix.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":"2b8ab603a6727f76","code_sha256_prefix":"2b8ab603a6727f76","mcp_get_code":{"code_sha256":"2b8ab603a6727f76"}}],"record_sha256":"4919189afe2a8e40a9ff00eb098934d0fbfc8e6509446f948d172ad22a5076ae","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}