{"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/normalize-map","entry":"normalize_map","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":5,"n_papers_ran_no_instrument_failure":4,"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":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":5,"n_places":6,"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":3,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":1,"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":"2601.20208","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2601-20208","title":"TRACER: Texture-Robust Affordance Chain-of-Thought for Deformable-Object Refinement","date":null,"month_inferred_from_arxiv_id":"2026-01","title_source":"syntology","repo":"Dikay1/TRACER","path":"utils/util.py","file_url":"https://github.com/Dikay1/TRACER/blob/HEAD/utils/util.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"f21e0d8b029b58b1","code_sha256_prefix":"f21e0d8b029b58b1","mcp_get_code":{"code_sha256":"f21e0d8b029b58b1"}},{"arxiv_id":"2306.11180","arxiv_id_is_arxiv":true,"paper":"/paper/hyperbolic-active-learning-for-semantic","title":"Hyperbolic Active Learning for Semantic Segmentation under Domain Shift","date":"2023-06-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"paolomandica/HALO","path":"core/active/build.py","file_url":"https://github.com/paolomandica/HALO/blob/HEAD/core/active/build.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3ae23f8e61562cc3","code_sha256_prefix":"3ae23f8e61562cc3","mcp_get_code":{"code_sha256":"3ae23f8e61562cc3"}},{"arxiv_id":"2208.13196","arxiv_id_is_arxiv":true,"paper":"/paper/grounded-affordance-from-exocentric-view","title":"Grounded Affordance from Exocentric View","date":"2022-08-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhc1224/cross-view-affordance-grounding","path":"code/extension/viz.py","file_url":"https://github.com/lhc1224/cross-view-affordance-grounding/blob/HEAD/code/extension/viz.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":"9916b3f90d58fcaf","code_sha256_prefix":"9916b3f90d58fcaf","mcp_get_code":{"code_sha256":"9916b3f90d58fcaf"}},{"arxiv_id":"2202.00449","arxiv_id_is_arxiv":true,"paper":"/paper/evaluating-feature-attribution-an-information","title":"A Consistent and Efficient Evaluation Strategy for Attribution Methods","date":"2022-02-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"tleemann/road_evaluation","path":"road/road.py","file_url":"https://github.com/tleemann/road_evaluation/blob/HEAD/road/road.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b0613e306198627a","code_sha256_prefix":"b0613e306198627a","mcp_get_code":{"code_sha256":"b0613e306198627a"}},{"arxiv_id":"2003.05477","arxiv_id_is_arxiv":true,"paper":"/paper/unified-image-and-video-saliency-modeling","title":"Unified Image and Video Saliency Modeling","date":"2020-03-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lcc157/code","path":"unisal/salience_metrics.py","file_url":"https://github.com/lcc157/code/blob/HEAD/unisal/salience_metrics.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"2859db1f0821894e","code_sha256_prefix":"2859db1f0821894e","mcp_get_code":{"code_sha256":"2859db1f0821894e"}},{"arxiv_id":"2003.04942","arxiv_id_is_arxiv":true,"paper":"/paper/tidying-deep-saliency-prediction","title":"Tidying Deep Saliency Prediction Architectures","date":"2020-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samyak0210/saliency","path":"SimpleNet/loss.py","file_url":"https://github.com/samyak0210/saliency/blob/HEAD/SimpleNet/loss.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4b8b9db7d61bd9c","code_sha256_prefix":"b4b8b9db7d61bd9c","mcp_get_code":{"code_sha256":"b4b8b9db7d61bd9c"}}],"record_sha256":"1f7fe3ce6a30dde07682779c4f87b93e7d882d76fbc0af6b206987143083b15a","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}