{"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/trace","entry":"trace","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":6,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":3,"n_places":6,"n_places_pointer_only":4,"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":1,"ran_draft_wrong":2,"ran_fixture":1,"ran":0,"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":"2511.18760","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2511-18760","title":"HERMES: Towards Efficient and Verifiable Mathematical Reasoning in LLMs","date":null,"month_inferred_from_arxiv_id":"2025-11","title_source":"syntology","repo":"aziksh-ospanov/HERMES","path":"multithread_support.py","file_url":"https://github.com/aziksh-ospanov/HERMES/blob/HEAD/multithread_support.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"4b110f7f2fb2a56d","code_sha256_prefix":"4b110f7f2fb2a56d","mcp_get_code":{"code_sha256":"4b110f7f2fb2a56d"}},{"arxiv_id":"2409.19433","arxiv_id_is_arxiv":true,"paper":"/paper/rmlr-extending-multinomial-logistic","title":"RMLR: Extending Multinomial Logistic Regression into General Geometries","date":"2024-09-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gitzh-chen/rmlr","path":"RieNets/spdnets/SPDMLR.py","file_url":"https://github.com/gitzh-chen/rmlr/blob/HEAD/RieNets/spdnets/SPDMLR.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, gitzh-chen/rmlr when it was checked","code_sha256":"9df6a971538219c1","code_sha256_prefix":"9df6a971538219c1","mcp_get_code":{"code_sha256":"9df6a971538219c1"}},{"arxiv_id":"2403.11261","arxiv_id_is_arxiv":true,"paper":"/paper/a-lie-group-approach-to-riemannian-batch","title":"A Lie Group Approach to Riemannian Batch Normalization","date":"2024-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gitzh-chen/liebn","path":"LieBN_SPDNet/spd/functional.py","file_url":"https://github.com/gitzh-chen/liebn/blob/HEAD/LieBN_SPDNet/spd/functional.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, gitzh-chen/liebn when it was checked","code_sha256":"9df6a971538219c1","code_sha256_prefix":"9df6a971538219c1","mcp_get_code":{"code_sha256":"9df6a971538219c1"}},{"arxiv_id":"2201.05078","arxiv_id_is_arxiv":true,"paper":"/paper/clip-event-connecting-text-and-images-with","title":"CLIP-Event: Connecting Text and Images with Event Structures","date":"2022-01-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"limanling/clip-event","path":"src/clip-event/model_ot.py","file_url":"https://github.com/limanling/clip-event/blob/HEAD/src/clip-event/model_ot.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, limanling/clip-event when it was checked","code_sha256":"11728587f6b887ba","code_sha256_prefix":"11728587f6b887ba","mcp_get_code":{"code_sha256":"11728587f6b887ba"}},{"arxiv_id":"2006.06195","arxiv_id_is_arxiv":true,"paper":"/paper/large-scale-adversarial-training-for-vision","title":"Large-Scale Adversarial Training for Vision-and-Language Representation Learning","date":"2020-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhegan27/VILLA","path":"model/ot.py","file_url":"https://github.com/zhegan27/VILLA/blob/HEAD/model/ot.py","status":"unverified","verification_level":0,"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, zhegan27/VILLA, 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":"d3f4c62a97861b9d","code_sha256_prefix":"d3f4c62a97861b9d","mcp_get_code":{"code_sha256":"d3f4c62a97861b9d"}},{"arxiv_id":"2004.06165","arxiv_id_is_arxiv":true,"paper":"/paper/oscar-object-semantics-aligned-pre-training","title":"Oscar: Object-Semantics Aligned Pre-training for Vision-Language Tasks","date":"2020-04-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"milvlg/rosita","path":"rosita/modeling/pretrain_tasks/rosita.py","file_url":"https://github.com/milvlg/rosita/blob/HEAD/rosita/modeling/pretrain_tasks/rosita.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":"412cdf6ed5178c2c","code_sha256_prefix":"412cdf6ed5178c2c","mcp_get_code":{"code_sha256":"412cdf6ed5178c2c"}}],"record_sha256":"1d723fc1e5897e6e789207585a21e30bf48ed553fe9f70c3d48c65e8ba62c4aa","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}