{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:ISVVB3N5FVYZCISJCNNONPJGWC","short_pith_number":"pith:ISVVB3N5","schema_version":"1.0","canonical_sha256":"44ab50edbd2d71912249135ae6bd26b0a345643cb394ea99ba246a1b8463a7ca","source":{"kind":"arxiv","id":"1902.09936","version":1},"attestation_state":"computed","paper":{"title":"Learning Vertex Convolutional Networks for Graph Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Edwin R. Hancock, Lixin Cui, Lu Bai, Shu Wu, Yuhang Jiao","submitted_at":"2019-02-26T13:58:37Z","abstract_excerpt":"In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of fixed-sized one-dimensional convolution filters on the grid structure. We show that the proposed model not only integrates the precise structural correspondence information between graphs but also minimises the loss of structural information residing on local-level vertices. Exp"},"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":"1902.09936","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-02-26T13:58:37Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"086b8706ed5ca62828b9c4276e031f6814465e32a9f0c86f67ac513f9341a1dc","abstract_canon_sha256":"0aabf6ba171cbc451c4370f327eeb94e405a57fd6e8f81a55cf12c0b103ad2d1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:52:35.020815Z","signature_b64":"1IK7oWtENKRNUFK91GksNZQM9RlNkadsVrMCGujFvf0mT2QABwzFce54M/Ty9h9UoVuBtD7Y7uyZm7sS2vSoAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"44ab50edbd2d71912249135ae6bd26b0a345643cb394ea99ba246a1b8463a7ca","last_reissued_at":"2026-05-17T23:52:35.020459Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:52:35.020459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Learning Vertex Convolutional Networks for Graph Classification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Edwin R. Hancock, Lixin Cui, Lu Bai, Shu Wu, Yuhang Jiao","submitted_at":"2019-02-26T13:58:37Z","abstract_excerpt":"In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of fixed-sized one-dimensional convolution filters on the grid structure. We show that the proposed model not only integrates the precise structural correspondence information between graphs but also minimises the loss of structural information residing on local-level vertices. Exp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1902.09936","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1902.09936","created_at":"2026-05-17T23:52:35.020516+00:00"},{"alias_kind":"arxiv_version","alias_value":"1902.09936v1","created_at":"2026-05-17T23:52:35.020516+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1902.09936","created_at":"2026-05-17T23:52:35.020516+00:00"},{"alias_kind":"pith_short_12","alias_value":"ISVVB3N5FVYZ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"ISVVB3N5FVYZCISJ","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"ISVVB3N5","created_at":"2026-05-18T12:33:18.533446+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC","json":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC.json","graph_json":"https://pith.science/api/pith-number/ISVVB3N5FVYZCISJCNNONPJGWC/graph.json","events_json":"https://pith.science/api/pith-number/ISVVB3N5FVYZCISJCNNONPJGWC/events.json","paper":"https://pith.science/paper/ISVVB3N5"},"agent_actions":{"view_html":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC","download_json":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC.json","view_paper":"https://pith.science/paper/ISVVB3N5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1902.09936&json=true","fetch_graph":"https://pith.science/api/pith-number/ISVVB3N5FVYZCISJCNNONPJGWC/graph.json","fetch_events":"https://pith.science/api/pith-number/ISVVB3N5FVYZCISJCNNONPJGWC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC/action/storage_attestation","attest_author":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC/action/author_attestation","sign_citation":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC/action/citation_signature","submit_replication":"https://pith.science/pith/ISVVB3N5FVYZCISJCNNONPJGWC/action/replication_record"}},"created_at":"2026-05-17T23:52:35.020516+00:00","updated_at":"2026-05-17T23:52:35.020516+00:00"}