{"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-layer-id","entry":"get_layer_id","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":7,"n_papers_ran":7,"n_papers_ran_no_instrument_failure":6,"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":5,"n_samples_ran":5,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":1,"n_samples_unverified":0,"n_samples_fingerprinted":4,"n_places":7,"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":1,"ran_violates":0,"ran_draft_wrong":1,"ran_fixture":0,"ran":3,"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":"2605.20247","arxiv_id_is_arxiv":true,"paper":"/paper/arxiv-2605-20247","title":"CP-MoE: Consistency-Preserving Mixture-of-Experts for Continual Learning","date":null,"month_inferred_from_arxiv_id":"2026-05","title_source":"syntology","repo":"YangLiu-Lewis/CP-MoE","path":"routing_count.py","file_url":"https://github.com/YangLiu-Lewis/CP-MoE/blob/HEAD/routing_count.py","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":null,"behaviour_fingerprint":true,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"b4c262eef66c401f","code_sha256_prefix":"b4c262eef66c401f","mcp_get_code":{"code_sha256":"b4c262eef66c401f"}},{"arxiv_id":"2402.19298","arxiv_id_is_arxiv":true,"paper":"/paper/suppress-and-rebalance-towards-generalized","title":"Suppress and Rebalance: Towards Generalized Multi-Modal Face Anti-Spoofing","date":"2024-02-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"OMGGGGG/mmdg","path":"models/regrad.py","file_url":"https://github.com/OMGGGGG/mmdg/blob/HEAD/models/regrad.py","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","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, OMGGGGG/mmdg when it was checked","code_sha256":"794249d6d669af7a","code_sha256_prefix":"794249d6d669af7a","mcp_get_code":{"code_sha256":"794249d6d669af7a"}},{"arxiv_id":"2310.14747","arxiv_id_is_arxiv":true,"paper":"/paper/mcc-kd-multi-cot-consistent-knowledge","title":"MCC-KD: Multi-CoT Consistent Knowledge Distillation","date":"2023-10-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"homzer/MCC-KD","path":"src/checkpoint.py","file_url":"https://github.com/homzer/MCC-KD/blob/HEAD/src/checkpoint.py","status":"ran","verification_level":1,"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, homzer/MCC-KD when it was checked","code_sha256":"24ed0ef7f8b7dd50","code_sha256_prefix":"24ed0ef7f8b7dd50","mcp_get_code":{"code_sha256":"24ed0ef7f8b7dd50"}},{"arxiv_id":"2002.06757","arxiv_id_is_arxiv":true,"paper":"/paper/entity-context-and-relational-paths-for","title":"Relational Message Passing for Knowledge Graph Completion","date":"2020-02-17","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwwang55/PathCon","path":"src/aggregators.py","file_url":"https://github.com/hwwang55/PathCon/blob/HEAD/src/aggregators.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":"fc9ffc41618b3fd4","code_sha256_prefix":"fc9ffc41618b3fd4","mcp_get_code":{"code_sha256":"fc9ffc41618b3fd4"}},{"arxiv_id":"1905.04413","arxiv_id_is_arxiv":true,"paper":"/paper/knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"YuTesla/KGNN-LS-learn","path":"src/aggregators.py","file_url":"https://github.com/YuTesla/KGNN-LS-learn/blob/HEAD/src/aggregators.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":"df1bf46ed02ef952","code_sha256_prefix":"df1bf46ed02ef952","mcp_get_code":{"code_sha256":"df1bf46ed02ef952"}},{"arxiv_id":"1904.12575","arxiv_id_is_arxiv":true,"paper":"/paper/190412575","title":"Knowledge Graph Convolutional Networks for Recommender Systems","date":"2019-03-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwwang55/KGCN","path":"src/aggregators.py","file_url":"https://github.com/hwwang55/KGCN/blob/HEAD/src/aggregators.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":"df1bf46ed02ef952","code_sha256_prefix":"df1bf46ed02ef952","mcp_get_code":{"code_sha256":"df1bf46ed02ef952"}},{"arxiv_id":"1901.08907","arxiv_id_is_arxiv":true,"paper":"/paper/multi-task-feature-learning-for-knowledge","title":"Multi-Task Feature Learning for Knowledge Graph Enhanced Recommendation","date":"2019-01-23","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"hwwang55/MKR","path":"src/layers.py","file_url":"https://github.com/hwwang55/MKR/blob/HEAD/src/layers.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":"df1bf46ed02ef952","code_sha256_prefix":"df1bf46ed02ef952","mcp_get_code":{"code_sha256":"df1bf46ed02ef952"}}],"record_sha256":"52ebb195958e732b2938548e217562cad23ff7a02c0698dab027e11ad79b29d3","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}