{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6COV3F7I2PT4PGV7EVISGBWA4M","short_pith_number":"pith:6COV3F7I","canonical_record":{"source":{"id":"1811.09595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T18:46:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"26a35e4b948fb3d30858049095c9ce30cb8bebcb7dd343dc7998ae147c31e96d","abstract_canon_sha256":"f55b374915db8e8a16a2b0716985e3a2d5313ed98acf5f97c492fac384bc6115"},"schema_version":"1.0"},"canonical_sha256":"f09d5d97e8d3e7c79abf25512306c0e31467902b1cc6858520819afdad1860ae","source":{"kind":"arxiv","id":"1811.09595","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09595","created_at":"2026-05-18T00:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09595v1","created_at":"2026-05-18T00:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09595","created_at":"2026-05-18T00:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"6COV3F7I2PT4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6COV3F7I2PT4PGV7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6COV3F7I","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6COV3F7I2PT4PGV7EVISGBWA4M","target":"record","payload":{"canonical_record":{"source":{"id":"1811.09595","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T18:46:59Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"26a35e4b948fb3d30858049095c9ce30cb8bebcb7dd343dc7998ae147c31e96d","abstract_canon_sha256":"f55b374915db8e8a16a2b0716985e3a2d5313ed98acf5f97c492fac384bc6115"},"schema_version":"1.0"},"canonical_sha256":"f09d5d97e8d3e7c79abf25512306c0e31467902b1cc6858520819afdad1860ae","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:02.963344Z","signature_b64":"07WVnsgD9QGUtP9A+9fBAPItgNfZ5YVZQN7ntBr/vxREWXadoyX/DdcnlbH5P8jtBcfbiWhVkAw/7Xm5tE1XAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09d5d97e8d3e7c79abf25512306c0e31467902b1cc6858520819afdad1860ae","last_reissued_at":"2026-05-18T00:00:02.962696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:02.962696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.09595","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rIaLXot/PxjvIBfPR//pwhjzKpw7BozuwRzvYBliYe3dwAv1r58pD1D1koSRpVlTk63XtLqm95dROEY704ejAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:05:15.490712Z"},"content_sha256":"2e1a1465fbdd41b038ab0392b9273bb9b6ac4c84577f367576a19c14821d3cd4","schema_version":"1.0","event_id":"sha256:2e1a1465fbdd41b038ab0392b9273bb9b6ac4c84577f367576a19c14821d3cd4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6COV3F7I2PT4PGV7EVISGBWA4M","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Boris Knyazev, Graham W. Taylor, Mohamed R. Amer, Xiao Lin","submitted_at":"2018-11-23T18:46:59Z","abstract_excerpt":"Spectral Graph Convolutional Networks (GCNs) are a generalization of convolutional networks to learning on graph-structured data. Applications of spectral GCNs have been successful, but limited to a few problems where the graph is fixed, such as shape correspondence and node classification. In this work, we address this limitation by revisiting a particular family of spectral graph networks, Chebyshev GCNs, showing its efficacy in solving graph classification tasks with a variable graph structure and size. Chebyshev GCNs restrict graphs to have at most one edge between any pair of nodes. To th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09595","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:00:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KRfr5WAlpC4v+z/CSJy0FzslZrdHHdMxK2/8N8kJ2I8rHeSzW/pIqqD3FyMJmi/seKBaGWqK9MXTT7lQXk+PDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:05:15.491064Z"},"content_sha256":"083cb8aed59e2447ad39185e633de4cebbcab7ad58a86e44f5ee92bd87593f2b","schema_version":"1.0","event_id":"sha256:083cb8aed59e2447ad39185e633de4cebbcab7ad58a86e44f5ee92bd87593f2b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6COV3F7I2PT4PGV7EVISGBWA4M/bundle.json","state_url":"https://pith.science/pith/6COV3F7I2PT4PGV7EVISGBWA4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6COV3F7I2PT4PGV7EVISGBWA4M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-05T09:05:15Z","links":{"resolver":"https://pith.science/pith/6COV3F7I2PT4PGV7EVISGBWA4M","bundle":"https://pith.science/pith/6COV3F7I2PT4PGV7EVISGBWA4M/bundle.json","state":"https://pith.science/pith/6COV3F7I2PT4PGV7EVISGBWA4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6COV3F7I2PT4PGV7EVISGBWA4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6COV3F7I2PT4PGV7EVISGBWA4M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"f55b374915db8e8a16a2b0716985e3a2d5313ed98acf5f97c492fac384bc6115","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T18:46:59Z","title_canon_sha256":"26a35e4b948fb3d30858049095c9ce30cb8bebcb7dd343dc7998ae147c31e96d"},"schema_version":"1.0","source":{"id":"1811.09595","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.09595","created_at":"2026-05-18T00:00:02Z"},{"alias_kind":"arxiv_version","alias_value":"1811.09595v1","created_at":"2026-05-18T00:00:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.09595","created_at":"2026-05-18T00:00:02Z"},{"alias_kind":"pith_short_12","alias_value":"6COV3F7I2PT4","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6COV3F7I2PT4PGV7","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6COV3F7I","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:083cb8aed59e2447ad39185e633de4cebbcab7ad58a86e44f5ee92bd87593f2b","target":"graph","created_at":"2026-05-18T00:00:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Spectral Graph Convolutional Networks (GCNs) are a generalization of convolutional networks to learning on graph-structured data. Applications of spectral GCNs have been successful, but limited to a few problems where the graph is fixed, such as shape correspondence and node classification. In this work, we address this limitation by revisiting a particular family of spectral graph networks, Chebyshev GCNs, showing its efficacy in solving graph classification tasks with a variable graph structure and size. Chebyshev GCNs restrict graphs to have at most one edge between any pair of nodes. To th","authors_text":"Boris Knyazev, Graham W. Taylor, Mohamed R. Amer, Xiao Lin","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T18:46:59Z","title":"Spectral Multigraph Networks for Discovering and Fusing Relationships in Molecules"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.09595","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:2e1a1465fbdd41b038ab0392b9273bb9b6ac4c84577f367576a19c14821d3cd4","target":"record","created_at":"2026-05-18T00:00:02Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"f55b374915db8e8a16a2b0716985e3a2d5313ed98acf5f97c492fac384bc6115","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-11-23T18:46:59Z","title_canon_sha256":"26a35e4b948fb3d30858049095c9ce30cb8bebcb7dd343dc7998ae147c31e96d"},"schema_version":"1.0","source":{"id":"1811.09595","kind":"arxiv","version":1}},"canonical_sha256":"f09d5d97e8d3e7c79abf25512306c0e31467902b1cc6858520819afdad1860ae","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09d5d97e8d3e7c79abf25512306c0e31467902b1cc6858520819afdad1860ae","first_computed_at":"2026-05-18T00:00:02.962696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:02.962696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"07WVnsgD9QGUtP9A+9fBAPItgNfZ5YVZQN7ntBr/vxREWXadoyX/DdcnlbH5P8jtBcfbiWhVkAw/7Xm5tE1XAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:02.963344Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.09595","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e1a1465fbdd41b038ab0392b9273bb9b6ac4c84577f367576a19c14821d3cd4","sha256:083cb8aed59e2447ad39185e633de4cebbcab7ad58a86e44f5ee92bd87593f2b"],"state_sha256":"baab21cb2ed4177606f6671150db40cb546dfa28e6b1ac16f28ec6708b737354"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZRMSXoxkgxmjHv9SbnooxuWV+Z3OAHiCh+jKkqqFXKnjKKMXahVTYTA1CLR1nUdIhvDKYkQLJ2oqoq1+egVyCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:05:15.493040Z","bundle_sha256":"2ab4c3e2aa2710a457be58de6f5fa8b29b17398e7b3b51f993c798cd9615733f"}}