{"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/train-collate-fn","entry":"train_collate_fn","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":11,"n_papers_ran":11,"n_papers_ran_no_instrument_failure":6,"n_papers_ran_instrument_only":5,"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":9,"n_samples_constructed":0,"n_samples_ran_checked":5,"n_samples_instrument":4,"n_samples_unverified":0,"n_samples_fingerprinted":0,"n_places":12,"n_places_pointer_only":3,"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":3,"ran_fixture":1,"ran":5,"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":"2503.07259","arxiv_id_is_arxiv":true,"paper":"/paper/comodo-cross-modal-video-to-imu-distillation","title":"COMODO: Cross-Modal Video-to-IMU Distillation for Efficient Egocentric Human Activity Recognition","date":"2025-03-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Breezelled/COMODO","path":"comodo/utils/collate_util.py","file_url":"https://github.com/Breezelled/COMODO/blob/HEAD/comodo/utils/collate_util.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":"0076a30fbf64e6f1","code_sha256_prefix":"0076a30fbf64e6f1","mcp_get_code":{"code_sha256":"0076a30fbf64e6f1"}},{"arxiv_id":"2410.08102","arxiv_id_is_arxiv":true,"paper":"/paper/multi-agent-collaborative-data-selection-for","title":"Multi-Agent Collaborative Data Selection for Efficient LLM Pretraining","date":"2024-10-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"beccabai/multi-agent-data-selection","path":"src/call_influence_mates/cal_influence.py","file_url":"https://github.com/beccabai/multi-agent-data-selection/blob/HEAD/src/call_influence_mates/cal_influence.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, beccabai/multi-agent-data-selection when it was checked","code_sha256":"dd877a8676636617","code_sha256_prefix":"dd877a8676636617","mcp_get_code":{"code_sha256":"dd877a8676636617"}},{"arxiv_id":"2405.20851","arxiv_id_is_arxiv":true,"paper":"/paper/megactor-harness-the-power-of-raw-video-for","title":"MegActor: Harness the Power of Raw Video for Vivid Portrait Animation","date":"2024-05-31","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"megvii-research/megfaceanimate","path":"face_dataset.py","file_url":"https://github.com/megvii-research/megfaceanimate/blob/HEAD/face_dataset.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"8b497c21236ea29d","code_sha256_prefix":"8b497c21236ea29d","mcp_get_code":{"code_sha256":"8b497c21236ea29d"}},{"arxiv_id":"2307.16230","arxiv_id_is_arxiv":true,"paper":"/paper/a-private-watermark-for-large-language-models","title":"An Unforgeable Publicly Verifiable Watermark for Large Language Models","date":"2023-07-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"thu-bpm/unforgeable_watermark","path":"detector.py","file_url":"https://github.com/thu-bpm/unforgeable_watermark/blob/HEAD/detector.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, thu-bpm/unforgeable_watermark when it was checked","code_sha256":"a9b110ac99734343","code_sha256_prefix":"a9b110ac99734343","mcp_get_code":{"code_sha256":"a9b110ac99734343"}},{"arxiv_id":"2306.13856","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raywang335/L2RCLIP","path":"datasets/make_dataloader.py","file_url":"https://github.com/raywang335/L2RCLIP/blob/HEAD/datasets/make_dataloader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9297ce0fe9cac98","code_sha256_prefix":"a9297ce0fe9cac98","mcp_get_code":{"code_sha256":"a9297ce0fe9cac98"}},{"arxiv_id":"2306.13856","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-rank-meets-language-boosting-1","title":"Learning-to-Rank Meets Language: Boosting Language-Driven Ordering Alignment for Ordinal Classification","date":"2023-06-24","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"raywang335/L2RCLIP","path":"datasets/make_dataloader_clipreid.py","file_url":"https://github.com/raywang335/L2RCLIP/blob/HEAD/datasets/make_dataloader_clipreid.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":"0b63d2a1df1e76b4","code_sha256_prefix":"0b63d2a1df1e76b4","mcp_get_code":{"code_sha256":"0b63d2a1df1e76b4"}},{"arxiv_id":"2111.12084","arxiv_id_is_arxiv":true,"paper":"/paper/self-supervised-pre-training-for-transformer","title":"Self-Supervised Pre-Training for Transformer-Based Person Re-Identification","date":"2021-11-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"damo-cv/TransReID-SSL","path":"transreid_pytorch/datasets/make_dataloader.py","file_url":"https://github.com/damo-cv/TransReID-SSL/blob/HEAD/transreid_pytorch/datasets/make_dataloader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":false,"inline_ok_link":false,"withheld_clause":"MIT, as GitHub detects it on this paper's repository, damo-cv/TransReID-SSL, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it","code_sha256":"a9297ce0fe9cac98","code_sha256_prefix":"a9297ce0fe9cac98","mcp_get_code":{"code_sha256":"a9297ce0fe9cac98"}},{"arxiv_id":"2111.00880","arxiv_id_is_arxiv":true,"paper":"/paper/benchmarks-for-corruption-invariant-person-re","title":"Benchmarks for Corruption Invariant Person Re-identification","date":"2021-11-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"MinghuiChen43/CIL-ReID","path":"datasets/make_dataloader.py","file_url":"https://github.com/MinghuiChen43/CIL-ReID/blob/HEAD/datasets/make_dataloader.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"a9297ce0fe9cac98","code_sha256_prefix":"a9297ce0fe9cac98","mcp_get_code":{"code_sha256":"a9297ce0fe9cac98"}},{"arxiv_id":"2110.03370","arxiv_id_is_arxiv":true,"paper":"/paper/wenetspeech-a-10000-hours-multi-domain","title":"WenetSpeech: A 10000+ Hours Multi-domain Mandarin Corpus for Speech Recognition","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"aizhiqi-work/MM-KWS","path":"mm-kws/dataloaders/wenetphrase_train.py","file_url":"https://github.com/aizhiqi-work/MM-KWS/blob/HEAD/mm-kws/dataloaders/wenetphrase_train.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":"0d74ccb2ff7f766a","code_sha256_prefix":"0d74ccb2ff7f766a","mcp_get_code":{"code_sha256":"0d74ccb2ff7f766a"}},{"arxiv_id":"2003.08608","arxiv_id_is_arxiv":true,"paper":"/paper/depth-potentiality-aware-gated-attention","title":"DPANet: Depth Potentiality-Aware Gated Attention Network for RGB-D Salient Object Detection","date":"2020-03-19","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JosephChenHub/DPANet","path":"lib/dataset.py","file_url":"https://github.com/JosephChenHub/DPANet/blob/HEAD/lib/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":"a083d5eaad197336","code_sha256_prefix":"a083d5eaad197336","mcp_get_code":{"code_sha256":"a083d5eaad197336"}},{"arxiv_id":"1908.10357","arxiv_id_is_arxiv":true,"paper":"/paper/bottom-up-higher-resolution-networks-for","title":"HigherHRNet: Scale-Aware Representation Learning for Bottom-Up Human Pose Estimation","date":"2019-08-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"xn1997/HigherHRnet","path":"datasets/make_dataloader.py","file_url":"https://github.com/xn1997/HigherHRnet/blob/HEAD/datasets/make_dataloader.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":"84d4b3637b0b4b2d","code_sha256_prefix":"84d4b3637b0b4b2d","mcp_get_code":{"code_sha256":"84d4b3637b0b4b2d"}},{"arxiv_id":"1903.07071","arxiv_id_is_arxiv":true,"paper":"/paper/bags-of-tricks-and-a-strong-baseline-for-deep","title":"Bag of Tricks and A Strong Baseline for Deep Person Re-identification","date":"2019-03-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lulujianjie/person-reid-tiny-baseline","path":"datasets/make_dataloader.py","file_url":"https://github.com/lulujianjie/person-reid-tiny-baseline/blob/HEAD/datasets/make_dataloader.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":"84d4b3637b0b4b2d","code_sha256_prefix":"84d4b3637b0b4b2d","mcp_get_code":{"code_sha256":"84d4b3637b0b4b2d"}}],"record_sha256":"a8dfdbc8e0448e4e0aa7e9cae58484f8ba9303dd867a913f361d8ad3a0a29e10","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}