{"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-mapping","entry":"get_mapping","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":5,"n_papers_ran":5,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":2,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":2,"n_samples_unverified":0,"n_samples_fingerprinted":2,"n_places":5,"n_places_pointer_only":2,"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":2,"ran_fixture":0,"ran":2,"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":"2406.05113","arxiv_id_is_arxiv":true,"paper":"/paper/llavaguard-vlm-based-safeguards-for-vision","title":"LlavaGuard: An Open VLM-based Framework for Safeguarding Vision Datasets and Models","date":"2024-06-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ml-research/llavaguard","path":"llavaguard/taxonomy/assessment.py","file_url":"https://github.com/ml-research/llavaguard/blob/HEAD/llavaguard/taxonomy/assessment.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3e2b58c12e63bea5","code_sha256_prefix":"3e2b58c12e63bea5","mcp_get_code":{"code_sha256":"3e2b58c12e63bea5"}},{"arxiv_id":"2312.06330","arxiv_id_is_arxiv":true,"paper":"/paper/navigating-open-set-scenarios-for-skeleton","title":"Navigating Open Set Scenarios for Skeleton-based Action Recognition","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kpeng9510/os-sar","path":"feeders/feeder_ntu.py","file_url":"https://github.com/kpeng9510/os-sar/blob/HEAD/feeders/feeder_ntu.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NOASSERTION","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub could not classify the licence of this paper's repository, kpeng9510/os-sar (NOASSERTION)","code_sha256":"af67c70987fb3f26","code_sha256_prefix":"af67c70987fb3f26","mcp_get_code":{"code_sha256":"af67c70987fb3f26"}},{"arxiv_id":"2212.10097","arxiv_id_is_arxiv":true,"paper":"/paper/toward-a-unified-framework-for-unsupervised","title":"Optimization Techniques for Unsupervised Complex Table Reasoning via Self-Training Framework","date":"2022-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leezythu/uctr-st","path":"TAT-QA/generate_pseudo.py","file_url":"https://github.com/leezythu/uctr-st/blob/HEAD/TAT-QA/generate_pseudo.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":"defe43aaba4c6447","code_sha256_prefix":"defe43aaba4c6447","mcp_get_code":{"code_sha256":"defe43aaba4c6447"}},{"arxiv_id":"2102.08633","arxiv_id_is_arxiv":true,"paper":"/paper/open-retrieval-conversational-machine-reading","title":"Open-Retrieval Conversational Machine Reading","date":"2021-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevinsrr/unicmr","path":"discourse_seg/open_sharc_discourse_segmentation.py","file_url":"https://github.com/kevinsrr/unicmr/blob/HEAD/discourse_seg/open_sharc_discourse_segmentation.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, kevinsrr/unicmr when it was checked","code_sha256":"2ab4f2c4b3d885cd","code_sha256_prefix":"2ab4f2c4b3d885cd","mcp_get_code":{"code_sha256":"2ab4f2c4b3d885cd"}},{"arxiv_id":"1609.02907","arxiv_id_is_arxiv":true,"paper":"/paper/semi-supervised-classification-with-graph","title":"Semi-Supervised Classification with Graph Convolutional Networks","date":"2016-09-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhiqiang00/Hon-GCN","path":"pygcn/utils.py","file_url":"https://github.com/zhiqiang00/Hon-GCN/blob/HEAD/pygcn/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":"c261fb3b4b4f0f06","code_sha256_prefix":"c261fb3b4b4f0f06","mcp_get_code":{"code_sha256":"c261fb3b4b4f0f06"}}],"record_sha256":"d6b522a1e89327d013acba89f552be2cbe03d179fd27c978f65a5835f3a9dc2c","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}