{"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-default-config","entry":"get_default_config","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":6,"n_papers_ran":3,"n_papers_ran_no_instrument_failure":2,"n_papers_ran_instrument_only":1,"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":4,"n_samples_constructed":0,"n_samples_ran_checked":2,"n_samples_instrument":2,"n_samples_unverified":4,"n_samples_fingerprinted":0,"n_places":8,"n_places_pointer_only":2,"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":2,"unverified":4},"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":"2603.26595","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2603-26595","title":"PQuantML: A Tool for End-to-End Hardware-Aware Model Compression","date":null,"month_inferred_from_arxiv_id":"2026-03","title_source":"syntology","repo":"cern-nextgen/PQuantML","path":"src/pquant/core/utils.py","file_url":"https://github.com/cern-nextgen/PQuantML/blob/HEAD/src/pquant/core/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":"13bb3cd054b6e480","code_sha256_prefix":"13bb3cd054b6e480","mcp_get_code":{"code_sha256":"13bb3cd054b6e480"}},{"arxiv_id":"2510.13887","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-13887","title":"Incomplete Multi-view Clustering via Hierarchical Semantic Alignment and Cooperative Completion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"XiaojianDing/2025-NeurIPS-HSACC","path":"configure/configure.py","file_url":"https://github.com/XiaojianDing/2025-NeurIPS-HSACC/blob/HEAD/configure/configure.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, XiaojianDing/2025-NeurIPS-HSACC when it was checked","code_sha256":"4ca03dcbfbb5cf4a","code_sha256_prefix":"4ca03dcbfbb5cf4a","mcp_get_code":{"code_sha256":"4ca03dcbfbb5cf4a"}},{"arxiv_id":"2510.13887","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2510-13887","title":"Incomplete Multi-view Clustering via Hierarchical Semantic Alignment and Cooperative Completion","date":null,"month_inferred_from_arxiv_id":"2025-10","title_source":"syntology","repo":"XiaojianDing/2025-NeurIPS-HSACC","path":"configure/configure_multiview.py","file_url":"https://github.com/XiaojianDing/2025-NeurIPS-HSACC/blob/HEAD/configure/configure_multiview.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, XiaojianDing/2025-NeurIPS-HSACC when it was checked","code_sha256":"bdd0511b842e1a45","code_sha256_prefix":"bdd0511b842e1a45","mcp_get_code":{"code_sha256":"bdd0511b842e1a45"}},{"arxiv_id":"2504.01955","arxiv_id_is_arxiv":true,"paper":"/paper/scene-centric-unsupervised-panoptic","title":"Scene-Centric Unsupervised Panoptic Segmentation","date":"2025-04-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"visinf/cups","path":"cups/config.py","file_url":"https://github.com/visinf/cups/blob/HEAD/cups/config.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":"42ac537df132d369","code_sha256_prefix":"42ac537df132d369","mcp_get_code":{"code_sha256":"42ac537df132d369"}},{"arxiv_id":"2312.12728","arxiv_id_is_arxiv":true,"paper":"/paper/lookahead-an-inference-acceleration-framework","title":"Lookahead: An Inference Acceleration Framework for Large Language Model with Lossless Generation Accuracy","date":"2023-12-20","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alipay/PainlessInferenceAcceleration","path":"flood/flood/layers/moe.py","file_url":"https://github.com/alipay/PainlessInferenceAcceleration/blob/HEAD/flood/flood/layers/moe.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":"4f107abe0791e53d","code_sha256_prefix":"4f107abe0791e53d","mcp_get_code":{"code_sha256":"4f107abe0791e53d"}},{"arxiv_id":"2301.11045","arxiv_id_is_arxiv":true,"paper":"/paper/incomplete-multi-view-clustering-via","title":"Incomplete Multi-view Clustering via Prototype-based Imputation","date":"2023-01-26","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XLearning-SCU/2023-IJCAI-ProImp","path":"configure.py","file_url":"https://github.com/XLearning-SCU/2023-IJCAI-ProImp/blob/HEAD/configure.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":"ed5918b10e7b527e","code_sha256_prefix":"ed5918b10e7b527e","mcp_get_code":{"code_sha256":"ed5918b10e7b527e"}},{"arxiv_id":"2006.10637","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-graph-networks-for-deep-learning-on","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"jasperzhong/GNNFlow","path":"gnnflow/config.py","file_url":"https://github.com/jasperzhong/GNNFlow/blob/HEAD/gnnflow/config.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":"2abeac7066079ca7","code_sha256_prefix":"2abeac7066079ca7","mcp_get_code":{"code_sha256":"2abeac7066079ca7"}},{"arxiv_id":"2006.10637","arxiv_id_is_arxiv":true,"paper":"/paper/temporal-graph-networks-for-deep-learning-on","title":"Temporal Graph Networks for Deep Learning on Dynamic Graphs","date":"2020-06-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"petersh6/mspipe","path":"gnnflow/config.py","file_url":"https://github.com/petersh6/mspipe/blob/HEAD/gnnflow/config.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":"61d785f64b05116b","code_sha256_prefix":"61d785f64b05116b","mcp_get_code":{"code_sha256":"61d785f64b05116b"}}],"record_sha256":"8218e6ae366c630fc66276ee5a0c4844b4a07fb67e6194673cd7f3ab35c90e12","record_changed_at":"2026-10-04","record_changed_at_basis":"changed"}