{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IGDZWGLLPEBLZYYB3MUYISPM4J","short_pith_number":"pith:IGDZWGLL","schema_version":"1.0","canonical_sha256":"41879b196b7902bce301db298449ece252915e1b65992d219232a144d70e33d9","source":{"kind":"arxiv","id":"1811.03508","version":3},"attestation_state":"computed","paper":{"title":"A simple yet effective baseline for non-attributed graph classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Cai, Yusu Wang","submitted_at":"2018-11-08T15:53:37Z","abstract_excerpt":"Graphs are complex objects that do not lend themselves easily to typical learning tasks. Recently, a range of approaches based on graph kernels or graph neural networks have been developed for graph classification and for representation learning on graphs in general. As the developed methodologies become more sophisticated, it is important to understand which components of the increasingly complex methods are necessary or most effective.\n  As a first step, we develop a simple yet meaningful graph representation, and explore its effectiveness in graph classification. We test our baseline repres"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1811.03508","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2018-11-08T15:53:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"cb16cdf95cf92d42debc9a343711de226267e9ee69058608cf952eb81278c878","abstract_canon_sha256":"a66bfd427b94b45c6f8e66bbcde1a80a8634b6f1c9678fa2b9a2f3886d24d10f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:24:20.138243Z","signature_b64":"EbtfGxA2Qk05p6EcxTFZCP9gmrgt3RGN5a1pkq7zIy+X5x/b63s1kIFIZwPmDaPvlPWlzcPRr913xVcDJPDvDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41879b196b7902bce301db298449ece252915e1b65992d219232a144d70e33d9","last_reissued_at":"2026-07-05T04:24:20.137830Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:24:20.137830Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A simple yet effective baseline for non-attributed graph classification","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Chen Cai, Yusu Wang","submitted_at":"2018-11-08T15:53:37Z","abstract_excerpt":"Graphs are complex objects that do not lend themselves easily to typical learning tasks. Recently, a range of approaches based on graph kernels or graph neural networks have been developed for graph classification and for representation learning on graphs in general. As the developed methodologies become more sophisticated, it is important to understand which components of the increasingly complex methods are necessary or most effective.\n  As a first step, we develop a simple yet meaningful graph representation, and explore its effectiveness in graph classification. We test our baseline repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.03508","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1811.03508/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"1811.03508","created_at":"2026-07-05T04:24:20.137885+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.03508v3","created_at":"2026-07-05T04:24:20.137885+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.03508","created_at":"2026-07-05T04:24:20.137885+00:00"},{"alias_kind":"pith_short_12","alias_value":"IGDZWGLLPEBL","created_at":"2026-07-05T04:24:20.137885+00:00"},{"alias_kind":"pith_short_16","alias_value":"IGDZWGLLPEBLZYYB","created_at":"2026-07-05T04:24:20.137885+00:00"},{"alias_kind":"pith_short_8","alias_value":"IGDZWGLL","created_at":"2026-07-05T04:24:20.137885+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.05046","citing_title":"Graph Cascades: Contagion-Based Mesoscopic Rewiring for Structure-Aware Graph Machine Learning","ref_index":145,"is_internal_anchor":false},{"citing_arxiv_id":"2509.05288","citing_title":"Learning to accelerate distributed ADMM using graph neural networks","ref_index":10,"is_internal_anchor":false},{"citing_arxiv_id":"1903.02428","citing_title":"Fast Graph Representation Learning with PyTorch Geometric","ref_index":7,"is_internal_anchor":false},{"citing_arxiv_id":"2604.25275","citing_title":"Graph-Conditioned Meta-Optimizer for QAOA Parameter Generation on Multiple Problem Classes","ref_index":37,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J","json":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J.json","graph_json":"https://pith.science/api/pith-number/IGDZWGLLPEBLZYYB3MUYISPM4J/graph.json","events_json":"https://pith.science/api/pith-number/IGDZWGLLPEBLZYYB3MUYISPM4J/events.json","paper":"https://pith.science/paper/IGDZWGLL"},"agent_actions":{"view_html":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J","download_json":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J.json","view_paper":"https://pith.science/paper/IGDZWGLL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.03508&json=true","fetch_graph":"https://pith.science/api/pith-number/IGDZWGLLPEBLZYYB3MUYISPM4J/graph.json","fetch_events":"https://pith.science/api/pith-number/IGDZWGLLPEBLZYYB3MUYISPM4J/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J/action/storage_attestation","attest_author":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J/action/author_attestation","sign_citation":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J/action/citation_signature","submit_replication":"https://pith.science/pith/IGDZWGLLPEBLZYYB3MUYISPM4J/action/replication_record"}},"created_at":"2026-07-05T04:24:20.137885+00:00","updated_at":"2026-07-05T04:24:20.137885+00:00"}