{"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-sparse-csr","entry":"load_sparse_csr","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":7,"n_papers_ran":6,"n_papers_ran_no_instrument_failure":5,"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":5,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":7,"n_places_pointer_only":0,"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":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"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":"2505.22993","arxiv_id_is_arxiv":true,"paper":"/paper/verify-in-the-graph-entity-disambiguation","title":"Verify-in-the-Graph: Entity Disambiguation Enhancement for Complex Claim Verification with Interactive Graph Representation","date":"2025-05-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"teacherpeterpan/ProgramFC","path":"datasets/FEVEROUS/utils.py","file_url":"https://github.com/teacherpeterpan/ProgramFC/blob/HEAD/datasets/FEVEROUS/utils.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":"71cbb05f2913e671","code_sha256_prefix":"71cbb05f2913e671","mcp_get_code":{"code_sha256":"71cbb05f2913e671"}},{"arxiv_id":"2305.12744","arxiv_id_is_arxiv":true,"paper":"/paper/fact-checking-complex-claims-with-program","title":"Fact-Checking Complex Claims with Program-Guided Reasoning","date":"2023-05-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mbzuai-nlp/programfc","path":"datasets/FEVEROUS/utils.py","file_url":"https://github.com/mbzuai-nlp/programfc/blob/HEAD/datasets/FEVEROUS/utils.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":"71cbb05f2913e671","code_sha256_prefix":"71cbb05f2913e671","mcp_get_code":{"code_sha256":"71cbb05f2913e671"}},{"arxiv_id":"2106.05707","arxiv_id_is_arxiv":true,"paper":"/paper/feverous-fact-extraction-and-verification","title":"FEVEROUS: Fact Extraction and VERification Over Unstructured and Structured information","date":"2021-06-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Raldir/FEVEROUS","path":"src/feverous/database/utils.py","file_url":"https://github.com/Raldir/FEVEROUS/blob/HEAD/src/feverous/database/utils.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":"71cbb05f2913e671","code_sha256_prefix":"71cbb05f2913e671","mcp_get_code":{"code_sha256":"71cbb05f2913e671"}},{"arxiv_id":"1901.09993","arxiv_id_is_arxiv":true,"paper":"/paper/generalized-label-propagation-methods-for","title":"Label Efficient Semi-Supervised Learning via Graph Filtering","date":"2019-01-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"liqimai/Efficient-SSL","path":"gcn/utils.py","file_url":"https://github.com/liqimai/Efficient-SSL/blob/HEAD/gcn/utils.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":"b85d40e6f38b7758","code_sha256_prefix":"b85d40e6f38b7758","mcp_get_code":{"code_sha256":"b85d40e6f38b7758"}},{"arxiv_id":"1706.09739","arxiv_id_is_arxiv":true,"paper":"/paper/a-deep-multimodal-approach-for-cold-start","title":"A Deep Multimodal Approach for Cold-start Music Recommendation","date":"2017-06-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sergiooramas/tartarus","path":"src/predict.py","file_url":"https://github.com/sergiooramas/tartarus/blob/HEAD/src/predict.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"92abb211babb78ac","code_sha256_prefix":"92abb211babb78ac","mcp_get_code":{"code_sha256":"92abb211babb78ac"}},{"arxiv_id":"1703.06103","arxiv_id_is_arxiv":true,"paper":"/paper/modeling-relational-data-with-graph","title":"Modeling Relational Data with Graph Convolutional Networks","date":"2017-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tkipf/relational-gcn","path":"rgcn/data_utils.py","file_url":"https://github.com/tkipf/relational-gcn/blob/HEAD/rgcn/data_utils.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":"02de651d9efcfd65","code_sha256_prefix":"02de651d9efcfd65","mcp_get_code":{"code_sha256":"02de651d9efcfd65"}},{"arxiv_id":"2021.acl-long.164","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2021.acl-long.164","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"thunlp/OpenQA","path":"src/retriever/utils.py","file_url":"https://github.com/thunlp/OpenQA/blob/HEAD/src/retriever/utils.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":"0646052a59a8246e","code_sha256_prefix":"0646052a59a8246e","mcp_get_code":{"code_sha256":"0646052a59a8246e"}}],"record_sha256":"1de21862721fbbd8e3204ee86e5efe15e4daeb8a1eb6a4003d88543888e3e27e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}