{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/code/xent","entry":"xent","source":"Syntology graph, per-sample; not an archive number","read_at":"2026-09-24T18:15:14+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.","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; our fixture could not drive it","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"n_papers":5,"n_papers_ran":3,"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":4,"n_samples_ran":2,"n_samples_fingerprinted":1,"n_places":5,"n_places_pointer_only":2,"by_status":{"ran_honours":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":2,"unverified":2},"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":"2407.17396","paper":"/paper/systematic-reasoning-about-relational-domains","title":"Systematic Reasoning About Relational Domains With Graph Neural Networks","date":"2024-07-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"erg0dic/gnn-sg","path":"src/model_nbf_fb.py","file_url":"https://github.com/erg0dic/gnn-sg/blob/HEAD/src/model_nbf_fb.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"c55be2270957af67","mcp_get_code":{"code_sha256":"c55be2270957af67"}},{"arxiv_id":"2405.15551","paper":"/paper/thinking-forward-memory-efficient-federated","title":"Thinking Forward: Memory-Efficient Federated Finetuning of Language Models","date":"2024-05-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Astuary/Spry","path":"utils/forward_AD_loss.py","file_url":"https://github.com/Astuary/Spry/blob/HEAD/utils/forward_AD_loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"459bc0b35c09b3ca","mcp_get_code":{"code_sha256":"459bc0b35c09b3ca"}},{"arxiv_id":"2202.08587","paper":"/paper/gradients-without-backpropagation","title":"Gradients without Backpropagation","date":"2022-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"orobix/fwdgrad","path":"fwdgrad/loss.py","file_url":"https://github.com/orobix/fwdgrad/blob/HEAD/fwdgrad/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"code_sha256_prefix":"459bc0b35c09b3ca","mcp_get_code":{"code_sha256":"459bc0b35c09b3ca"}},{"arxiv_id":"2006.07500","paper":"/paper/domain-generalization-using-causal-matching-1","title":"Domain Generalization using Causal Matching","date":"2020-06-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"biomedia-mira/masf","path":"masf_func.py","file_url":"https://github.com/biomedia-mira/masf/blob/HEAD/masf_func.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"code_sha256_prefix":"0bf65cfc625e3b75","mcp_get_code":{"code_sha256":"0bf65cfc625e3b75"}},{"arxiv_id":"1703.03400","paper":"/paper/model-agnostic-meta-learning-for-fast","title":"Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networks","date":"2017-03-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lgcollins/tr-maml","path":"sinusoid/maml.py","file_url":"https://github.com/lgcollins/tr-maml/blob/HEAD/sinusoid/maml.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"code_sha256_prefix":"6318e1b6fc749097","mcp_get_code":{"code_sha256":"6318e1b6fc749097"}}]}