{"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/make-graph","entry":"make_graph","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":9,"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":10,"n_samples_ran":6,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":1,"n_samples_unverified":4,"n_samples_fingerprinted":1,"n_places":11,"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":0,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":5,"unverified":4},"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":"2210.11287","arxiv_id_is_arxiv":true,"paper":"/paper/mocoda-model-based-counterfactual-data","title":"MoCoDA: Model-based Counterfactual Data Augmentation","date":"2022-10-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"spitis/mocoda","path":"augment_offline.py","file_url":"https://github.com/spitis/mocoda/blob/HEAD/augment_offline.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, spitis/mocoda when it was checked","code_sha256":"215b2276ca908379","code_sha256_prefix":"215b2276ca908379","mcp_get_code":{"code_sha256":"215b2276ca908379"}},{"arxiv_id":"2104.11207","arxiv_id_is_arxiv":true,"paper":"/paper/fully-convolutional-line-parsing","title":"Fully Convolutional Line Parsing","date":"2021-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PINTO0309/PINTO_model_zoo","path":"082_MediaPipe_Meet_Segmentation/01_segm_lite_v509_tflite_to_pb_saved_model.py","file_url":"https://github.com/PINTO0309/PINTO_model_zoo/blob/HEAD/082_MediaPipe_Meet_Segmentation/01_segm_lite_v509_tflite_to_pb_saved_model.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":"b9b75736ab77054a","code_sha256_prefix":"b9b75736ab77054a","mcp_get_code":{"code_sha256":"b9b75736ab77054a"}},{"arxiv_id":"2104.11207","arxiv_id_is_arxiv":true,"paper":"/paper/fully-convolutional-line-parsing","title":"Fully Convolutional Line Parsing","date":"2021-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PINTO0309/PINTO_model_zoo","path":"082_MediaPipe_Meet_Segmentation/02_segm_full_v679_tflite_to_pb_saved_model.py","file_url":"https://github.com/PINTO0309/PINTO_model_zoo/blob/HEAD/082_MediaPipe_Meet_Segmentation/02_segm_full_v679_tflite_to_pb_saved_model.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":"370b7fb5b138c7d6","code_sha256_prefix":"370b7fb5b138c7d6","mcp_get_code":{"code_sha256":"370b7fb5b138c7d6"}},{"arxiv_id":"2104.11207","arxiv_id_is_arxiv":true,"paper":"/paper/fully-convolutional-line-parsing","title":"Fully Convolutional Line Parsing","date":"2021-04-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"PINTO0309/PINTO_model_zoo","path":"082_MediaPipe_Meet_Segmentation/03_segm_lite_v681_tflite_to_pb_saved_model.py","file_url":"https://github.com/PINTO0309/PINTO_model_zoo/blob/HEAD/082_MediaPipe_Meet_Segmentation/03_segm_lite_v681_tflite_to_pb_saved_model.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":"2b31112f5b169d48","code_sha256_prefix":"2b31112f5b169d48","mcp_get_code":{"code_sha256":"2b31112f5b169d48"}},{"arxiv_id":"2007.13467","arxiv_id_is_arxiv":true,"paper":"/paper/identity-guided-human-semantic-parsing-for","title":"Identity-Guided Human Semantic Parsing for Person Re-Identification","date":"2020-07-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CASIA-IVA-Lab/ISP-reID","path":"engine/clustering.py","file_url":"https://github.com/CASIA-IVA-Lab/ISP-reID/blob/HEAD/engine/clustering.py","status":"unverified","verification_level":0,"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":"c1ac4ee52106027c","code_sha256_prefix":"c1ac4ee52106027c","mcp_get_code":{"code_sha256":"c1ac4ee52106027c"}},{"arxiv_id":"2006.10503","arxiv_id_is_arxiv":true,"paper":"/paper/se-3-transformers-3d-roto-translation","title":"SE(3)-Transformers: 3D Roto-Translation Equivariant Attention Networks","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosettacommons/rosettafold","path":"network/InitStrGenerator.py","file_url":"https://github.com/rosettacommons/rosettafold/blob/HEAD/network/InitStrGenerator.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":"6239eb2a3d6fa13e","code_sha256_prefix":"6239eb2a3d6fa13e","mcp_get_code":{"code_sha256":"6239eb2a3d6fa13e"}},{"arxiv_id":"2005.01831","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-explainable-ai-which-algorithmic","title":"Evaluating Explainable AI: Which Algorithmic Explanations Help Users Predict Model Behavior?","date":"2020-05-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peterbhase/InterpretableNLP-ACL2020","path":"tabular/anchor/make_graphs_and_table.py","file_url":"https://github.com/peterbhase/InterpretableNLP-ACL2020/blob/HEAD/tabular/anchor/make_graphs_and_table.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":"60da6efa17ee6dc2","code_sha256_prefix":"60da6efa17ee6dc2","mcp_get_code":{"code_sha256":"60da6efa17ee6dc2"}},{"arxiv_id":"2003.11778","arxiv_id_is_arxiv":true,"paper":"/paper/too-many-cooks-coordinating-multi-agent","title":"Too many cooks: Bayesian inference for coordinating multi-agent collaboration","date":"2020-03-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rosewang2008/gym-cooking","path":"gym_cooking/recipe_planner/utils.py","file_url":"https://github.com/rosewang2008/gym-cooking/blob/HEAD/gym_cooking/recipe_planner/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":"f799744e32faa64b","code_sha256_prefix":"f799744e32faa64b","mcp_get_code":{"code_sha256":"f799744e32faa64b"}},{"arxiv_id":"1905.09550","arxiv_id_is_arxiv":true,"paper":"/paper/revisiting-graph-neural-networks-all-we-have","title":"Revisiting Graph Neural Networks: All We Have is Low-Pass Filters","date":"2019-05-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gear/gfnn","path":"synthetic_data.py","file_url":"https://github.com/gear/gfnn/blob/HEAD/synthetic_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":"73b528f4485a27d4","code_sha256_prefix":"73b528f4485a27d4","mcp_get_code":{"code_sha256":"73b528f4485a27d4"}},{"arxiv_id":"1902.09212","arxiv_id_is_arxiv":true,"paper":"/paper/deep-high-resolution-representation-learning","title":"Deep High-Resolution Representation Learning for Human Pose Estimation","date":"2019-02-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Vill-Lab/2022-TIP-HCGA","path":"engine/clustering.py","file_url":"https://github.com/Vill-Lab/2022-TIP-HCGA/blob/HEAD/engine/clustering.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":"c1ac4ee52106027c","code_sha256_prefix":"c1ac4ee52106027c","mcp_get_code":{"code_sha256":"c1ac4ee52106027c"}},{"arxiv_id":"1711.05363","arxiv_id_is_arxiv":true,"paper":"/paper/kernel-conditional-exponential-family","title":"Kernel Conditional Exponential Family","date":"2017-11-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MichaelArbel/KCEF","path":"KCEF/tools.py","file_url":"https://github.com/MichaelArbel/KCEF/blob/HEAD/KCEF/tools.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"204340655ddfd3bf","code_sha256_prefix":"204340655ddfd3bf","mcp_get_code":{"code_sha256":"204340655ddfd3bf"}}],"record_sha256":"fde94d7c0f9c281ab96f7ae6c72ffb4f856b24dce81d9911f0b3687d4ac904df","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}