{"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/flat","entry":"flat","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":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":8,"n_samples_ran":8,"n_samples_constructed":0,"n_samples_ran_checked":8,"n_samples_instrument":0,"n_samples_unverified":0,"n_samples_fingerprinted":5,"n_places":11,"n_places_pointer_only":7,"n_places_pointer_only_link_open":3,"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":3,"ran_violates":1,"ran_draft_wrong":0,"ran_fixture":0,"ran":4,"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":"2608.24460","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2608-24460","title":"Shortcut Before Circuit: Document Statistics Time In-Context Conflict Resolution","date":null,"month_inferred_from_arxiv_id":"2026-08","title_source":"syntology","repo":"lyj20071013/Shortcut-Before-Circuit","path":"an_fd.py","file_url":"https://github.com/lyj20071013/Shortcut-Before-Circuit/blob/HEAD/an_fd.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"c92e431dddb93f6b","code_sha256_prefix":"c92e431dddb93f6b","mcp_get_code":{"code_sha256":"c92e431dddb93f6b"}},{"arxiv_id":"2504.03306","arxiv_id_is_arxiv":true,"paper":"/paper/multi-flow-multi-view-enriched-normalizing","title":"Multi-Flow: Multi-View-Enriched Normalizing Flows for Industrial Anomaly Detection","date":"2025-04-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"m-kruse98/multi-flow","path":"models/cv_model.py","file_url":"https://github.com/m-kruse98/multi-flow/blob/HEAD/models/cv_model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"9120a1472b8c96d3","code_sha256_prefix":"9120a1472b8c96d3","mcp_get_code":{"code_sha256":"9120a1472b8c96d3"}},{"arxiv_id":"2405.16273","arxiv_id_is_arxiv":true,"paper":"/paper/m-3-gpt-an-advanced-multimodal-multitask","title":"M$^3$GPT: An Advanced Multimodal, Multitask Framework for Motion Comprehension and Generation","date":"2024-05-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"luomingshuang/M3GPT","path":"m3gpt/core/config.py","file_url":"https://github.com/luomingshuang/M3GPT/blob/HEAD/m3gpt/core/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, luomingshuang/M3GPT when it was checked","code_sha256":"4570d6d70bccdfb6","code_sha256_prefix":"4570d6d70bccdfb6","mcp_get_code":{"code_sha256":"4570d6d70bccdfb6"}},{"arxiv_id":"2312.01697","arxiv_id_is_arxiv":true,"paper":"/paper/hulk-a-universal-knowledge-translator-for","title":"Hulk: A Universal Knowledge Translator for Human-Centric Tasks","date":"2023-12-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"opengvlab/hulk","path":"core/config.py","file_url":"https://github.com/opengvlab/hulk/blob/HEAD/core/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 luomingshuang/M3GPT, and GitHub detected no licence in that repository when it was checked","code_sha256":"4570d6d70bccdfb6","code_sha256_prefix":"4570d6d70bccdfb6","mcp_get_code":{"code_sha256":"4570d6d70bccdfb6"}},{"arxiv_id":"2307.13943","arxiv_id_is_arxiv":true,"paper":"/paper/topology-aware-robust-optimization-for-out-of","title":"Topology-aware Robust Optimization for Out-of-distribution Generalization","date":"2023-07-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"joffery/tro","path":"toy/utils/utils.py","file_url":"https://github.com/joffery/tro/blob/HEAD/toy/utils/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, joffery/tro when it was checked","code_sha256":"709a8e9ceba1bb9d","code_sha256_prefix":"709a8e9ceba1bb9d","mcp_get_code":{"code_sha256":"709a8e9ceba1bb9d"}},{"arxiv_id":"2303.02936","arxiv_id_is_arxiv":true,"paper":"/paper/unihcp-a-unified-model-for-human-centric","title":"UniHCP: A Unified Model for Human-Centric Perceptions","date":"2023-03-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OpenGVLab/UniHCP","path":"core/config.py","file_url":"https://github.com/OpenGVLab/UniHCP/blob/HEAD/core/config.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"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 luomingshuang/M3GPT, and GitHub detected no licence in that repository when it was checked","code_sha256":"4570d6d70bccdfb6","code_sha256_prefix":"4570d6d70bccdfb6","mcp_get_code":{"code_sha256":"4570d6d70bccdfb6"}},{"arxiv_id":"2302.02561","arxiv_id_is_arxiv":true,"paper":"/paper/domain-indexing-variational-bayes","title":"Domain-Indexing Variational Bayes: Interpretable Domain Index for Domain Adaptation","date":"2023-02-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"Wang-ML-Lab/VDI","path":"CompCars/model/model.py","file_url":"https://github.com/Wang-ML-Lab/VDI/blob/HEAD/CompCars/model/model.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"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 joffery/tro, and GitHub detected no licence in that repository when it was checked","code_sha256":"709a8e9ceba1bb9d","code_sha256_prefix":"709a8e9ceba1bb9d","mcp_get_code":{"code_sha256":"709a8e9ceba1bb9d"}},{"arxiv_id":"2204.13256","arxiv_id_is_arxiv":true,"paper":"/paper/shielding-federated-learning-robust","title":"Shielding Federated Learning: Robust Aggregation with Adaptive Client Selection","date":null,"month_inferred_from_arxiv_id":"2022-04","title_source":"archive","repo":"hustweiwan/mab-rfl","path":"MAB-RFL-released.py","file_url":"https://github.com/hustweiwan/mab-rfl/blob/HEAD/MAB-RFL-released.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","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, hustweiwan/mab-rfl when it was checked","code_sha256":"60f6cf6130e7eea2","code_sha256_prefix":"60f6cf6130e7eea2","mcp_get_code":{"code_sha256":"60f6cf6130e7eea2"}},{"arxiv_id":"2204.05041","arxiv_id_is_arxiv":true,"paper":"/paper/pyramid-grafting-network-for-one-stage-high","title":"Pyramid Grafting Network for One-Stage High Resolution Saliency Detection","date":"2022-04-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"icvteam/pgnet","path":"src/train_distributed.py","file_url":"https://github.com/icvteam/pgnet/blob/HEAD/src/train_distributed.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"3fd7d0fe23fd7f1d","code_sha256_prefix":"3fd7d0fe23fd7f1d","mcp_get_code":{"code_sha256":"3fd7d0fe23fd7f1d"}},{"arxiv_id":"2106.08630","arxiv_id_is_arxiv":true,"paper":"/paper/help-hardware-adaptive-efficient-latency","title":"HELP: Hardware-Adaptive Efficient Latency Prediction for NAS via Meta-Learning","date":"2021-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"HayeonLee/HELP","path":"utils.py","file_url":"https://github.com/HayeonLee/HELP/blob/HEAD/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":"1d5210b89b90aa66","code_sha256_prefix":"1d5210b89b90aa66","mcp_get_code":{"code_sha256":"1d5210b89b90aa66"}},{"arxiv_id":"1905.04819","arxiv_id_is_arxiv":true,"paper":"/paper/task-agnostic-dynamics-priors-for-deep","title":"Task-Agnostic Dynamics Priors for Deep Reinforcement Learning","date":"2019-05-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yilundu/task_agnostic_dynamics_prior","path":"train_batch.py","file_url":"https://github.com/yilundu/task_agnostic_dynamics_prior/blob/HEAD/train_batch.py","status":"ran_violates","verification_level":1,"contract_check":"VIOLATES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"inline_ok_link":false,"withheld_clause":"GitHub detected no licence in this paper's repository, yilundu/task_agnostic_dynamics_prior when it was checked","code_sha256":"415094e2d3c0c7bd","code_sha256_prefix":"415094e2d3c0c7bd","mcp_get_code":{"code_sha256":"415094e2d3c0c7bd"}}],"record_sha256":"1213a02d0674dd129370c56671987d0c1331fefc6f6031fb3928752a6409f3ba","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}