{"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-classification/papers/10","list_of":"/task/graph-classification","task":"Graph Classification","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":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":10,"pages_in_order":10,"rows_per_page":100,"rows":[901,927],"of":927,"counts":{"archive_papers_tagged":927,"with_a_code_link":483,"where_syntology_ran_a_sample":174,"not_listed_spam_title":0,"listed":927,"listed_where_code_ran":174,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":150,"every_run_a_failure_of_syntologys_instrument":24,"listed_with_a_run_with_no_instrument_failure":150,"listed_every_run_a_failure_of_syntologys_instrument":24,"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-classification","prev":"/task/graph-classification/papers/9","next":null,"papers":[{"url":null,"slug":"graph-convolutional-neural-networks-based-on","title":"Graph Convolutional Neural Networks based on Quantum Vertex Saliency","date":"2018-09-04","arxiv_id":"1809.01090","repositories_listed":0,"syntology":null},{"url":"/paper/when-work-matters-transforming-classical","slug":"when-work-matters-transforming-classical","title":"When Work Matters: Transforming Classical Network Structures to Graph CNN","date":"2018-07-07","arxiv_id":"1807.02653","repositories_listed":0,"syntology":null},{"url":null,"slug":"change-point-methods-on-a-sequence-of-graphs","title":"Change Point Methods on a Sequence of Graphs","date":"2018-05-18","arxiv_id":"1805.07113","repositories_listed":0,"syntology":null},{"url":null,"slug":"walk-steered-convolution-for-graph","title":"Walk-Steered Convolution for Graph Classification","date":"2018-04-16","arxiv_id":"1804.05837","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-graph-convolutional-neural-nets","title":"Kernel Graph Convolutional Neural Nets","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/dgcnn-disordered-graph-convolutional-neural","slug":"dgcnn-disordered-graph-convolutional-neural","title":"DGCNN: Disordered Graph Convolutional Neural Network Based on the Gaussian Mixture Model","date":"2017-12-10","arxiv_id":"1712.03563","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-graph-attention-model","title":"Deep Graph Attention Model","date":"2017-09-15","arxiv_id":"1709.06075","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-classification-via-deep-learning-with","title":"Graph Classification via Deep Learning with Virtual Nodes","date":"2017-08-14","arxiv_id":"1708.04357","repositories_listed":0,"syntology":null},{"url":"/paper/graph-classification-with-2d-convolutional","slug":"graph-classification-with-2d-convolutional","title":"Graph Classification with 2D Convolutional Neural Networks","date":"2017-07-29","arxiv_id":"1708.02218","repositories_listed":0,"syntology":null},{"url":"/paper/sliced-wasserstein-kernel-for-persistence","slug":"sliced-wasserstein-kernel-for-persistence","title":"Sliced Wasserstein Kernel for Persistence Diagrams","date":"2017-06-11","arxiv_id":"1706.03358","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamics-based-features-for-graph","title":"Dynamics Based Features For Graph Classification","date":"2017-05-30","arxiv_id":"1705.10817","repositories_listed":0,"syntology":null},{"url":null,"slug":"shift-aggregate-extract-networks","title":"Shift Aggregate Extract Networks","date":"2017-03-16","arxiv_id":"1703.05537","repositories_listed":0,"syntology":null},{"url":"/paper/on-valid-optimal-assignment-kernels-and","slug":"on-valid-optimal-assignment-kernels-and","title":"On Valid Optimal Assignment Kernels and Applications to Graph Classification","date":"2016-06-03","arxiv_id":"1606.01141","repositories_listed":0,"syntology":null},{"url":"/paper/the-multiscale-laplacian-graph-kernel","slug":"the-multiscale-laplacian-graph-kernel","title":"The Multiscale Laplacian Graph Kernel","date":"2016-03-20","arxiv_id":"1603.06186","repositories_listed":0,"syntology":null},{"url":null,"slug":"halting-in-random-walk-kernels","title":"Halting in Random Walk Kernels","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"generalized-shortest-path-kernel-on-graphs","title":"Generalized Shortest Path Kernel on Graphs","date":"2015-10-22","arxiv_id":"1510.06492","repositories_listed":0,"syntology":null},{"url":null,"slug":"mining-brain-networks-using-multiple-side","title":"Mining Brain Networks using Multiple Side Views for Neurological Disorder Identification","date":"2015-08-19","arxiv_id":"1508.04554","repositories_listed":0,"syntology":null},{"url":"/paper/deep-graph-kernels","slug":"deep-graph-kernels","title":"Deep Graph Kernels","date":"2015-08-10","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/graph-invariant-kernels","slug":"graph-invariant-kernels","title":"Graph Invariant Kernels","date":"2015-07-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"extending-local-features-with-contextual","title":"Extending local features with contextual information in graph kernels","date":"2015-07-08","arxiv_id":"1507.02186","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-categorization-as-a-graph-classification","title":"Text Categorization as a Graph Classification Problem","date":"2015-07-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"graphs-in-machine-learning-an-introduction","title":"Graphs in machine learning: an introduction","date":"2015-06-23","arxiv_id":"1506.06962","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphlet-based-lazy-associative-graph","title":"Graphlet-based lazy associative graph classification","date":"2015-04-21","arxiv_id":"1504.05457","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-kernels-via-functional-embedding","title":"Graph Kernels via Functional Embedding","date":"2014-04-21","arxiv_id":"1404.5214","repositories_listed":0,"syntology":null},{"url":null,"slug":"planning-by-case-based-reasoning-based-on","title":"Planning by case-based reasoning based on fuzzy logic","date":"2013-11-18","arxiv_id":"1311.4564","repositories_listed":0,"syntology":null},{"url":"/paper/efficient-graphlet-kernels-for-large-graph","slug":"efficient-graphlet-kernels-for-large-graph","title":"Efficient graphlet kernels for large graph comparison","date":"2009-04-16","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":"/paper/distinguishing-enzyme-structures-from-non","slug":"distinguishing-enzyme-structures-from-non","title":"Distinguishing Enzyme Structures from Non-enzymes Without Alignments","date":"2003-07-18","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"81bdc82021d41a09a6ce7647507e24175775b7ff145522376005fd8720f9996e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}