{"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-info","entry":"load_info","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":4,"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":8,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":1,"n_samples_fingerprinted":0,"n_places":8,"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":0,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":4,"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":"2308.09517","arxiv_id_is_arxiv":true,"paper":"/paper/transitivity-preserving-graph-representation","title":"Transitivity-Preserving Graph Representation Learning for Bridging Local Connectivity and Role-based Similarity","date":"2023-08-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"nslab-cuk/community-aware-graph-transformer","path":"exp.py","file_url":"https://github.com/nslab-cuk/community-aware-graph-transformer/blob/HEAD/exp.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":"5514e4d11d611865","code_sha256_prefix":"5514e4d11d611865","mcp_get_code":{"code_sha256":"5514e4d11d611865"}},{"arxiv_id":"2303.08231","arxiv_id_is_arxiv":true,"paper":"/paper/rotation-invariant-transformer-for-point","title":"Rotation-Invariant Transformer for Point Cloud Matching","date":"2023-03-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"haoyu94/roitr","path":"dataset/common.py","file_url":"https://github.com/haoyu94/roitr/blob/HEAD/dataset/common.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":"5b17d30ad5d8ca5d","code_sha256_prefix":"5b17d30ad5d8ca5d","mcp_get_code":{"code_sha256":"5b17d30ad5d8ca5d"}},{"arxiv_id":"2111.13738","arxiv_id_is_arxiv":true,"paper":"/paper/the-implicit-values-of-a-good-hand-shake","title":"The Implicit Values of A Good Hand Shake: Handheld Multi-Frame Neural Depth Refinement","date":"2021-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"princeton-computational-imaging/hndr","path":"!DepthBundleApp/ConvertBinaries.py","file_url":"https://github.com/princeton-computational-imaging/hndr/blob/HEAD/%21DepthBundleApp/ConvertBinaries.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":"ea6f25b9589127c3","code_sha256_prefix":"ea6f25b9589127c3","mcp_get_code":{"code_sha256":"ea6f25b9589127c3"}},{"arxiv_id":"2106.06613","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-formalism-method-and-open-issues-for","title":"A New Formalism, Method and Open Issues for Zero-Shot Coordination","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johannestreutlein/op-tie-breaking","path":"src/op_with_tie_breaking.py","file_url":"https://github.com/johannestreutlein/op-tie-breaking/blob/HEAD/src/op_with_tie_breaking.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, johannestreutlein/op-tie-breaking when it was checked","code_sha256":"78e0537cdd616896","code_sha256_prefix":"78e0537cdd616896","mcp_get_code":{"code_sha256":"78e0537cdd616896"}},{"arxiv_id":"2106.06613","arxiv_id_is_arxiv":true,"paper":"/paper/a-new-formalism-method-and-open-issues-for","title":"A New Formalism, Method and Open Issues for Zero-Shot Coordination","date":"2021-06-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"johannestreutlein/op-tie-breaking","path":"src/analysis_of_equiv_classes.py","file_url":"https://github.com/johannestreutlein/op-tie-breaking/blob/HEAD/src/analysis_of_equiv_classes.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, johannestreutlein/op-tie-breaking when it was checked","code_sha256":"060155439f48820c","code_sha256_prefix":"060155439f48820c","mcp_get_code":{"code_sha256":"060155439f48820c"}},{"arxiv_id":"2003.12962","arxiv_id_is_arxiv":true,"paper":"/paper/gps-net-graph-property-sensing-network-for","title":"GPS-Net: Graph Property Sensing Network for Scene Graph Generation","date":"2020-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"taksau/GPS-Net","path":"lib/dataloaders/visual_genome.py","file_url":"https://github.com/taksau/GPS-Net/blob/HEAD/lib/dataloaders/visual_genome.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":"da2ae147332ee568","code_sha256_prefix":"da2ae147332ee568","mcp_get_code":{"code_sha256":"da2ae147332ee568"}},{"arxiv_id":"1905.00641","arxiv_id_is_arxiv":true,"paper":"/paper/190500641","title":"RetinaFace: Single-stage Dense Face Localisation in the Wild","date":"2019-05-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"peteryuX/retinaface-tf2","path":"test_widerface.py","file_url":"https://github.com/peteryuX/retinaface-tf2/blob/HEAD/test_widerface.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":"f0888a2af73aa016","code_sha256_prefix":"f0888a2af73aa016","mcp_get_code":{"code_sha256":"f0888a2af73aa016"}},{"arxiv_id":"1810.03065","arxiv_id_is_arxiv":true,"paper":"/paper/deep-model-based-6d-pose-refinement-in-rgb","title":"Deep Model-Based 6D Pose Refinement in RGB","date":"2018-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"fabi92/eccv18-rgb_pose_refinement","path":"utils/sixd.py","file_url":"https://github.com/fabi92/eccv18-rgb_pose_refinement/blob/HEAD/utils/sixd.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":"ad670f8eff1c8d2d","code_sha256_prefix":"ad670f8eff1c8d2d","mcp_get_code":{"code_sha256":"ad670f8eff1c8d2d"}}],"record_sha256":"92dbeb239981c3361a61813f57a6a16a62b3a6ac83fc60600e4a124af9743580","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}