{"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/config-logger","entry":"config_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":7,"n_papers_ran":1,"n_papers_ran_no_instrument_failure":1,"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":6,"n_samples_ran":1,"n_samples_constructed":0,"n_samples_ran_checked":1,"n_samples_instrument":0,"n_samples_unverified":5,"n_samples_fingerprinted":0,"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":0,"ran_violates":0,"ran_draft_wrong":0,"ran_fixture":0,"ran":1,"unverified":5},"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":"2402.06087","arxiv_id_is_arxiv":true,"paper":"/paper/descriptive-kernel-convolution-network-with","title":"Descriptive Kernel Convolution Network with Improved Random Walk Kernel","date":"2024-02-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"mengchillee/rwk_plus","path":"sec_5_2_RWKPConv/core/log.py","file_url":"https://github.com/mengchillee/rwk_plus/blob/HEAD/sec_5_2_RWKPConv/core/log.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, mengchillee/rwk_plus when it was checked","code_sha256":"2f8645f8a7410fb1","code_sha256_prefix":"2f8645f8a7410fb1","mcp_get_code":{"code_sha256":"2f8645f8a7410fb1"}},{"arxiv_id":"2312.04234","arxiv_id_is_arxiv":true,"paper":"/paper/graph-convolutions-enrich-the-self-attention","title":"Graph Convolutions Enrich the Self-Attention in Transformers!","date":"2023-12-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"XiaoxinHe/Graph-ViT-MLPMixer","path":"core/log.py","file_url":"https://github.com/XiaoxinHe/Graph-ViT-MLPMixer/blob/HEAD/core/log.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":"7a15a3fa5bfa6eab","code_sha256_prefix":"7a15a3fa5bfa6eab","mcp_get_code":{"code_sha256":"7a15a3fa5bfa6eab"}},{"arxiv_id":"2310.02579","arxiv_id_is_arxiv":true,"paper":"/paper/on-the-stability-of-expressive-positional","title":"On the Stability of Expressive Positional Encodings for Graphs","date":"2023-10-04","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"cptq/SignNet-BasisNet","path":"GINESignNetPyG/core/log.py","file_url":"https://github.com/cptq/SignNet-BasisNet/blob/HEAD/GINESignNetPyG/core/log.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":"cd645dde3a50c04c","code_sha256_prefix":"cd645dde3a50c04c","mcp_get_code":{"code_sha256":"cd645dde3a50c04c"}},{"arxiv_id":"2309.16014","arxiv_id_is_arxiv":true,"paper":"/paper/graph-level-representation-learning-with","title":"Graph-level Representation Learning with Joint-Embedding Predictive Architectures","date":"2023-09-27","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"geriskenderi/graph-jepa","path":"core/log.py","file_url":"https://github.com/geriskenderi/graph-jepa/blob/HEAD/core/log.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":"7a15a3fa5bfa6eab","code_sha256_prefix":"7a15a3fa5bfa6eab","mcp_get_code":{"code_sha256":"7a15a3fa5bfa6eab"}},{"arxiv_id":"2110.03753","arxiv_id_is_arxiv":true,"paper":"/paper/from-stars-to-subgraphs-uplifting-any-gnn","title":"From Stars to Subgraphs: Uplifting Any GNN with Local Structure Awareness","date":"2021-10-07","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"GNNAsKernel/GNNAsKernel","path":"core/log.py","file_url":"https://github.com/GNNAsKernel/GNNAsKernel/blob/HEAD/core/log.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":"c04724063899461e","code_sha256_prefix":"c04724063899461e","mcp_get_code":{"code_sha256":"c04724063899461e"}},{"arxiv_id":"1708.02551","arxiv_id_is_arxiv":true,"paper":"/paper/semantic-instance-segmentation-with-a","title":"Semantic Instance Segmentation with a Discriminative Loss Function","date":"2017-08-08","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"alicranck/instance-seg","path":"config.py","file_url":"https://github.com/alicranck/instance-seg/blob/HEAD/config.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, alicranck/instance-seg when it was checked","code_sha256":"7f13f9caa2722e71","code_sha256_prefix":"7f13f9caa2722e71","mcp_get_code":{"code_sha256":"7f13f9caa2722e71"}},{"arxiv_id":"aaai_26541","arxiv_id_is_arxiv":false,"paper":null,"title":"AAAI id aaai_26541","date":null,"month_inferred_from_arxiv_id":null,"title_source":null,"repo":"senticnet/SKIER","path":"prepare_glove.py","file_url":"https://github.com/senticnet/SKIER/blob/HEAD/prepare_glove.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":"04c547199f2b0401","code_sha256_prefix":"04c547199f2b0401","mcp_get_code":{"code_sha256":"04c547199f2b0401"}}],"record_sha256":"e7f040dcf725cbd215ac5e594c0393cc8f07d60f034e1514938efed3b8f57b2f","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}