{"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/get-int","entry":"get_int","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":6,"n_papers_ran_no_instrument_failure":3,"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":3,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":1,"n_places":6,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":1,"unverified":0},"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":"2505.19932","arxiv_id_is_arxiv":true,"paper":"/paper/logic-gate-neural-networks-are-good-for","title":"Logic Gate Neural Networks are Good for Verification","date":"2025-05-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HyberionBrew/difflogic_verify","path":"datasets_neus/datasets_neus/mnist_dataset.py","file_url":"https://github.com/HyberionBrew/difflogic_verify/blob/HEAD/datasets_neus/datasets_neus/mnist_dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9472ecfd2d5ea169","code_sha256_prefix":"9472ecfd2d5ea169","mcp_get_code":{"code_sha256":"9472ecfd2d5ea169"}},{"arxiv_id":"2412.06097","arxiv_id_is_arxiv":true,"paper":"/paper/order-theory-in-the-context-of-machine","title":"Order Theory in the Context of Machine Learning","date":"2024-12-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Abhi-H/CNN-with-Fashion-MNIST-dataset","path":"FashionMNISTwithCNN.py","file_url":"https://github.com/Abhi-H/CNN-with-Fashion-MNIST-dataset/blob/HEAD/FashionMNISTwithCNN.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from Newbeeer/L_DMI, and GitHub detected no licence in that repository when it was checked","code_sha256":"dc221e9b2bf38877","code_sha256_prefix":"dc221e9b2bf38877","mcp_get_code":{"code_sha256":"dc221e9b2bf38877"}},{"arxiv_id":"2411.04732","arxiv_id_is_arxiv":true,"paper":"/paper/convolutional-differentiable-logic-gate","title":"Convolutional Differentiable Logic Gate Networks","date":"2024-11-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Felix-Petersen/difflogic","path":"experiments/mnist_dataset.py","file_url":"https://github.com/Felix-Petersen/difflogic/blob/HEAD/experiments/mnist_dataset.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9472ecfd2d5ea169","code_sha256_prefix":"9472ecfd2d5ea169","mcp_get_code":{"code_sha256":"9472ecfd2d5ea169"}},{"arxiv_id":"2310.03710","arxiv_id_is_arxiv":true,"paper":"/paper/agent-instructs-large-language-models-to-be","title":"Agent Instructs Large Language Models to be General Zero-Shot Reasoners","date":"2023-10-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"wang-research-lab/agentinstruct","path":"src/agentinstruct/reasoning/serve/custom_handler/llama-2-13b-chat-handler.py","file_url":"https://github.com/wang-research-lab/agentinstruct/blob/HEAD/src/agentinstruct/reasoning/serve/custom_handler/llama-2-13b-chat-handler.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"283c64914efa0e6f","code_sha256_prefix":"283c64914efa0e6f","mcp_get_code":{"code_sha256":"283c64914efa0e6f"}},{"arxiv_id":"2006.04662","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-importance-weighting-for-deep","title":"Rethinking Importance Weighting for Deep Learning under Distribution Shift","date":"2020-06-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"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":"dc221e9b2bf38877","code_sha256_prefix":"dc221e9b2bf38877","mcp_get_code":{"code_sha256":"dc221e9b2bf38877"}},{"arxiv_id":"1909.03388","arxiv_id_is_arxiv":true,"paper":"/paper/l_dmi-an-information-theoretic-noise-robust","title":"L_DMI: An Information-theoretic Noise-robust Loss Function","date":"2019-09-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Newbeeer/L_DMI","path":"fashion/fashion.py","file_url":"https://github.com/Newbeeer/L_DMI/blob/HEAD/fashion/fashion.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, Newbeeer/L_DMI when it was checked","code_sha256":"dc221e9b2bf38877","code_sha256_prefix":"dc221e9b2bf38877","mcp_get_code":{"code_sha256":"dc221e9b2bf38877"}}],"record_sha256":"d7df904322ef0b256f73aa47749b7affea83dd4c8a3d35cdd25cb9820c2ba804","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}