{"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/loader","entry":"loader","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":3,"n_papers_ran_no_instrument_failure":3,"n_papers_ran_instrument_only":0,"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":9,"n_samples_ran":3,"n_samples_constructed":0,"n_samples_ran_checked":3,"n_samples_instrument":0,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":9,"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":0,"ran_fixture":0,"ran":3,"unverified":6},"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":"2404.07546","arxiv_id_is_arxiv":true,"paper":"/paper/decomposing-label-space-format-and","title":"Does In-Context Learning Really Learn? Rethinking How Large Language Models Respond and Solve Tasks via In-Context Learning","date":"2024-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ruyue0001/decompose_icl_improvement","path":"generate_icl_retrieval.py","file_url":"https://github.com/ruyue0001/decompose_icl_improvement/blob/HEAD/generate_icl_retrieval.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, ruyue0001/decompose_icl_improvement when it was checked","code_sha256":"c951a5a9d203c637","code_sha256_prefix":"c951a5a9d203c637","mcp_get_code":{"code_sha256":"c951a5a9d203c637"}},{"arxiv_id":"2211.12232","arxiv_id_is_arxiv":true,"paper":"/paper/aero-audio-super-resolution-in-the-spectral","title":"AERO: Audio Super Resolution in the Spectral Domain","date":"2022-11-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"slp-rl/aero","path":"src/ddp/distrib.py","file_url":"https://github.com/slp-rl/aero/blob/HEAD/src/ddp/distrib.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":"1831eb66490366a4","code_sha256_prefix":"1831eb66490366a4","mcp_get_code":{"code_sha256":"1831eb66490366a4"}},{"arxiv_id":"2209.04899","arxiv_id_is_arxiv":true,"paper":"/paper/instruction-driven-history-aware-policies-for","title":"Instruction-driven history-aware policies for robotic manipulations","date":"2022-09-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"guhur/hiveformer","path":"dataset.py","file_url":"https://github.com/guhur/hiveformer/blob/HEAD/dataset.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":"17bfe81c047d25b6","code_sha256_prefix":"17bfe81c047d25b6","mcp_get_code":{"code_sha256":"17bfe81c047d25b6"}},{"arxiv_id":"2108.06852","arxiv_id_is_arxiv":true,"paper":"/paper/a-hybrid-video-anomaly-detection-framework","title":"A Hybrid Video Anomaly Detection Framework via Memory-Augmented Flow Reconstruction and Flow-Guided Frame Prediction","date":"2021-08-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"LiUzHiAn/hf2vad","path":"utils/model_utils.py","file_url":"https://github.com/LiUzHiAn/hf2vad/blob/HEAD/utils/model_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":"bc27df2e0a58fe31","code_sha256_prefix":"bc27df2e0a58fe31","mcp_get_code":{"code_sha256":"bc27df2e0a58fe31"}},{"arxiv_id":"2103.16483","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarking-representation-learning-for","title":"Benchmarking Representation Learning for Natural World Image Collections","date":"2021-03-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visipedia/newt","path":"benchmark/pt_resnet_feature_extractor.py","file_url":"https://github.com/visipedia/newt/blob/HEAD/benchmark/pt_resnet_feature_extractor.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":"65dab949aa3e1b87","code_sha256_prefix":"65dab949aa3e1b87","mcp_get_code":{"code_sha256":"65dab949aa3e1b87"}},{"arxiv_id":"2003.08934","arxiv_id_is_arxiv":true,"paper":"/paper/nerf-representing-scenes-as-neural-radiance","title":"NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AnimatedRNG/nerf-jax","path":"nerf/nerf_dataset.py","file_url":"https://github.com/AnimatedRNG/nerf-jax/blob/HEAD/nerf/nerf_dataset.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":"898a883c9cbd99f6","code_sha256_prefix":"898a883c9cbd99f6","mcp_get_code":{"code_sha256":"898a883c9cbd99f6"}},{"arxiv_id":"1912.13361","arxiv_id_is_arxiv":true,"paper":"/paper/learning-representations-by-maximizing-mutual-1","title":"Learning Representations by Maximizing Mutual Information in Variational Autoencoders","date":"2019-12-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AliLotfi92/InfoMaxVAE","path":"dataset/dataset_.py","file_url":"https://github.com/AliLotfi92/InfoMaxVAE/blob/HEAD/dataset/dataset_.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":"68b1f50a35ec7994","code_sha256_prefix":"68b1f50a35ec7994","mcp_get_code":{"code_sha256":"68b1f50a35ec7994"}},{"arxiv_id":"1910.00057","arxiv_id_is_arxiv":true,"paper":"/paper/synthesizing-action-sequences-for-modifying","title":"Synthesizing Action Sequences for Modifying Model Decisions","date":"2019-09-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"goutham7r/synth-action-seq","path":"actions/feature.py","file_url":"https://github.com/goutham7r/synth-action-seq/blob/HEAD/actions/feature.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":"b06138785fde8a7b","code_sha256_prefix":"b06138785fde8a7b","mcp_get_code":{"code_sha256":"b06138785fde8a7b"}},{"arxiv_id":"Chen_DViN_Dynamic_Visual_Routing_Network_for_Weakly_Supervised_Referring_Expression_CVPR_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Chen_DViN_Dynamic_Visual_Routing_Network_for_Weakly_Supervised_Referring_Expression_CVPR_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"XxFChen/DViN","path":"datasets/dataloader.py","file_url":"https://github.com/XxFChen/DViN/blob/HEAD/datasets/dataloader.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":"7ce57f6ba531524d","code_sha256_prefix":"7ce57f6ba531524d","mcp_get_code":{"code_sha256":"7ce57f6ba531524d"}}],"record_sha256":"c547ec077c9669599d165c9ebb2739f8b821e416f5e173eb45b3da721cd8d161","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}