{"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":"/task/graph-structure-learning/papers/ran/1","list_of":"/task/graph-structure-learning","task":"Graph structure learning","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_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_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_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":1,"pages_in_order":1,"rows_per_page":100,"rows":[1,22],"of":22,"counts":{"archive_papers_tagged":132,"with_a_code_link":71,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":132,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":17,"every_run_a_failure_of_syntologys_instrument":5,"listed_with_a_run_with_no_instrument_failure":17,"listed_every_run_a_failure_of_syntologys_instrument":5,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/graph-structure-learning/papers/ran/1","prev":null,"next":null,"papers":[{"url":"/paper/grape-heterogeneous-graph-representation","slug":"grape-heterogeneous-graph-representation","title":"GRAPE: Heterogeneous Graph Representation Learning for Genetic Perturbation with Coding and Non-Coding Biotype","date":"2025-05-06","arxiv_id":"2505.03853","repositories_listed":0,"syntology":{"n":2,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/grape-heterogeneous-graph-representation#ran","syntology_url":"https://syntology.ai/paper/2505.03853","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2505.03853"}},"official":null}},{"url":"/paper/dg-mamba-robust-and-efficient-dynamic-graph","slug":"dg-mamba-robust-and-efficient-dynamic-graph","title":"DG-Mamba: Robust and Efficient Dynamic Graph Structure Learning with Selective State Space Models","date":"2024-12-11","arxiv_id":"2412.08160","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/dg-mamba-robust-and-efficient-dynamic-graph#ran","syntology_url":"https://syntology.ai/paper/2412.08160","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2412.08160"}},"official":{"repos":["RingBDStack/DG-Mamba"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/beyond-redundancy-information-aware","slug":"beyond-redundancy-information-aware","title":"Beyond Redundancy: Information-aware Unsupervised Multiplex Graph Structure Learning","date":"2024-09-25","arxiv_id":"2409.17386","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":3,"n_instrument":2,"n_unverified":5,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":10,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/beyond-redundancy-information-aware#ran","syntology_url":"https://syntology.ai/paper/2409.17386","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.17386"}},"official":{"repos":["zxlearningdeep/infomgf"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-latent-graph-structures-and-their","slug":"learning-latent-graph-structures-and-their","title":"Learning Latent Graph Structures and their Uncertainty","date":"2024-05-30","arxiv_id":"2405.19933","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-latent-graph-structures-and-their#ran","syntology_url":"https://syntology.ai/paper/2405.19933","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.19933"}},"official":{"repos":["allemanenti/Learning-Calibrated-Structures"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/gslb-the-graph-structure-learning-benchmark-1","slug":"gslb-the-graph-structure-learning-benchmark-1","title":"GSLB: The Graph Structure Learning Benchmark","date":"2023-10-08","arxiv_id":"2310.05174","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/gslb-the-graph-structure-learning-benchmark-1#ran","syntology_url":"https://syntology.ai/paper/2310.05174","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2310.05174"}},"official":{"repos":["gsl-benchmark/gslb"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/homophily-enhanced-structure-learning-for","slug":"homophily-enhanced-structure-learning-for","title":"Homophily-enhanced Structure Learning for Graph Clustering","date":"2023-08-10","arxiv_id":"2308.05309","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/homophily-enhanced-structure-learning-for#ran","syntology_url":"https://syntology.ai/paper/2308.05309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2308.05309"}},"official":{"repos":["galogm/hole"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graphglow-universal-and-generalizable","slug":"graphglow-universal-and-generalizable","title":"GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural Networks","date":"2023-06-20","arxiv_id":"2306.11264","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/graphglow-universal-and-generalizable#ran","syntology_url":"https://syntology.ai/paper/2306.11264","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.11264"}},"official":{"repos":["wtaozhao/graphglow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/opengsl-a-comprehensive-benchmark-for-graph","slug":"opengsl-a-comprehensive-benchmark-for-graph","title":"OpenGSL: A Comprehensive Benchmark for Graph Structure Learning","date":"2023-06-17","arxiv_id":"2306.10280","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/opengsl-a-comprehensive-benchmark-for-graph#ran","syntology_url":"https://syntology.ai/paper/2306.10280","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.10280"}},"official":{"repos":["opengsl/opengsl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/nodeformer-a-scalable-graph-structure","slug":"nodeformer-a-scalable-graph-structure","title":"NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification","date":"2023-06-14","arxiv_id":"2306.08385","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/nodeformer-a-scalable-graph-structure#ran","syntology_url":"https://syntology.ai/paper/2306.08385","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.08385"}},"official":{"repos":["qitianwu/nodeformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/se-gsl-a-general-and-effective-graph","slug":"se-gsl-a-general-and-effective-graph","title":"SE-GSL: A General and Effective Graph Structure Learning Framework through Structural Entropy Optimization","date":"2023-03-17","arxiv_id":"2303.09778","repositories_listed":2,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/se-gsl-a-general-and-effective-graph#ran","syntology_url":"https://syntology.ai/paper/2303.09778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2303.09778"}},"official":{"repos":["ringbdstack/se-gsl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/spatiotemporal-modeling-of-multivariate","slug":"spatiotemporal-modeling-of-multivariate","title":"Modeling Multivariate Biosignals With Graph Neural Networks and Structured State Space Models","date":"2022-11-21","arxiv_id":"2211.11176","repositories_listed":1,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/spatiotemporal-modeling-of-multivariate#ran","syntology_url":"https://syntology.ai/paper/2211.11176","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.11176"}},"official":{"repos":["tsy935/graphs4mer"],"state":"official (archive's flag): 11 ran","n_ran":11,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/pygsl-a-graph-structure-learning-toolkit","slug":"pygsl-a-graph-structure-learning-toolkit","title":"pyGSL: A Graph Structure Learning Toolkit","date":"2022-11-07","arxiv_id":"2211.03583","repositories_listed":1,"syntology":{"n":11,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/pygsl-a-graph-structure-learning-toolkit#ran","syntology_url":"https://syntology.ai/paper/2211.03583","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2211.03583"}},"official":{"repos":["maxwass/pygsl"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/regularized-graph-structure-learning-with","slug":"regularized-graph-structure-learning-with","title":"Regularized Graph Structure Learning with Semantic Knowledge for Multi-variates Time-Series Forecasting","date":"2022-10-12","arxiv_id":"2210.06126","repositories_listed":1,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":4,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/regularized-graph-structure-learning-with#ran","syntology_url":"https://syntology.ai/paper/2210.06126","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.06126"}},"official":{"repos":["alipay/rgsl"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/robust-graph-structure-learning-over-images","slug":"robust-graph-structure-learning-over-images","title":"Robust Graph Structure Learning via Multiple Statistical Tests","date":"2022-10-08","arxiv_id":"2210.03956","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/robust-graph-structure-learning-over-images#ran","syntology_url":"https://syntology.ai/paper/2210.03956","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2210.03956"}},"official":{"repos":["thomas-wyh/b-attention"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/dbgsl-dynamic-brain-graph-structure-learning","slug":"dbgsl-dynamic-brain-graph-structure-learning","title":"DynDepNet: Learning Time-Varying Dependency Structures from fMRI Data via Dynamic Graph Structure Learning","date":"2022-09-27","arxiv_id":"2209.13513","repositories_listed":2,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/dbgsl-dynamic-brain-graph-structure-learning#ran","syntology_url":"https://syntology.ai/paper/2209.13513","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2209.13513"}},"official":{"repos":["Kaleidophon/deep-significance"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/position-aware-structure-learning-for-graph","slug":"position-aware-structure-learning-for-graph","title":"Position-aware Structure Learning for Graph Topology-imbalance by Relieving Under-reaching and Over-squashing","date":"2022-08-17","arxiv_id":"2208.08302","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/position-aware-structure-learning-for-graph#ran","syntology_url":"https://syntology.ai/paper/2208.08302","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2208.08302"}},"official":{"repos":["ringbdstack/pastel"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/boosting-graph-structure-learning-with-dummy","slug":"boosting-graph-structure-learning-with-dummy","title":"Boosting Graph Structure Learning with Dummy Nodes","date":"2022-06-17","arxiv_id":"2206.08561","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/boosting-graph-structure-learning-with-dummy#ran","syntology_url":"https://syntology.ai/paper/2206.08561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.08561"}},"official":{"repos":["hkust-knowcomp/dummynode4graphlearning"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/mining-fine-grained-semantics-via-graph","slug":"mining-fine-grained-semantics-via-graph","title":"Evidence-aware Fake News Detection with Graph Neural Networks","date":"2022-01-18","arxiv_id":"2201.06885","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/mining-fine-grained-semantics-via-graph#ran","syntology_url":"https://syntology.ai/paper/2201.06885","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.06885"}},"official":{"repos":["CRIPAC-DIG/GET"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/towards-unsupervised-deep-graph-structure","slug":"towards-unsupervised-deep-graph-structure","title":"Towards Unsupervised Deep Graph Structure Learning","date":"2022-01-17","arxiv_id":"2201.06367","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":2,"n_pointer_only":4,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 1 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/towards-unsupervised-deep-graph-structure#ran","syntology_url":"https://syntology.ai/paper/2201.06367","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2201.06367"}},"official":{"repos":["grand-lab/sublime"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/discrete-graph-structure-learning-for-1","slug":"discrete-graph-structure-learning-for-1","title":"Discrete Graph Structure Learning for Forecasting Multiple Time Series","date":"2021-01-18","arxiv_id":"2101.06861","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/discrete-graph-structure-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2101.06861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.06861"}},"official":{"repos":["chaoshangcs/GTS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/node-classification-on-graphs-with-few-shot","slug":"node-classification-on-graphs-with-few-shot","title":"Node Classification on Graphs with Few-Shot Novel Labels via Meta Transformed Network Embedding","date":"2020-07-06","arxiv_id":"2007.02914","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/node-classification-on-graphs-with-few-shot#ran","syntology_url":"https://syntology.ai/paper/2007.02914","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02914"}},"official":{"repos":["llan-ml/MetaTNE"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graphflow-exploiting-conversation-flow-with","slug":"graphflow-exploiting-conversation-flow-with","title":"GraphFlow: Exploiting Conversation Flow with Graph Neural Networks for Conversational Machine Comprehension","date":"2019-07-31","arxiv_id":"1908.00059","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/graphflow-exploiting-conversation-flow-with#ran","syntology_url":"https://syntology.ai/paper/1908.00059","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.00059"}},"official":{"repos":["hugochan/GraphFlow"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}}],"record_sha256":"04f460355fc1584f140668740fdcac94a4461377ae2f2ffb421591e6adc3a5c9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}