{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TTHME2LWEH7KSNQYNYXPIEFMYW","short_pith_number":"pith:TTHME2LW","canonical_record":{"source":{"id":"1707.05005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-17T05:09:03Z","cross_cats_sorted":["cs.CL","cs.CR","cs.NE","cs.SE"],"title_canon_sha256":"89623caba74ad8bd91c1ebdf325fc7d9c738a2115f73fa50fdf6c477deff7d97","abstract_canon_sha256":"eb5e0c695a94f34a238c53ddef747c1ea432e0f6b724dd6b27e8bbd2a5f958af"},"schema_version":"1.0"},"canonical_sha256":"9ccec2697621fea936186e2ef410acc58b6e6d896c0331a3362a4b36ff0f352d","source":{"kind":"arxiv","id":"1707.05005","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05005","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05005v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05005","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"TTHME2LWEH7K","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TTHME2LWEH7KSNQY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TTHME2LW","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TTHME2LWEH7KSNQYNYXPIEFMYW","target":"record","payload":{"canonical_record":{"source":{"id":"1707.05005","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-17T05:09:03Z","cross_cats_sorted":["cs.CL","cs.CR","cs.NE","cs.SE"],"title_canon_sha256":"89623caba74ad8bd91c1ebdf325fc7d9c738a2115f73fa50fdf6c477deff7d97","abstract_canon_sha256":"eb5e0c695a94f34a238c53ddef747c1ea432e0f6b724dd6b27e8bbd2a5f958af"},"schema_version":"1.0"},"canonical_sha256":"9ccec2697621fea936186e2ef410acc58b6e6d896c0331a3362a4b36ff0f352d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:11.624243Z","signature_b64":"0ekYY3vkx5i9yvgBEiskddCVkF1cze3fOPvR+FXppmbVRNf9Q+ETzWIpbtYqpjavlkDXNNaTdLfYbbY8OeNpBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ccec2697621fea936186e2ef410acc58b6e6d896c0331a3362a4b36ff0f352d","last_reissued_at":"2026-05-18T00:40:11.623684Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:11.623684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1707.05005","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ijtjz61znjlcZMt+w+H6n7ZJk/EQWz+HW7xybbISb1ungm7e/gHRrZeqxVlD2XOV50zZIJ9AQ/N9Zf+ilYtsBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:18:16.417335Z"},"content_sha256":"61fe358dcc57b79b06f9d5f9cbc24a569bcd2800b05593c0d815b6d2b4c1cf15","schema_version":"1.0","event_id":"sha256:61fe358dcc57b79b06f9d5f9cbc24a569bcd2800b05593c0d815b6d2b4c1cf15"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TTHME2LWEH7KSNQYNYXPIEFMYW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"graph2vec: Learning Distributed Representations of Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CL","cs.CR","cs.NE","cs.SE"],"primary_cat":"cs.AI","authors_text":"Annamalai Narayanan, Lihui Chen, Mahinthan Chandramohan, Rajasekar Venkatesan, Shantanu Jaiswal, Yang Liu","submitted_at":"2017-07-17T05:09:03Z","abstract_excerpt":"Recent works on representation learning for graph structured data predominantly focus on learning distributed representations of graph substructures such as nodes and subgraphs. However, many graph analytics tasks such as graph classification and clustering require representing entire graphs as fixed length feature vectors. While the aforementioned approaches are naturally unequipped to learn such representations, graph kernels remain as the most effective way of obtaining them. However, these graph kernels use handcrafted features (e.g., shortest paths, graphlets, etc.) and hence are hampered"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05005","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:40:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O/ufczQXRVsBnIHdlcAzAQw96ETy82TAspk7kZwnxYw8lJv0DllxSILGcOX/gw8ax8OukzsKwnWJDvmJWEiwDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T01:18:16.417690Z"},"content_sha256":"435582533fbadf78308625b2a1280985f237b7a06e581de22aacfdc63eec8013","schema_version":"1.0","event_id":"sha256:435582533fbadf78308625b2a1280985f237b7a06e581de22aacfdc63eec8013"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTHME2LWEH7KSNQYNYXPIEFMYW/bundle.json","state_url":"https://pith.science/pith/TTHME2LWEH7KSNQYNYXPIEFMYW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTHME2LWEH7KSNQYNYXPIEFMYW/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-28T01:18:16Z","links":{"resolver":"https://pith.science/pith/TTHME2LWEH7KSNQYNYXPIEFMYW","bundle":"https://pith.science/pith/TTHME2LWEH7KSNQYNYXPIEFMYW/bundle.json","state":"https://pith.science/pith/TTHME2LWEH7KSNQYNYXPIEFMYW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTHME2LWEH7KSNQYNYXPIEFMYW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TTHME2LWEH7KSNQYNYXPIEFMYW","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":"eb5e0c695a94f34a238c53ddef747c1ea432e0f6b724dd6b27e8bbd2a5f958af","cross_cats_sorted":["cs.CL","cs.CR","cs.NE","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-17T05:09:03Z","title_canon_sha256":"89623caba74ad8bd91c1ebdf325fc7d9c738a2115f73fa50fdf6c477deff7d97"},"schema_version":"1.0","source":{"id":"1707.05005","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1707.05005","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"arxiv_version","alias_value":"1707.05005v1","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05005","created_at":"2026-05-18T00:40:11Z"},{"alias_kind":"pith_short_12","alias_value":"TTHME2LWEH7K","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TTHME2LWEH7KSNQY","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TTHME2LW","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:435582533fbadf78308625b2a1280985f237b7a06e581de22aacfdc63eec8013","target":"graph","created_at":"2026-05-18T00:40:11Z","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":"Recent works on representation learning for graph structured data predominantly focus on learning distributed representations of graph substructures such as nodes and subgraphs. However, many graph analytics tasks such as graph classification and clustering require representing entire graphs as fixed length feature vectors. While the aforementioned approaches are naturally unequipped to learn such representations, graph kernels remain as the most effective way of obtaining them. However, these graph kernels use handcrafted features (e.g., shortest paths, graphlets, etc.) and hence are hampered","authors_text":"Annamalai Narayanan, Lihui Chen, Mahinthan Chandramohan, Rajasekar Venkatesan, Shantanu Jaiswal, Yang Liu","cross_cats":["cs.CL","cs.CR","cs.NE","cs.SE"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-17T05:09:03Z","title":"graph2vec: Learning Distributed Representations of Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05005","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:61fe358dcc57b79b06f9d5f9cbc24a569bcd2800b05593c0d815b6d2b4c1cf15","target":"record","created_at":"2026-05-18T00:40:11Z","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":"eb5e0c695a94f34a238c53ddef747c1ea432e0f6b724dd6b27e8bbd2a5f958af","cross_cats_sorted":["cs.CL","cs.CR","cs.NE","cs.SE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2017-07-17T05:09:03Z","title_canon_sha256":"89623caba74ad8bd91c1ebdf325fc7d9c738a2115f73fa50fdf6c477deff7d97"},"schema_version":"1.0","source":{"id":"1707.05005","kind":"arxiv","version":1}},"canonical_sha256":"9ccec2697621fea936186e2ef410acc58b6e6d896c0331a3362a4b36ff0f352d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ccec2697621fea936186e2ef410acc58b6e6d896c0331a3362a4b36ff0f352d","first_computed_at":"2026-05-18T00:40:11.623684Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:11.623684Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"0ekYY3vkx5i9yvgBEiskddCVkF1cze3fOPvR+FXppmbVRNf9Q+ETzWIpbtYqpjavlkDXNNaTdLfYbbY8OeNpBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:11.624243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1707.05005","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:61fe358dcc57b79b06f9d5f9cbc24a569bcd2800b05593c0d815b6d2b4c1cf15","sha256:435582533fbadf78308625b2a1280985f237b7a06e581de22aacfdc63eec8013"],"state_sha256":"ceda8f0d2add976a5c8d38724f77cacd399d07a384fa6f18c65e7f51cf118069"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2h/oF9MaQ37ZU7xnLQAw31qvz5Pf13/ZwRxrbAQuSF0B4OO0Ah5oEYN1jWHGo7tBUtyuvDcT4/sxV2pT4W1ZBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T01:18:16.419656Z","bundle_sha256":"5dd223f1afa122c7c5ac7ccd764f58fb219fe5c84582ff11429fc6eb29fe0078"}}