{"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/load-table","entry":"load_table","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":4,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":1,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":2,"n_samples_fingerprinted":0,"n_places":6,"n_places_pointer_only":1,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":2,"unverified":2},"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":"2506.18434","arxiv_id_is_arxiv":true,"paper":null,"title":"arXiv:2506.18434","date":null,"month_inferred_from_arxiv_id":"2025-06","title_source":null,"repo":"fruffini/PEFT_Prognosis","path":"src/utils/save_load.py","file_url":"https://github.com/fruffini/PEFT_Prognosis/blob/HEAD/src/utils/save_load.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, fruffini/PEFT_Prognosis when it was checked","code_sha256":"8985a5ffb62669ec","code_sha256_prefix":"8985a5ffb62669ec","mcp_get_code":{"code_sha256":"8985a5ffb62669ec"}},{"arxiv_id":"2501.05644","arxiv_id_is_arxiv":true,"paper":"/paper/interpretable-enzyme-function-prediction-via","title":"Interpretable Enzyme Function Prediction via Residue-Level Detection","date":"2025-01-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yangzhao1230/protdetr","path":"predict_multi.py","file_url":"https://github.com/yangzhao1230/protdetr/blob/HEAD/predict_multi.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b265994c34bba886","code_sha256_prefix":"b265994c34bba886","mcp_get_code":{"code_sha256":"b265994c34bba886"}},{"arxiv_id":"2402.01685","arxiv_id_is_arxiv":true,"paper":"/paper/smutf-schema-matching-using-generative-tags","title":"SMUTF: Schema Matching Using Generative Tags and Hybrid Features","date":"2024-01-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fireindark707/python-schema-matching","path":"self_features.py","file_url":"https://github.com/fireindark707/python-schema-matching/blob/HEAD/self_features.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"411731e041b8ad68","code_sha256_prefix":"411731e041b8ad68","mcp_get_code":{"code_sha256":"411731e041b8ad68"}},{"arxiv_id":"1912.11019","arxiv_id_is_arxiv":true,"paper":"/paper/orbital-stability-of-circumstellar-planets-in","title":"Orbital Stability of Circumstellar Planets in Binary Systems","date":null,"month_inferred_from_arxiv_id":"2019-12","title_source":"archive","repo":"saturnaxis/ThreeBody_Stability","path":"src/threebody_stability/data.py","file_url":"https://github.com/saturnaxis/ThreeBody_Stability/blob/HEAD/src/threebody_stability/data.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":"a4865c749c397ded","code_sha256_prefix":"a4865c749c397ded","mcp_get_code":{"code_sha256":"a4865c749c397ded"}},{"arxiv_id":"1906.06298","arxiv_id_is_arxiv":true,"paper":"/paper/augmenting-neural-networks-with-first-order","title":"Augmenting Neural Networks with First-order Logic","date":"2019-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"utahnlp/layer_augmentation","path":"constraint_preprocess.py","file_url":"https://github.com/utahnlp/layer_augmentation/blob/HEAD/constraint_preprocess.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":"a23007de9c975680","code_sha256_prefix":"a23007de9c975680","mcp_get_code":{"code_sha256":"a23007de9c975680"}},{"arxiv_id":"1605.04460","arxiv_id_is_arxiv":true,"paper":"/paper/detecting-damped-lyman-absorbers-with","title":"Detecting Damped Lyman-$α$ Absorbers with Gaussian Processes","date":null,"month_inferred_from_arxiv_id":"2016-05","title_source":"archive","repo":"rmgarnett/gp_dla_detection","path":"CDDF_analysis/make_tables.py","file_url":"https://github.com/rmgarnett/gp_dla_detection/blob/HEAD/CDDF_analysis/make_tables.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"64806c35f9a763ad","code_sha256_prefix":"64806c35f9a763ad","mcp_get_code":{"code_sha256":"64806c35f9a763ad"}}],"record_sha256":"28ee397fb61085b0b85ba269ae5dc95a7e17221faa5697db580cc9800a7c3c87","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}