{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4XKGADC6EM6ISIXQG53TBJRWIP","short_pith_number":"pith:4XKGADC6","canonical_record":{"source":{"id":"1708.04357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-14T23:47:02Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ae5e61ffab7f72a29c416f22c74ed742ee78e19549a24808d4e2c0f71eab628b","abstract_canon_sha256":"2b1eb4bb2e51ffe807be8a95bb9f518d89dbf768a893f182fca635ee8754465e"},"schema_version":"1.0"},"canonical_sha256":"e5d4600c5e233c8922f0377730a63643ef1f4bf03b8b8cd19a48492ba12d2e0f","source":{"kind":"arxiv","id":"1708.04357","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04357","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04357v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04357","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"4XKGADC6EM6I","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4XKGADC6EM6ISIXQ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4XKGADC6","created_at":"2026-05-18T12:31:00Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4XKGADC6EM6ISIXQG53TBJRWIP","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04357","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-14T23:47:02Z","cross_cats_sorted":["cs.AI","stat.ML"],"title_canon_sha256":"ae5e61ffab7f72a29c416f22c74ed742ee78e19549a24808d4e2c0f71eab628b","abstract_canon_sha256":"2b1eb4bb2e51ffe807be8a95bb9f518d89dbf768a893f182fca635ee8754465e"},"schema_version":"1.0"},"canonical_sha256":"e5d4600c5e233c8922f0377730a63643ef1f4bf03b8b8cd19a48492ba12d2e0f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:59.561811Z","signature_b64":"3NVOL4vhzkqgfMIXU/cZ0Q2GSB6t3tOqn4QFuVEePR2WTTgv8hRifi4gHUl4lb03wVokxTKAbkoLdH0gc/JYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e5d4600c5e233c8922f0377730a63643ef1f4bf03b8b8cd19a48492ba12d2e0f","last_reissued_at":"2026-05-18T00:37:59.561335Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:59.561335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04357","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:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZJNU9A7L0TcZXCmt5juAYoIkKQTpG9i71JO1ii7jh3x7vWWK4xNm/9M0nBwn2YUgc5dmR7PIpXQsqMvlJyMLCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:48.068215Z"},"content_sha256":"66e39ed0549280a0f40b457b99ea647d2474af4f7bb4beb02519568e26206c1d","schema_version":"1.0","event_id":"sha256:66e39ed0549280a0f40b457b99ea647d2474af4f7bb4beb02519568e26206c1d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4XKGADC6EM6ISIXQG53TBJRWIP","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Classification via Deep Learning with Virtual Nodes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.ML"],"primary_cat":"cs.LG","authors_text":"Hoa Dam, Svetha Venkatesh, Trang Pham, Truyen Tran","submitted_at":"2017-08-14T23:47:02Z","abstract_excerpt":"Learning representation for graph classification turns a variable-size graph into a fixed-size vector (or matrix). Such a representation works nicely with algebraic manipulations. Here we introduce a simple method to augment an attributed graph with a virtual node that is bidirectionally connected to all existing nodes. The virtual node represents the latent aspects of the graph, which are not immediately available from the attributes and local connectivity structures. The expanded graph is then put through any node representation method. The representation of the virtual node is then the repr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04357","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:37:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QosiqLOuV3lpVh915KCg0t22f7ejWmGAoaVteAOutyaK3fElSh6buzD63OW0y6hleyT+EOwchizQFGKETqioAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-19T19:00:48.068575Z"},"content_sha256":"dcf76fd51496cb639b80f3db19e23c0f732bb6b0f2a8e9833e8bfd834f352f3f","schema_version":"1.0","event_id":"sha256:dcf76fd51496cb639b80f3db19e23c0f732bb6b0f2a8e9833e8bfd834f352f3f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4XKGADC6EM6ISIXQG53TBJRWIP/bundle.json","state_url":"https://pith.science/pith/4XKGADC6EM6ISIXQG53TBJRWIP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4XKGADC6EM6ISIXQG53TBJRWIP/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-05-19T19:00:48Z","links":{"resolver":"https://pith.science/pith/4XKGADC6EM6ISIXQG53TBJRWIP","bundle":"https://pith.science/pith/4XKGADC6EM6ISIXQG53TBJRWIP/bundle.json","state":"https://pith.science/pith/4XKGADC6EM6ISIXQG53TBJRWIP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4XKGADC6EM6ISIXQG53TBJRWIP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4XKGADC6EM6ISIXQG53TBJRWIP","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":"2b1eb4bb2e51ffe807be8a95bb9f518d89dbf768a893f182fca635ee8754465e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-14T23:47:02Z","title_canon_sha256":"ae5e61ffab7f72a29c416f22c74ed742ee78e19549a24808d4e2c0f71eab628b"},"schema_version":"1.0","source":{"id":"1708.04357","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04357","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04357v1","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04357","created_at":"2026-05-18T00:37:59Z"},{"alias_kind":"pith_short_12","alias_value":"4XKGADC6EM6I","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_16","alias_value":"4XKGADC6EM6ISIXQ","created_at":"2026-05-18T12:31:00Z"},{"alias_kind":"pith_short_8","alias_value":"4XKGADC6","created_at":"2026-05-18T12:31:00Z"}],"graph_snapshots":[{"event_id":"sha256:dcf76fd51496cb639b80f3db19e23c0f732bb6b0f2a8e9833e8bfd834f352f3f","target":"graph","created_at":"2026-05-18T00:37:59Z","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":"Learning representation for graph classification turns a variable-size graph into a fixed-size vector (or matrix). Such a representation works nicely with algebraic manipulations. Here we introduce a simple method to augment an attributed graph with a virtual node that is bidirectionally connected to all existing nodes. The virtual node represents the latent aspects of the graph, which are not immediately available from the attributes and local connectivity structures. The expanded graph is then put through any node representation method. The representation of the virtual node is then the repr","authors_text":"Hoa Dam, Svetha Venkatesh, Trang Pham, Truyen Tran","cross_cats":["cs.AI","stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-14T23:47:02Z","title":"Graph Classification via Deep Learning with Virtual Nodes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04357","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:66e39ed0549280a0f40b457b99ea647d2474af4f7bb4beb02519568e26206c1d","target":"record","created_at":"2026-05-18T00:37:59Z","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":"2b1eb4bb2e51ffe807be8a95bb9f518d89dbf768a893f182fca635ee8754465e","cross_cats_sorted":["cs.AI","stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2017-08-14T23:47:02Z","title_canon_sha256":"ae5e61ffab7f72a29c416f22c74ed742ee78e19549a24808d4e2c0f71eab628b"},"schema_version":"1.0","source":{"id":"1708.04357","kind":"arxiv","version":1}},"canonical_sha256":"e5d4600c5e233c8922f0377730a63643ef1f4bf03b8b8cd19a48492ba12d2e0f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e5d4600c5e233c8922f0377730a63643ef1f4bf03b8b8cd19a48492ba12d2e0f","first_computed_at":"2026-05-18T00:37:59.561335Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:59.561335Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3NVOL4vhzkqgfMIXU/cZ0Q2GSB6t3tOqn4QFuVEePR2WTTgv8hRifi4gHUl4lb03wVokxTKAbkoLdH0gc/JYCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:59.561811Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04357","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66e39ed0549280a0f40b457b99ea647d2474af4f7bb4beb02519568e26206c1d","sha256:dcf76fd51496cb639b80f3db19e23c0f732bb6b0f2a8e9833e8bfd834f352f3f"],"state_sha256":"35bb2c6973911d300a614005eae8c9cfef678cdee8208dd43b6bf7118ba38876"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K0RYT2Eq3jYdjqCKnUyFhMpy7sh32or0wwjULW7nYTCULYDCzoW/qTyxk0s0KZXYmlnH6++n5Glpkn7rOuPOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-19T19:00:48.070629Z","bundle_sha256":"b127dcc555aaf9a9299b8689bd7c83c57200692d045187d17e98bfbe01604a91"}}