{"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/init-device","entry":"init_device","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":20,"n_papers_ran":12,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":12,"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":7,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":1,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":20,"n_places_pointer_only":10,"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":0,"ran_draft_wrong":0,"ran_fixture":1,"ran":0,"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":"2609.02204","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2609-02204","title":"TAME: Temporal-Aware Mixture-of-Experts for Text-Video Retrieval","date":null,"month_inferred_from_arxiv_id":"2026-09","title_source":"syntology","repo":"sejong-rcv/TAME","path":"main_task_retrieval.py","file_url":"https://github.com/sejong-rcv/TAME/blob/HEAD/main_task_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, sejong-rcv/TAME when it was checked","code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2606.25526","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2606-25526","title":"Low Variance Trust Region Optimization with Independent Actors and Sequential Updates in Cooperative Multi-agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2026-06","title_source":"syntology","repo":"giangbang/Low-Variance-Trust-Region-MARL","path":"harl/utils/models_tools.py","file_url":"https://github.com/giangbang/Low-Variance-Trust-Region-MARL/blob/HEAD/harl/utils/models_tools.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, giangbang/Low-Variance-Trust-Region-MARL when it was checked","code_sha256":"26655a898162be82","code_sha256_prefix":"26655a898162be82","mcp_get_code":{"code_sha256":"26655a898162be82"}},{"arxiv_id":"2510.11824","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-11824","title":"Empirical Study on Robustness and Resilience in Cooperative Multi-Agent Reinforcement Learning","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"BUAA-TrustworthyMARL/adv_marl_benchmark","path":"amb/utils/model_utils.py","file_url":"https://github.com/BUAA-TrustworthyMARL/adv_marl_benchmark/blob/HEAD/amb/utils/model_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, BUAA-TrustworthyMARL/adv_marl_benchmark when it was checked","code_sha256":"45f77fabdb24e54a","code_sha256_prefix":"45f77fabdb24e54a","mcp_get_code":{"code_sha256":"45f77fabdb24e54a"}},{"arxiv_id":"2504.04707","arxiv_id_is_arxiv":true,"paper":"/paper/tc-mgc-text-conditioned-multi-grained","title":"TC-MGC: Text-Conditioned Multi-Grained Contrastive Learning for Text-Video Retrieval","date":"2025-04-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2408.07841","arxiv_id_is_arxiv":true,"paper":"/paper/sustaindc-benchmarking-for-sustainable-data","title":"SustainDC: Benchmarking for Sustainable Data Center Control","date":"2024-08-14","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hewlettpackard/dc-rl","path":"harl/utils/models_tools.py","file_url":"https://github.com/hewlettpackard/dc-rl/blob/HEAD/harl/utils/models_tools.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"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 giangbang/Low-Variance-Trust-Region-MARL, and GitHub detected no licence in that repository when it was checked","code_sha256":"26655a898162be82","code_sha256_prefix":"26655a898162be82","mcp_get_code":{"code_sha256":"26655a898162be82"}},{"arxiv_id":"2407.16394","arxiv_id_is_arxiv":true,"paper":"/paper/seds-semantically-enhanced-dual-stream","title":"SEDS: Semantically Enhanced Dual-Stream Encoder for Sign Language Retrieval","date":"2024-07-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"longtaojiang/seds","path":"main_task_retrieval.py","file_url":"https://github.com/longtaojiang/seds/blob/HEAD/main_task_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2405.17898","arxiv_id_is_arxiv":true,"paper":"/paper/flashst-a-simple-and-universal-prompt-tuning","title":"FlashST: A Simple and Universal Prompt-Tuning Framework for Traffic Prediction","date":"2024-05-28","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HKUDS/FlashST","path":"lib/TrainInits.py","file_url":"https://github.com/HKUDS/FlashST/blob/HEAD/lib/TrainInits.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":"d7187fc207b2d503","code_sha256_prefix":"d7187fc207b2d503","mcp_get_code":{"code_sha256":"d7187fc207b2d503"}},{"arxiv_id":"2309.17093","arxiv_id_is_arxiv":true,"paper":"/paper/prototype-based-aleatoric-uncertainty-1","title":"Prototype-based Aleatoric Uncertainty Quantification for Cross-modal Retrieval","date":"2023-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"leolee99/PAU","path":"main_pau.py","file_url":"https://github.com/leolee99/PAU/blob/HEAD/main_pau.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2309.10091","arxiv_id_is_arxiv":true,"paper":"/paper/unified-coarse-to-fine-alignment-for-video","title":"Unified Coarse-to-Fine Alignment for Video-Text Retrieval","date":"2023-09-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Ziyang412/UCoFiA","path":"eval_t2v/main_ucofia.py","file_url":"https://github.com/Ziyang412/UCoFiA/blob/HEAD/eval_t2v/main_ucofia.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2308.11551","arxiv_id_is_arxiv":true,"paper":"/paper/multi-event-video-text-retrieval","title":"Multi-event Video-Text Retrieval","date":"2023-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gengyuanmax/MeVTR","path":"main_task_retrieval_multi.py","file_url":"https://github.com/gengyuanmax/MeVTR/blob/HEAD/main_task_retrieval_multi.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","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, gengyuanmax/MeVTR when it was checked","code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2303.10909","arxiv_id_is_arxiv":true,"paper":"/paper/graph-neural-rough-differential-equations-for","title":"Graph Neural Rough Differential Equations for Traffic Forecasting","date":"2023-03-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jeongwhanchoi/STG-NCDE","path":"lib/TrainInits.py","file_url":"https://github.com/jeongwhanchoi/STG-NCDE/blob/HEAD/lib/TrainInits.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":"d7187fc207b2d503","code_sha256_prefix":"d7187fc207b2d503","mcp_get_code":{"code_sha256":"d7187fc207b2d503"}},{"arxiv_id":"2208.04897","arxiv_id_is_arxiv":true,"paper":"/paper/sports-video-analysis-on-large-scale-data","title":"Sports Video Analysis on Large-Scale Data","date":"2022-08-09","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2207.07285","arxiv_id_is_arxiv":true,"paper":"/paper/x-clip-end-to-end-multi-grained-contrastive","title":"X-CLIP: End-to-End Multi-grained Contrastive Learning for Video-Text Retrieval","date":"2022-07-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2204.02874","arxiv_id_is_arxiv":true,"paper":"/paper/eclipse-efficient-long-range-video-retrieval","title":"ECLIPSE: Efficient Long-range Video Retrieval using Sight and Sound","date":"2022-04-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GenjiB/ECLIPSE","path":"compute_cost.py","file_url":"https://github.com/GenjiB/ECLIPSE/blob/HEAD/compute_cost.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2106.11097","arxiv_id_is_arxiv":true,"paper":"/paper/clip2video-mastering-video-text-retrieval-via","title":"CLIP2Video: Mastering Video-Text Retrieval via Image CLIP","date":"2021-06-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"CryhanFang/CLIP2Video","path":"infer_retrieval.py","file_url":"https://github.com/CryhanFang/CLIP2Video/blob/HEAD/infer_retrieval.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":"e129344aedf3001d","code_sha256_prefix":"e129344aedf3001d","mcp_get_code":{"code_sha256":"e129344aedf3001d"}},{"arxiv_id":"2104.08860","arxiv_id_is_arxiv":true,"paper":"/paper/clip4clip-an-empirical-study-of-clip-for-end","title":"CLIP4Clip: An Empirical Study of CLIP for End to End Video Clip Retrieval","date":"2021-04-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"2103.12731","arxiv_id_is_arxiv":true,"paper":"/paper/scaling-local-self-attention-for-parameter","title":"Scaling Local Self-Attention for Parameter Efficient Visual Backbones","date":"2021-03-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kevin-ssy/ViP","path":"utils/distributed_utils.py","file_url":"https://github.com/kevin-ssy/ViP/blob/HEAD/utils/distributed_utils.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":"5d8cf2436bdfc77b","code_sha256_prefix":"5d8cf2436bdfc77b","mcp_get_code":{"code_sha256":"5d8cf2436bdfc77b"}},{"arxiv_id":"2002.06353","arxiv_id_is_arxiv":true,"paper":"/paper/univilm-a-unified-video-and-language-pre","title":"UniVL: A Unified Video and Language Pre-Training Model for Multimodal Understanding and Generation","date":"2020-02-15","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":null,"path":"","file_url":null,"status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}},{"arxiv_id":"Xin_Music_Grounding_by_Short_Video_ICCV_2025_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Xin_Music_Grounding_by_Short_Video_ICCV_2025_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"xxayt/MGSV","path":"test-MaDe.py","file_url":"https://github.com/xxayt/MGSV/blob/HEAD/test-MaDe.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":"6220c52996e4fad4","code_sha256_prefix":"6220c52996e4fad4","mcp_get_code":{"code_sha256":"6220c52996e4fad4"}},{"arxiv_id":"Diao_UniPT_Universal_Parallel_Tuning_for_Transfer_Learning_with_Efficient_Parameter_CVPR_2024_paper","arxiv_id_is_arxiv":false,"paper":null,"title":"CVF open access id Diao_UniPT_Universal_Parallel_Tuning_for_Transfer_Learning_with_Efficient_Parameter_CVPR_2024_paper","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"Paranioar/UniPT","path":"CLIP4Clip/main_task_retrieval.py","file_url":"https://github.com/Paranioar/UniPT/blob/HEAD/CLIP4Clip/main_task_retrieval.py","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a0c23f10479a984e","code_sha256_prefix":"a0c23f10479a984e","mcp_get_code":{"code_sha256":"a0c23f10479a984e"}}],"record_sha256":"5b88fcd11ff28027a920fd1ff81977529a135c102ea0555f4242f00818966391","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}