{"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/load-graphs","entry":"load_graphs","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":4,"n_papers_ran_no_instrument_failure":4,"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":7,"n_samples_ran":4,"n_samples_constructed":0,"n_samples_ran_checked":4,"n_samples_instrument":0,"n_samples_unverified":3,"n_samples_fingerprinted":1,"n_places":7,"n_places_pointer_only":3,"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":4,"unverified":3},"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.14901","arxiv_id_is_arxiv":true,"paper":"/paper/a-usage-centric-take-on-intent-understanding","title":"A Usage-centric Take on Intent Understanding in E-Commerce","date":"2024-02-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"stayones/Usgae-Centric-Intent-Understanding","path":"evaluate_ecc_graphs_utils.py","file_url":"https://github.com/stayones/Usgae-Centric-Intent-Understanding/blob/HEAD/evaluate_ecc_graphs_utils.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, stayones/Usgae-Centric-Intent-Understanding when it was checked","code_sha256":"573c92c32b308b5a","code_sha256_prefix":"573c92c32b308b5a","mcp_get_code":{"code_sha256":"573c92c32b308b5a"}},{"arxiv_id":"2401.03194","arxiv_id_is_arxiv":true,"paper":"/paper/learning-persistent-community-structures-in","title":"Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis","date":"2024-01-06","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"kundtx/MFC-TopoReg","path":"Code/dataloader.py","file_url":"https://github.com/kundtx/MFC-TopoReg/blob/HEAD/Code/dataloader.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, kundtx/MFC-TopoReg when it was checked","code_sha256":"600236d629240527","code_sha256_prefix":"600236d629240527","mcp_get_code":{"code_sha256":"600236d629240527"}},{"arxiv_id":"2311.11114","arxiv_id_is_arxiv":true,"paper":"/paper/environment-aware-dynamic-graph-learning-for-1","title":"Environment-Aware Dynamic Graph Learning for Out-of-Distribution Generalization","date":"2023-11-18","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"FeiGSSS/DySAT_pytorch","path":"utils/preprocess.py","file_url":"https://github.com/FeiGSSS/DySAT_pytorch/blob/HEAD/utils/preprocess.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, FeiGSSS/DySAT_pytorch when it was checked","code_sha256":"c15dd381ad4028d7","code_sha256_prefix":"c15dd381ad4028d7","mcp_get_code":{"code_sha256":"c15dd381ad4028d7"}},{"arxiv_id":"2208.10227","arxiv_id_is_arxiv":true,"paper":"/paper/one-model-any-csp-graph-neural-networks-as","title":"One Model, Any CSP: Graph Neural Networks as Fast Global Search Heuristics for Constraint Satisfaction","date":"2022-08-22","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"toenshoff/runcsp-pytorch","path":"data_utils.py","file_url":"https://github.com/toenshoff/runcsp-pytorch/blob/HEAD/data_utils.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":"80f967339c97fa8d","code_sha256_prefix":"80f967339c97fa8d","mcp_get_code":{"code_sha256":"80f967339c97fa8d"}},{"arxiv_id":"2106.01098","arxiv_id_is_arxiv":true,"paper":"/paper/evaluation-metrics-for-graph-generative","title":"Evaluation Metrics for Graph Generative Models: Problems, Pitfalls, and Practical Solutions","date":"2021-06-02","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"borgwardtlab/ggme","path":"src/utils.py","file_url":"https://github.com/borgwardtlab/ggme/blob/HEAD/src/utils.py","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"BSD-3-Clause","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"code_sha256":"7253629098c52c80","code_sha256_prefix":"7253629098c52c80","mcp_get_code":{"code_sha256":"7253629098c52c80"}},{"arxiv_id":"2005.07959","arxiv_id_is_arxiv":true,"paper":"/paper/characteristic-functions-on-graphs-birds-of-a","title":"Characteristic Functions on Graphs: Birds of a Feather, from Statistical Descriptors to Parametric Models","date":"2020-05-16","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"benedekrozemberczki/FEATHER","path":"src/utils.py","file_url":"https://github.com/benedekrozemberczki/FEATHER/blob/HEAD/src/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":"91ef6bf33aa4c073","code_sha256_prefix":"91ef6bf33aa4c073","mcp_get_code":{"code_sha256":"91ef6bf33aa4c073"}},{"arxiv_id":"1910.13445","arxiv_id_is_arxiv":true,"paper":"/paper/g2sat-learning-to-generate-sat-formulas","title":"G2SAT: Learning to Generate SAT Formulas","date":"2019-10-29","month_inferred_from_arxiv_id":null,"title_source":"archive","repo":"JiaxuanYou/G2SAT","path":"eval/conversion.py","file_url":"https://github.com/JiaxuanYou/G2SAT/blob/HEAD/eval/conversion.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":"ff29d7ef03eb44d6","code_sha256_prefix":"ff29d7ef03eb44d6","mcp_get_code":{"code_sha256":"ff29d7ef03eb44d6"}}],"record_sha256":"fdcb45265755f12f33db1915042efd8c91d8c2517e857eb8137c0436be2051d3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}