{"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-area","entry":"get_area","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":10,"n_papers_ran":10,"n_papers_ran_no_instrument_failure":9,"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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":7,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":6,"n_places":10,"n_places_pointer_only":5,"n_places_pointer_only_link_open":1,"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":1,"ran_fixture":0,"ran":6,"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":"2602.23663","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2602-23663","title":"Disentangled Mode-Specific Representations for Tensor Time Series via Contrastive Learning","date":null,"month_inferred_from_arxiv_id":"2026-02","title_source":"syntology","repo":"KoheiObata/MoST","path":"utils_tensor.py","file_url":"https://github.com/KoheiObata/MoST/blob/HEAD/utils_tensor.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, KoheiObata/MoST when it was checked","code_sha256":"b0e4a2bfe8a035f2","code_sha256_prefix":"b0e4a2bfe8a035f2","mcp_get_code":{"code_sha256":"b0e4a2bfe8a035f2"}},{"arxiv_id":"2411.01683","arxiv_id_is_arxiv":true,"paper":"/paper/road-waymo-action-awareness-at-scale-for","title":"ROAD-Waymo: Action Awareness at Scale for Autonomous Driving","date":"2024-11-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salmank255/ROAD_Waymo_Baseline","path":"kmean_anchors.py","file_url":"https://github.com/salmank255/ROAD_Waymo_Baseline/blob/HEAD/kmean_anchors.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, salmank255/ROAD_Waymo_Baseline (NOASSERTION)","code_sha256":"70645db2047d82ec","code_sha256_prefix":"70645db2047d82ec","mcp_get_code":{"code_sha256":"70645db2047d82ec"}},{"arxiv_id":"2311.13594","arxiv_id_is_arxiv":true,"paper":"/paper/2311-13594","title":"Labeling Neural Representations with Inverse Recognition","date":"2023-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lapalap/invert","path":"invert/evaluation.py","file_url":"https://github.com/lapalap/invert/blob/HEAD/invert/evaluation.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, lapalap/invert when it was checked","code_sha256":"31a38a99f4731966","code_sha256_prefix":"31a38a99f4731966","mcp_get_code":{"code_sha256":"31a38a99f4731966"}},{"arxiv_id":"2309.05956","arxiv_id_is_arxiv":true,"paper":"/paper/beyond-generation-harnessing-text-to-image","title":"Beyond Generation: Harnessing Text to Image Models for Object Detection and Segmentation","date":"2023-09-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gyhandy/text2image-for-detection","path":"cutpaste/foreground.py","file_url":"https://github.com/gyhandy/text2image-for-detection/blob/HEAD/cutpaste/foreground.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, gyhandy/text2image-for-detection when it was checked","code_sha256":"338cddb61947c898","code_sha256_prefix":"338cddb61947c898","mcp_get_code":{"code_sha256":"338cddb61947c898"}},{"arxiv_id":"2303.16406","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-video-moment-retrieval-and-step","title":"Hierarchical Video-Moment Retrieval and Step-Captioning","date":"2023-03-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"j-min/HiREST","path":"utils.py","file_url":"https://github.com/j-min/HiREST/blob/HEAD/utils.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":"db63032fdd04245b","code_sha256_prefix":"db63032fdd04245b","mcp_get_code":{"code_sha256":"db63032fdd04245b"}},{"arxiv_id":"2211.17244","arxiv_id_is_arxiv":true,"paper":"/paper/overcoming-the-convex-relaxation-barrier-for","title":"Tight Certification of Adversarially Trained Neural Networks via Nonconvex Low-Rank Semidefinite Relaxations","date":"2022-11-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"IBM/CROWN-Robustness-Certification","path":"quad_fit.py","file_url":"https://github.com/IBM/CROWN-Robustness-Certification/blob/HEAD/quad_fit.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":"90f4d0f321d7321a","code_sha256_prefix":"90f4d0f321d7321a","mcp_get_code":{"code_sha256":"90f4d0f321d7321a"}},{"arxiv_id":"2007.02419","arxiv_id_is_arxiv":true,"paper":"/paper/attention-based-joint-detection-of-object-and","title":"Attention-based Joint Detection of Object and Semantic Part","date":"2020-07-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevalmorabia97/Object-and-Semantic-Part-Detection-pyTorch","path":"utils.py","file_url":"https://github.com/kevalmorabia97/Object-and-Semantic-Part-Detection-pyTorch/blob/HEAD/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1be0d556ab75b233","code_sha256_prefix":"1be0d556ab75b233","mcp_get_code":{"code_sha256":"1be0d556ab75b233"}},{"arxiv_id":"2006.07976","arxiv_id_is_arxiv":true,"paper":"/paper/actor-context-actor-relation-network-for","title":"Actor-Context-Actor Relation Network for Spatio-Temporal Action Localization","date":"2020-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"salmank255/ROADSlowFast","path":"kmean_anchors.py","file_url":"https://github.com/salmank255/ROADSlowFast/blob/HEAD/kmean_anchors.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"Apache-2.0","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (Apache-2.0), but get_code serves the stored copy, first harvested from salmank255/ROAD_Waymo_Baseline, and GitHub could not classify the licence of that repository (NOASSERTION)","code_sha256":"70645db2047d82ec","code_sha256_prefix":"70645db2047d82ec","mcp_get_code":{"code_sha256":"70645db2047d82ec"}},{"arxiv_id":"1811.00866","arxiv_id_is_arxiv":true,"paper":"/paper/efficient-neural-network-robustness","title":"Efficient Neural Network Robustness Certification with General Activation Functions","date":"2018-11-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"huanzhang12/RecurJac-Jacobian-Bounds","path":"activation_functions_quad.py","file_url":"https://github.com/huanzhang12/RecurJac-Jacobian-Bounds/blob/HEAD/activation_functions_quad.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-2-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"90f4d0f321d7321a","code_sha256_prefix":"90f4d0f321d7321a","mcp_get_code":{"code_sha256":"90f4d0f321d7321a"}},{"arxiv_id":"aaai_25418","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_25418","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Shinetism/VStates","path":"utils/box_utils.py","file_url":"https://github.com/Shinetism/VStates/blob/HEAD/utils/box_utils.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":"b1fb0d9758eb4ad1","code_sha256_prefix":"b1fb0d9758eb4ad1","mcp_get_code":{"code_sha256":"b1fb0d9758eb4ad1"}}],"record_sha256":"2317c515c6fceb39da0287f380ffc619e0f033d31108788258076e453eb35940","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}