{"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-mask","entry":"load_mask","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":12,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":11,"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":12,"n_samples_ran":11,"n_samples_constructed":0,"n_samples_ran_checked":11,"n_samples_instrument":0,"n_samples_unverified":1,"n_samples_fingerprinted":1,"n_places":12,"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":1,"ran_violates":2,"ran_draft_wrong":0,"ran_fixture":0,"ran":8,"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":"2608.30621","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-30621","title":"Cost-efficient Active Learning for Referring Image Segmentation and Grounding","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"junbum766/ALRIS","path":"annotation_tool/make_pseudo_to_gt.py","file_url":"https://github.com/junbum766/ALRIS/blob/HEAD/annotation_tool/make_pseudo_to_gt.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","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, junbum766/ALRIS when it was checked","code_sha256":"88d9998202bec8bf","code_sha256_prefix":"88d9998202bec8bf","mcp_get_code":{"code_sha256":"88d9998202bec8bf"}},{"arxiv_id":"2503.14029","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-end-to-end-2d-to-3d-scene","title":"Rethinking End-to-End 2D to 3D Scene Segmentation in Gaussian Splatting","date":"2025-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"runsong123/unified-lift","path":"script/eval_lerf_mask_unified_lift.py","file_url":"https://github.com/runsong123/unified-lift/blob/HEAD/script/eval_lerf_mask_unified_lift.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":"bf2d28223bdf332b","code_sha256_prefix":"bf2d28223bdf332b","mcp_get_code":{"code_sha256":"bf2d28223bdf332b"}},{"arxiv_id":"2503.00370","arxiv_id_is_arxiv":true,"paper":"/paper/scalable-real2sim-physics-aware-asset","title":"Scalable Real2Sim: Physics-Aware Asset Generation Via Robotic Pick-and-Place Setups","date":null,"month_inferred_from_arxiv_id":"2025-03","title_source":"archive","repo":"nepfaff/scalable-real2sim","path":"scalable_real2sim/data_processing/alpha_channel.py","file_url":"https://github.com/nepfaff/scalable-real2sim/blob/HEAD/scalable_real2sim/data_processing/alpha_channel.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":"48c8f1c765149a09","code_sha256_prefix":"48c8f1c765149a09","mcp_get_code":{"code_sha256":"48c8f1c765149a09"}},{"arxiv_id":"2502.03686","arxiv_id_is_arxiv":true,"paper":"/paper/variational-control-for-guidance-in-diffusion","title":"Variational Control for Guidance in Diffusion Models","date":"2025-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"czi-ai/oc-guidance","path":"algos/ndtm.py","file_url":"https://github.com/czi-ai/oc-guidance/blob/HEAD/algos/ndtm.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"789b9f261d70e038","code_sha256_prefix":"789b9f261d70e038","mcp_get_code":{"code_sha256":"789b9f261d70e038"}},{"arxiv_id":"2409.16554","arxiv_id_is_arxiv":true,"paper":"/paper/emit-event-based-masked-auto-encoding-for","title":"EMIT- Event-Based Masked Auto Encoding for Irregular Time Series","date":"2024-09-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hrishi-ds/EMIT","path":"src/pretraining/pretrain_mimic.py","file_url":"https://github.com/hrishi-ds/EMIT/blob/HEAD/src/pretraining/pretrain_mimic.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"19a72224a3e8b996","code_sha256_prefix":"19a72224a3e8b996","mcp_get_code":{"code_sha256":"19a72224a3e8b996"}},{"arxiv_id":"2406.15658","arxiv_id_is_arxiv":true,"paper":"/paper/torchspatial-a-location-encoding-framework","title":"TorchSpatial: A Location Encoding Framework and Benchmark for Spatial Representation Learning","date":"2024-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"seai-lab/torchspatial","path":"main/analysis.py","file_url":"https://github.com/seai-lab/torchspatial/blob/HEAD/main/analysis.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":"9d835b2cb9e2f146","code_sha256_prefix":"9d835b2cb9e2f146","mcp_get_code":{"code_sha256":"9d835b2cb9e2f146"}},{"arxiv_id":"2312.02619","arxiv_id_is_arxiv":true,"paper":"/paper/rethinking-and-simplifying-bootstrapped-graph","title":"Rethinking and Simplifying Bootstrapped Graph Latents","date":"2023-12-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zszszs25/sgcl","path":"bgrl/utils.py","file_url":"https://github.com/zszszs25/sgcl/blob/HEAD/bgrl/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, zszszs25/sgcl when it was checked","code_sha256":"bdd5f1d2fd48f642","code_sha256_prefix":"bdd5f1d2fd48f642","mcp_get_code":{"code_sha256":"bdd5f1d2fd48f642"}},{"arxiv_id":"2308.02351","arxiv_id_is_arxiv":true,"paper":"/paper/a-parameter-efficient-multi-subject-model-for","title":"A Parameter-efficient Multi-subject Model for Predicting fMRI Activity","date":"2023-08-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cmi-dair/algonauts23","path":"dataset/generate_dataset.py","file_url":"https://github.com/cmi-dair/algonauts23/blob/HEAD/dataset/generate_dataset.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":"a0183f9f30a1b5c5","code_sha256_prefix":"a0183f9f30a1b5c5","mcp_get_code":{"code_sha256":"a0183f9f30a1b5c5"}},{"arxiv_id":"2307.05898","arxiv_id_is_arxiv":true,"paper":"/paper/rectifying-noisy-labels-with-sequential-prior","title":"Rectifying Noisy Labels with Sequential Prior: Multi-Scale Temporal Feature Affinity Learning for Robust Video Segmentation","date":"2023-07-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beileicui/ms-tfal","path":"generate_noise/count_noisy_ratio.py","file_url":"https://github.com/beileicui/ms-tfal/blob/HEAD/generate_noise/count_noisy_ratio.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":"c54a18449d6b5220","code_sha256_prefix":"c54a18449d6b5220","mcp_get_code":{"code_sha256":"c54a18449d6b5220"}},{"arxiv_id":"2210.04885","arxiv_id_is_arxiv":true,"paper":"/paper/what-the-daam-interpreting-stable-diffusion","title":"What the DAAM: Interpreting Stable Diffusion Using Cross Attention","date":"2022-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"castorini/daam","path":"daam/evaluate.py","file_url":"https://github.com/castorini/daam/blob/HEAD/daam/evaluate.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":"f77ce1db1f158502","code_sha256_prefix":"f77ce1db1f158502","mcp_get_code":{"code_sha256":"f77ce1db1f158502"}},{"arxiv_id":"2004.10934","arxiv_id_is_arxiv":true,"paper":"/paper/yolov4-optimal-speed-and-accuracy-of-object","title":"YOLOv4: Optimal Speed and Accuracy of Object Detection","date":"2020-04-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"rechardchen123/YOLOv4_traffic_sign_detection","path":"data_transfer/anno_func.py","file_url":"https://github.com/rechardchen123/YOLOv4_traffic_sign_detection/blob/HEAD/data_transfer/anno_func.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":"335b5891c69043c6","code_sha256_prefix":"335b5891c69043c6","mcp_get_code":{"code_sha256":"335b5891c69043c6"}},{"arxiv_id":"Ershov_Physically-Plausible_Illumination_Distribution_Estimation_ICCV_2023_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Ershov_Physically-Plausible_Illumination_Distribution_Estimation_ICCV_2023_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"createcolor/IDE","path":"dataset_generators/generate_illum_distrib.py","file_url":"https://github.com/createcolor/IDE/blob/HEAD/dataset_generators/generate_illum_distrib.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":"f0bba897e4e5af0a","code_sha256_prefix":"f0bba897e4e5af0a","mcp_get_code":{"code_sha256":"f0bba897e4e5af0a"}}],"record_sha256":"4667fa129a92cafc43c1105d1246986ff04e606a780cf66fe8f1a874c557b292","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}