{"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/get-value","entry":"get_value","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":16,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":4,"n_papers_ran_instrument_only":3,"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":16,"n_samples_ran":7,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":3,"n_samples_unverified":9,"n_samples_fingerprinted":0,"n_places":17,"n_places_pointer_only":11,"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":2,"ran_violates":0,"ran_draft_wrong":3,"ran_fixture":0,"ran":2,"unverified":9},"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":"2508.07201","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2508-07201","title":"Propagation Tree Is Not Deep: Adaptive Graph Contrastive Learning Approach for Rumor Detection","date":null,"month_inferred_from_arxiv_id":"2025-08","title_source":"syntology","repo":"CcQunResearch/RAGCL","path":"Log/record_pretrain.py","file_url":"https://github.com/CcQunResearch/RAGCL/blob/HEAD/Log/record_pretrain.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, CcQunResearch/RAGCL when it was checked","code_sha256":"aa3d7ff03ca360fe","code_sha256_prefix":"aa3d7ff03ca360fe","mcp_get_code":{"code_sha256":"aa3d7ff03ca360fe"}},{"arxiv_id":"2412.09078","arxiv_id_is_arxiv":true,"paper":"/paper/forest-of-thought-scaling-test-time-compute","title":"Forest-of-Thought: Scaling Test-Time Compute for Enhancing LLM Reasoning","date":"2024-12-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"iamhankai/Forest-of-Thought","path":"methods/bfs.py","file_url":"https://github.com/iamhankai/Forest-of-Thought/blob/HEAD/methods/bfs.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, iamhankai/Forest-of-Thought when it was checked","code_sha256":"d58f5d5cbf3c2248","code_sha256_prefix":"d58f5d5cbf3c2248","mcp_get_code":{"code_sha256":"d58f5d5cbf3c2248"}},{"arxiv_id":"2406.11911","arxiv_id_is_arxiv":true,"paper":"/paper/a-notion-of-complexity-for-theory-of-mind-via","title":"A Notion of Complexity for Theory of Mind via Discrete World Models","date":"2024-06-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"flecart/complexity-tom-dwm","path":"main/tot_prompt.py","file_url":"https://github.com/flecart/complexity-tom-dwm/blob/HEAD/main/tot_prompt.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":"eaa9e9754f7e49f2","code_sha256_prefix":"eaa9e9754f7e49f2","mcp_get_code":{"code_sha256":"eaa9e9754f7e49f2"}},{"arxiv_id":"2404.16302","arxiv_id_is_arxiv":true,"paper":"/paper/cfmw-cross-modality-fusion-mamba-for","title":"CFMW: Cross-modality Fusion Mamba for Multispectral Object Detection under Adverse Weather Conditions","date":"2024-04-25","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"lhy-zjut/cfmw","path":"global_var.py","file_url":"https://github.com/lhy-zjut/cfmw/blob/HEAD/global_var.py","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"AGPL-3.0","inline_ok":false,"inline_ok_link":false,"withheld_clause":"AGPL-3.0, as GitHub detects it on this paper's repository, lhy-zjut/cfmw, is not in the permissive set Syntology serves inline","code_sha256":"7f938e0da00ca908","code_sha256_prefix":"7f938e0da00ca908","mcp_get_code":{"code_sha256":"7f938e0da00ca908"}},{"arxiv_id":"2403.07955","arxiv_id_is_arxiv":true,"paper":"/paper/towards-faithful-explanations-boosting","title":"Towards Faithful Explanations: Boosting Rationalization with Shortcuts Discovery","date":"2024-03-12","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"yuelinan/codes-of-SSR","path":"utils.py","file_url":"https://github.com/yuelinan/codes-of-SSR/blob/HEAD/utils.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, yuelinan/codes-of-SSR when it was checked","code_sha256":"20e720280c567c56","code_sha256_prefix":"20e720280c567c56","mcp_get_code":{"code_sha256":"20e720280c567c56"}},{"arxiv_id":"2402.12789","arxiv_id_is_arxiv":true,"paper":"/paper/fair-classifiers-without-fair-training-an","title":"Fairness Without Harm: An Influence-Guided Active Sampling Approach","date":"2024-02-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ucsc-real/fairnesswithoutharm","path":"src/global_var.py","file_url":"https://github.com/ucsc-real/fairnesswithoutharm/blob/HEAD/src/global_var.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, ucsc-real/fairnesswithoutharm when it was checked","code_sha256":"0b158af03f71fad8","code_sha256_prefix":"0b158af03f71fad8","mcp_get_code":{"code_sha256":"0b158af03f71fad8"}},{"arxiv_id":"2312.10812","arxiv_id_is_arxiv":true,"paper":"/paper/learning-to-act-without-actions","title":"Learning to Act without Actions","date":"2023-12-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"schmidtdominik/LAPO","path":"lapo/stage3_decoding.py","file_url":"https://github.com/schmidtdominik/LAPO/blob/HEAD/lapo/stage3_decoding.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"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, schmidtdominik/LAPO when it was checked","code_sha256":"a3b2115d7679282c","code_sha256_prefix":"a3b2115d7679282c","mcp_get_code":{"code_sha256":"a3b2115d7679282c"}},{"arxiv_id":"2312.06647","arxiv_id_is_arxiv":true,"paper":"/paper/4m-massively-multimodal-masked-modeling-1","title":"4M: Massively Multimodal Masked Modeling","date":"2023-12-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"apple/ml-4m","path":"fourm/demo_4M_sampler.py","file_url":"https://github.com/apple/ml-4m/blob/HEAD/fourm/demo_4M_sampler.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"Apache-2.0","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"1c442a156b80c649","code_sha256_prefix":"1c442a156b80c649","mcp_get_code":{"code_sha256":"1c442a156b80c649"}},{"arxiv_id":"2310.07152","arxiv_id_is_arxiv":true,"paper":"/paper/no-privacy-left-outside-on-the-in-security-of","title":"No Privacy Left Outside: On the (In-)Security of TEE-Shielded DNN Partition for On-Device ML","date":"2023-10-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ziqi-zhang/teeslice-artifact","path":"membership-inference/gol.py","file_url":"https://github.com/ziqi-zhang/teeslice-artifact/blob/HEAD/membership-inference/gol.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, ziqi-zhang/teeslice-artifact when it was checked","code_sha256":"840eea9045ad3fe6","code_sha256_prefix":"840eea9045ad3fe6","mcp_get_code":{"code_sha256":"840eea9045ad3fe6"}},{"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/private_watermark","path":"model_key.py","file_url":"https://github.com/THU-BPM/private_watermark/blob/HEAD/model_key.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, THU-BPM/private_watermark when it was checked","code_sha256":"3ccef01627eeebef","code_sha256_prefix":"3ccef01627eeebef","mcp_get_code":{"code_sha256":"3ccef01627eeebef"}},{"arxiv_id":"2307.04305","arxiv_id_is_arxiv":true,"paper":"/paper/automatic-piano-transcription-with","title":"Automatic Piano Transcription with Hierarchical Frequency-Time Transformer","date":"2023-07-10","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sony/hft-transformer","path":"corpus/make_list_maestro.py","file_url":"https://github.com/sony/hft-transformer/blob/HEAD/corpus/make_list_maestro.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":"70858cbea4821dd7","code_sha256_prefix":"70858cbea4821dd7","mcp_get_code":{"code_sha256":"70858cbea4821dd7"}},{"arxiv_id":"2204.13846","arxiv_id_is_arxiv":true,"paper":"/paper/rosa-a-robust-self-aligned-framework-for-node","title":"RoSA: A Robust Self-Aligned Framework for Node-Node Graph Contrastive Learning","date":"2022-04-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"ZhuYun97/RoSA","path":"model.py","file_url":"https://github.com/ZhuYun97/RoSA/blob/HEAD/model.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, ZhuYun97/RoSA when it was checked","code_sha256":"7c38fd3d3d187380","code_sha256_prefix":"7c38fd3d3d187380","mcp_get_code":{"code_sha256":"7c38fd3d3d187380"}},{"arxiv_id":"2109.02066","arxiv_id_is_arxiv":true,"paper":"/paper/hierarchical-object-to-zone-graph-for-object","title":"Hierarchical Object-to-Zone Graph for Object Navigation","date":"2021-09-05","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"sx-zhang/hoz","path":"gl.py","file_url":"https://github.com/sx-zhang/hoz/blob/HEAD/gl.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":"766ee7a843b09775","code_sha256_prefix":"766ee7a843b09775","mcp_get_code":{"code_sha256":"766ee7a843b09775"}},{"arxiv_id":"1806.04965","arxiv_id_is_arxiv":true,"paper":"/paper/the-streaming-rollout-of-deep-networks","title":"The streaming rollout of deep networks - towards fully model-parallel execution","date":"2018-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/statestream","path":"statestream/backends/backend_theano.py","file_url":"https://github.com/boschresearch/statestream/blob/HEAD/statestream/backends/backend_theano.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":"87df0e2f54903130","code_sha256_prefix":"87df0e2f54903130","mcp_get_code":{"code_sha256":"87df0e2f54903130"}},{"arxiv_id":"1806.04965","arxiv_id_is_arxiv":true,"paper":"/paper/the-streaming-rollout-of-deep-networks","title":"The streaming rollout of deep networks - towards fully model-parallel execution","date":"2018-06-13","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"boschresearch/statestream","path":"statestream/backends/backend_tensorflow.py","file_url":"https://github.com/boschresearch/statestream/blob/HEAD/statestream/backends/backend_tensorflow.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":"daebb218663a3f81","code_sha256_prefix":"daebb218663a3f81","mcp_get_code":{"code_sha256":"daebb218663a3f81"}},{"arxiv_id":"1604.06174","arxiv_id_is_arxiv":true,"paper":"/paper/training-deep-nets-with-sublinear-memory-cost","title":"Training Deep Nets with Sublinear Memory Cost","date":"2016-04-21","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"AD1024/torch-checkpointing","path":"utils/checkpointing.py","file_url":"https://github.com/AD1024/torch-checkpointing/blob/HEAD/utils/checkpointing.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, AD1024/torch-checkpointing when it was checked","code_sha256":"c4d2c5b1e6baa881","code_sha256_prefix":"c4d2c5b1e6baa881","mcp_get_code":{"code_sha256":"c4d2c5b1e6baa881"}},{"arxiv_id":"ijcai2024_0715","arxiv_id_is_arxiv":false,"paper":null,"title":"IJCAI id ijcai2024_0715","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"LightChen233/DPF","path":"common/global_pool.py","file_url":"https://github.com/LightChen233/DPF/blob/HEAD/common/global_pool.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 lhy-zjut/cfmw, and AGPL-3.0, as GitHub detects it on that repository, is not in the permissive set Syntology serves inline","code_sha256":"7f938e0da00ca908","code_sha256_prefix":"7f938e0da00ca908","mcp_get_code":{"code_sha256":"7f938e0da00ca908"}}],"record_sha256":"f8aefade1857d5c9d6f80ca37d7f560408416d8d2b2ccbdb4652bf62897cbcd3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}