{"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/human-format","entry":"human_format","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":11,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":2,"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":6,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":4,"n_places":11,"n_places_pointer_only":3,"n_places_pointer_only_link_open":1,"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":3,"ran_fixture":0,"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":"2501.04961","arxiv_id_is_arxiv":true,"paper":"/paper/demystifying-domain-adaptive-post-training","title":"Demystifying Domain-adaptive Post-training for Financial LLMs","date":"2025-01-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salesforceairesearch/findap","path":"FinDAP/utils/model.py","file_url":"https://github.com/salesforceairesearch/findap/blob/HEAD/FinDAP/utils/model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"Apache-2.0, as GitHub detects it on this paper's repository, salesforceairesearch/findap, 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":"eb4492b8e8e4c8a7","code_sha256_prefix":"eb4492b8e8e4c8a7","mcp_get_code":{"code_sha256":"eb4492b8e8e4c8a7"}},{"arxiv_id":"2305.11141","arxiv_id_is_arxiv":true,"paper":"/paper/clifford-group-equivariant-neural-networks-1","title":"Clifford Group Equivariant Neural Networks","date":"2023-05-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"DavidRuhe/clifford-group-equivariant-neural-networks","path":"engineer/trainer/trainer.py","file_url":"https://github.com/DavidRuhe/clifford-group-equivariant-neural-networks/blob/HEAD/engineer/trainer/trainer.py","status":"unverified","verification_level":0,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2a4f461dbf4cebcf","code_sha256_prefix":"2a4f461dbf4cebcf","mcp_get_code":{"code_sha256":"2a4f461dbf4cebcf"}},{"arxiv_id":"2304.05288","arxiv_id_is_arxiv":true,"paper":"/paper/task-difficulty-aware-parameter-allocation","title":"Task Difficulty Aware Parameter Allocation & Regularization for Lifelong Learning","date":"2023-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wenjinw/par","path":"src/models/par_model.py","file_url":"https://github.com/wenjinw/par/blob/HEAD/src/models/par_model.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9c53cf324fd348a2","code_sha256_prefix":"9c53cf324fd348a2","mcp_get_code":{"code_sha256":"9c53cf324fd348a2"}},{"arxiv_id":"2205.05198","arxiv_id_is_arxiv":true,"paper":"/paper/reducing-activation-recomputation-in-large","title":"Reducing Activation Recomputation in Large Transformer Models","date":"2022-05-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"calculon-ai/calculon","path":"calculon/util.py","file_url":"https://github.com/calculon-ai/calculon/blob/HEAD/calculon/util.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":"c5385a4a3b7488d7","code_sha256_prefix":"c5385a4a3b7488d7","mcp_get_code":{"code_sha256":"c5385a4a3b7488d7"}},{"arxiv_id":"2107.02331","arxiv_id_is_arxiv":true,"paper":"/paper/mind-your-outliers-investigating-the-negative","title":"Mind Your Outliers! Investigating the Negative Impact of Outliers on Active Learning for Visual Question Answering","date":"2021-07-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"siddk/vqa-outliers","path":"chart.py","file_url":"https://github.com/siddk/vqa-outliers/blob/HEAD/chart.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"GPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GPL-3.0, as GitHub detects it on this paper's repository, siddk/vqa-outliers, is not in the permissive set Syntology serves inline","code_sha256":"2844a6a8960060bc","code_sha256_prefix":"2844a6a8960060bc","mcp_get_code":{"code_sha256":"2844a6a8960060bc"}},{"arxiv_id":"2010.01528","arxiv_id_is_arxiv":true,"paper":"/paper/remembering-for-the-right-reasons-1","title":"Remembering for the Right Reasons: Explanations Reduce Catastrophic Forgetting","date":"2020-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SaynaEbrahimi/Remembering-for-the-Right-Reasons","path":"src/approaches/rrr.py","file_url":"https://github.com/SaynaEbrahimi/Remembering-for-the-Right-Reasons/blob/HEAD/src/approaches/rrr.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb4492b8e8e4c8a7","code_sha256_prefix":"eb4492b8e8e4c8a7","mcp_get_code":{"code_sha256":"eb4492b8e8e4c8a7"}},{"arxiv_id":"2005.08392","arxiv_id_is_arxiv":true,"paper":"/paper/vector-quantized-autoregressive-predictive","title":"Vector-Quantized Autoregressive Predictive Coding","date":"2020-05-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Alexander-H-Liu/NPC","path":"src/util.py","file_url":"https://github.com/Alexander-H-Liu/NPC/blob/HEAD/src/util.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":"7018e387e45bfc5a","code_sha256_prefix":"7018e387e45bfc5a","mcp_get_code":{"code_sha256":"7018e387e45bfc5a"}},{"arxiv_id":"2003.09553","arxiv_id_is_arxiv":true,"paper":"/paper/adversarial-continual-learning","title":"Adversarial Continual Learning","date":"2020-03-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"facebookresearch/Adversarial-Continual-Learning","path":"src/utils.py","file_url":"https://github.com/facebookresearch/Adversarial-Continual-Learning/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb4492b8e8e4c8a7","code_sha256_prefix":"eb4492b8e8e4c8a7","mcp_get_code":{"code_sha256":"eb4492b8e8e4c8a7"}},{"arxiv_id":"1911.03584","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-relationship-between-self-attention-1","title":"On the Relationship between Self-Attention and Convolutional Layers","date":"2019-11-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"epfml/attention-cnn","path":"utils/logging.py","file_url":"https://github.com/epfml/attention-cnn/blob/HEAD/utils/logging.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from siddk/vqa-outliers, and GPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"2844a6a8960060bc","code_sha256_prefix":"2844a6a8960060bc","mcp_get_code":{"code_sha256":"2844a6a8960060bc"}},{"arxiv_id":"1906.02425","arxiv_id_is_arxiv":true,"paper":"/paper/uncertainty-guided-continual-learning-with","title":"Uncertainty-guided Continual Learning with Bayesian Neural Networks","date":"2019-06-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"SaynaEbrahimi/UCB","path":"src/utils.py","file_url":"https://github.com/SaynaEbrahimi/UCB/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb4492b8e8e4c8a7","code_sha256_prefix":"eb4492b8e8e4c8a7","mcp_get_code":{"code_sha256":"eb4492b8e8e4c8a7"}},{"arxiv_id":"1906.00794","arxiv_id_is_arxiv":true,"paper":"/paper/190600794","title":"Blow: a single-scale hyperconditioned flow for non-parallel raw-audio voice conversion","date":"2019-06-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joansj/blow","path":"src/utils/utils.py","file_url":"https://github.com/joansj/blow/blob/HEAD/src/utils/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"eb4492b8e8e4c8a7","code_sha256_prefix":"eb4492b8e8e4c8a7","mcp_get_code":{"code_sha256":"eb4492b8e8e4c8a7"}}],"record_sha256":"808bd07ac594060f981dfc42e4ed28aeef48a919761e29708bf4fc5d63191c79","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}