{"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/unravel-index","entry":"unravel_index","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":8,"n_papers_ran_no_instrument_failure":7,"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":7,"n_samples_constructed":0,"n_samples_ran_checked":6,"n_samples_instrument":1,"n_samples_unverified":1,"n_samples_fingerprinted":2,"n_places":9,"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":0,"ran_violates":2,"ran_draft_wrong":1,"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":"2410.22288","arxiv_id_is_arxiv":true,"paper":"/paper/motion-graph-unleashed-a-novel-approach-to","title":"Motion Graph Unleashed: A Novel Approach to Video Prediction","date":"2024-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Kay1794/Motion-Graph-Video-Prediction","path":"utils.py","file_url":"https://github.com/Kay1794/Motion-Graph-Video-Prediction/blob/HEAD/utils.py","status":"unverified","verification_level":0,"contract_check":null,"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, Kay1794/Motion-Graph-Video-Prediction when it was checked","code_sha256":"443a207ed4bd8d2a","code_sha256_prefix":"443a207ed4bd8d2a","mcp_get_code":{"code_sha256":"443a207ed4bd8d2a"}},{"arxiv_id":"2408.07680","arxiv_id_is_arxiv":true,"paper":"/paper/a-spitting-image-modular-superpixel","title":"A Spitting Image: Modular Superpixel Tokenization in Vision Transformers","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"dsb-ifi/spit","path":"spit/utils/indexing.py","file_url":"https://github.com/dsb-ifi/spit/blob/HEAD/spit/utils/indexing.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"6b43e964eb98fb3e","code_sha256_prefix":"6b43e964eb98fb3e","mcp_get_code":{"code_sha256":"6b43e964eb98fb3e"}},{"arxiv_id":"2403.01412","arxiv_id_is_arxiv":true,"paper":"/paper/lum-vit-learnable-under-sampling-mask-vision","title":"LUM-ViT: Learnable Under-sampling Mask Vision Transformer for Bandwidth Limited Optical Signal Acquisition","date":"2024-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"maxllf/lum-vit","path":"LUM-ViT.py","file_url":"https://github.com/maxllf/lum-vit/blob/HEAD/LUM-ViT.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, maxllf/lum-vit when it was checked","code_sha256":"ef2325b4dcee1c65","code_sha256_prefix":"ef2325b4dcee1c65","mcp_get_code":{"code_sha256":"ef2325b4dcee1c65"}},{"arxiv_id":"2309.02691","arxiv_id_is_arxiv":true,"paper":"/paper/a-joint-study-of-phrase-grounding-and-task","title":"A Joint Study of Phrase Grounding and Task Performance in Vision and Language Models","date":"2023-09-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lil-lab/phrase_grounding","path":"src/evals/db_utils.py","file_url":"https://github.com/lil-lab/phrase_grounding/blob/HEAD/src/evals/db_utils.py","status":"ran","verification_level":1,"contract_check":null,"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, lil-lab/phrase_grounding when it was checked","code_sha256":"df66d21a558663a6","code_sha256_prefix":"df66d21a558663a6","mcp_get_code":{"code_sha256":"df66d21a558663a6"}},{"arxiv_id":"2307.08240","arxiv_id_is_arxiv":true,"paper":"/paper/mist-cf-chemical-formula-inference-from","title":"MIST-CF: Chemical formula inference from tandem mass spectra","date":"2023-07-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"samgoldman97/mist-cf","path":"src/mist_cf/common/misc_utils.py","file_url":"https://github.com/samgoldman97/mist-cf/blob/HEAD/src/mist_cf/common/misc_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":"3338dabc50f8f122","code_sha256_prefix":"3338dabc50f8f122","mcp_get_code":{"code_sha256":"3338dabc50f8f122"}},{"arxiv_id":"2302.06548","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-noise-filtering-with-dynamic-sparse","title":"Automatic Noise Filtering with Dynamic Sparse Training in Deep Reinforcement Learning","date":"2023-02-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"bramgrooten/automatic-noise-filtering","path":"utils/target_network.py","file_url":"https://github.com/bramgrooten/automatic-noise-filtering/blob/HEAD/utils/target_network.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"well_formed","behaviour_fingerprint":true,"licence":"MIT","inline_ok":false,"inline_ok_link":true,"withheld_clause":"this paper's link allows the body inline (MIT), but get_code serves the stored copy, first harvested from maxllf/lum-vit, and GitHub detected no licence in that repository when it was checked","code_sha256":"ef2325b4dcee1c65","code_sha256_prefix":"ef2325b4dcee1c65","mcp_get_code":{"code_sha256":"ef2325b4dcee1c65"}},{"arxiv_id":"2106.07445","arxiv_id_is_arxiv":true,"paper":"/paper/popskipjump-decision-based-attack-for","title":"PopSkipJump: Decision-Based Attack for Probabilistic Classifiers","date":"2021-06-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cjsg/PopSkipJump","path":"popskip.py","file_url":"https://github.com/cjsg/PopSkipJump/blob/HEAD/popskip.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, cjsg/PopSkipJump when it was checked","code_sha256":"9b2a276601e99a91","code_sha256_prefix":"9b2a276601e99a91","mcp_get_code":{"code_sha256":"9b2a276601e99a91"}},{"arxiv_id":"1905.03711","arxiv_id_is_arxiv":true,"paper":"/paper/190503711","title":"Processing Megapixel Images with Deep Attention-Sampling Models","date":"2019-05-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sara-nl/attention-sampling-pytorch","path":"ats/core/sampling.py","file_url":"https://github.com/sara-nl/attention-sampling-pytorch/blob/HEAD/ats/core/sampling.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":"76877081e7d2efbc","code_sha256_prefix":"76877081e7d2efbc","mcp_get_code":{"code_sha256":"76877081e7d2efbc"}},{"arxiv_id":"1810.03642","arxiv_id_is_arxiv":true,"paper":"/paper/fast-context-adaptation-via-meta-learning","title":"Fast Context Adaptation via Meta-Learning","date":"2018-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lmzintgraf/cavia","path":"regression/tasks_celebA.py","file_url":"https://github.com/lmzintgraf/cavia/blob/HEAD/regression/tasks_celebA.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":"258b1b7ff84d66c0","code_sha256_prefix":"258b1b7ff84d66c0","mcp_get_code":{"code_sha256":"258b1b7ff84d66c0"}}],"record_sha256":"6c646fce693ab8c8e509e0e125eb093a7bf770c7891f4168672408e559846cbe","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}