{"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/build-logger","entry":"build_logger","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":2,"n_papers_ran_no_instrument_failure":0,"n_papers_ran_instrument_only":2,"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":2,"n_samples_constructed":0,"n_samples_ran_checked":0,"n_samples_instrument":2,"n_samples_unverified":6,"n_samples_fingerprinted":0,"n_places":9,"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":2,"ran_fixture":0,"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":"2608.27066","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-27066","title":"Beyond Classification: Task-Dependent Learnability under Privacy-Motivated Image Transformations","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"LeonRanke/Task-Dependent-Learnability","path":"src/utils.py","file_url":"https://github.com/LeonRanke/Task-Dependent-Learnability/blob/HEAD/src/utils.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"93ab45dd7f6c93e0","code_sha256_prefix":"93ab45dd7f6c93e0","mcp_get_code":{"code_sha256":"93ab45dd7f6c93e0"}},{"arxiv_id":"2411.17606","arxiv_id_is_arxiv":true,"paper":"/paper/hyperseg-towards-universal-visual","title":"HyperSeg: Towards Universal Visual Segmentation with Large Language Model","date":"2024-11-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"congvvc/HyperSeg","path":"hyperseg/model/mipha/utils.py","file_url":"https://github.com/congvvc/HyperSeg/blob/HEAD/hyperseg/model/mipha/utils.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":"40cf72d9c04c7f63","code_sha256_prefix":"40cf72d9c04c7f63","mcp_get_code":{"code_sha256":"40cf72d9c04c7f63"}},{"arxiv_id":"2410.05643","arxiv_id_is_arxiv":true,"paper":"/paper/trace-temporal-grounding-video-llm-via-causal","title":"TRACE: Temporal Grounding Video LLM via Causal Event Modeling","date":"2024-10-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"gyxxyg/TRACE","path":"trace/utils.py","file_url":"https://github.com/gyxxyg/TRACE/blob/HEAD/trace/utils.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":"8dc94b9682ebebf9","code_sha256_prefix":"8dc94b9682ebebf9","mcp_get_code":{"code_sha256":"8dc94b9682ebebf9"}},{"arxiv_id":"2409.19603","arxiv_id_is_arxiv":true,"paper":"/paper/one-token-to-seg-them-all-language-instructed","title":"One Token to Seg Them All: Language Instructed Reasoning Segmentation in Videos","date":"2024-09-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"showlab/videolisa","path":"model/llava/utils.py","file_url":"https://github.com/showlab/videolisa/blob/HEAD/model/llava/utils.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":"8dc94b9682ebebf9","code_sha256_prefix":"8dc94b9682ebebf9","mcp_get_code":{"code_sha256":"8dc94b9682ebebf9"}},{"arxiv_id":"2312.00401","arxiv_id_is_arxiv":true,"paper":"/paper/viotgpt-learning-to-schedule-vision-tools","title":"VIoTGPT: Learning to Schedule Vision Tools in LLMs towards Intelligent Video Internet of Things","date":"2023-12-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"zhongyy/viotgpt","path":"train/utils.py","file_url":"https://github.com/zhongyy/viotgpt/blob/HEAD/train/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, zhongyy/viotgpt when it was checked","code_sha256":"9eccbab8ec3b8244","code_sha256_prefix":"9eccbab8ec3b8244","mcp_get_code":{"code_sha256":"9eccbab8ec3b8244"}},{"arxiv_id":"2310.19740","arxiv_id_is_arxiv":true,"paper":"/paper/collaborative-evaluation-exploring-the","title":"Exploring the Reliability of Large Language Models as Customized Evaluators for Diverse NLP Tasks","date":"2023-10-30","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"qtli/coeval","path":"webapp/utils.py","file_url":"https://github.com/qtli/coeval/blob/HEAD/webapp/utils.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":"2cd3e6b1d3d305ca","code_sha256_prefix":"2cd3e6b1d3d305ca","mcp_get_code":{"code_sha256":"2cd3e6b1d3d305ca"}},{"arxiv_id":"2309.00615","arxiv_id_is_arxiv":true,"paper":"/paper/point-bind-point-llm-aligning-point-cloud","title":"Point-Bind & Point-LLM: Aligning Point Cloud with Multi-modality for 3D Understanding, Generation, and Instruction Following","date":"2023-09-01","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"openrobotlab/pointllm","path":"pointllm/utils.py","file_url":"https://github.com/openrobotlab/pointllm/blob/HEAD/pointllm/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, openrobotlab/pointllm when it was checked","code_sha256":"51310aa3870aaa30","code_sha256_prefix":"51310aa3870aaa30","mcp_get_code":{"code_sha256":"51310aa3870aaa30"}},{"arxiv_id":"2203.01531","arxiv_id_is_arxiv":true,"paper":"/paper/cafe-learning-to-condense-dataset-by-aligning","title":"CAFE: Learning to Condense Dataset by Aligning Features","date":"2022-03-03","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kaiwang960112/cafe","path":"distill.py","file_url":"https://github.com/kaiwang960112/cafe/blob/HEAD/distill.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, kaiwang960112/cafe when it was checked","code_sha256":"45800818f22dfa10","code_sha256_prefix":"45800818f22dfa10","mcp_get_code":{"code_sha256":"45800818f22dfa10"}},{"arxiv_id":"2025.emnlp-main.19","arxiv_id_is_arxiv":false,"paper":null,"title":"ACL Anthology id 2025.emnlp-main.19","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"zechenli03/SensorLLM","path":"sensorllm/utils.py","file_url":"https://github.com/zechenli03/SensorLLM/blob/HEAD/sensorllm/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":"4e49ba4bbc60fbd4","code_sha256_prefix":"4e49ba4bbc60fbd4","mcp_get_code":{"code_sha256":"4e49ba4bbc60fbd4"}}],"record_sha256":"e4a057d02bd1a1e21e848115d58b2ded193594ea13a1ea2a52e116137305c4cf","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}