{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:PVFHEBSTBWTTWZSS6HT6657CW7","short_pith_number":"pith:PVFHEBST","canonical_record":{"source":{"id":"1709.05584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-17T00:19:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"66f3badd8965ecfc7aaa3844c1b74aa6f7afcf756989850aa318d791815e0f7a","abstract_canon_sha256":"7533e49719bcd4f8ded234ccc972811a4f535b7ceee21de50802aef2d02ee24f"},"schema_version":"1.0"},"canonical_sha256":"7d4a7206530da73b6652f1e7ef77e2b7c8cc124a4a5681f41b773291feb9c022","source":{"kind":"arxiv","id":"1709.05584","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05584","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05584v3","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05584","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"PVFHEBSTBWTT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PVFHEBSTBWTTWZSS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PVFHEBST","created_at":"2026-05-18T12:31:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:PVFHEBSTBWTTWZSS6HT6657CW7","target":"record","payload":{"canonical_record":{"source":{"id":"1709.05584","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-17T00:19:33Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"66f3badd8965ecfc7aaa3844c1b74aa6f7afcf756989850aa318d791815e0f7a","abstract_canon_sha256":"7533e49719bcd4f8ded234ccc972811a4f535b7ceee21de50802aef2d02ee24f"},"schema_version":"1.0"},"canonical_sha256":"7d4a7206530da73b6652f1e7ef77e2b7c8cc124a4a5681f41b773291feb9c022","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:53.353666Z","signature_b64":"sXYGwnj6WtQJehmLHbyPr+nMd3Rl5l8HGwZd3LqZeN4thfuP3rVnV6+t5tdJ8aB+pVPTl1DSJwytv2g5X7z4DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7d4a7206530da73b6652f1e7ef77e2b7c8cc124a4a5681f41b773291feb9c022","last_reissued_at":"2026-05-18T00:18:53.353167Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:53.353167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1709.05584","source_version":3,"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:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TtdFlMFF9flnebGYCw3bj77+ky/aly3k8NYM4THSeuD7quIXKB1gS+KHOfRGTV2FyBEDj4q8VCMwzK4BQSELDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:06:13.017544Z"},"content_sha256":"95eeaa36035d9a238da8d52d7b310f07a14955824531f938295a8c43c3bd62ac","schema_version":"1.0","event_id":"sha256:95eeaa36035d9a238da8d52d7b310f07a14955824531f938295a8c43c3bd62ac"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:PVFHEBSTBWTTWZSS6HT6657CW7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Representation Learning on Graphs: Methods and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.SI","authors_text":"Jure Leskovec, Rex Ying, William L. Hamilton","submitted_at":"2017-09-17T00:19:33Z","abstract_excerpt":"Machine learning on graphs is an important and ubiquitous task with applications ranging from drug design to friendship recommendation in social networks. The primary challenge in this domain is finding a way to represent, or encode, graph structure so that it can be easily exploited by machine learning models. Traditionally, machine learning approaches relied on user-defined heuristics to extract features encoding structural information about a graph (e.g., degree statistics or kernel functions). However, recent years have seen a surge in approaches that automatically learn to encode graph st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05584","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":""},"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:18:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ijz3Y5cWNdIvXw10+qK31z14txTXL7rthj5KhZL6JVpOHkPf8ogGnxNob0m+sRUmjpNqKBSTjm9KYj/0M29IDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T12:06:13.017894Z"},"content_sha256":"6e9f371549af1fbf3e48d9635a8cc06df7d79b80a5fe8680766e0e26a6424ce8","schema_version":"1.0","event_id":"sha256:6e9f371549af1fbf3e48d9635a8cc06df7d79b80a5fe8680766e0e26a6424ce8"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PVFHEBSTBWTTWZSS6HT6657CW7/bundle.json","state_url":"https://pith.science/pith/PVFHEBSTBWTTWZSS6HT6657CW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PVFHEBSTBWTTWZSS6HT6657CW7/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-01T12:06:13Z","links":{"resolver":"https://pith.science/pith/PVFHEBSTBWTTWZSS6HT6657CW7","bundle":"https://pith.science/pith/PVFHEBSTBWTTWZSS6HT6657CW7/bundle.json","state":"https://pith.science/pith/PVFHEBSTBWTTWZSS6HT6657CW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PVFHEBSTBWTTWZSS6HT6657CW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:PVFHEBSTBWTTWZSS6HT6657CW7","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":"7533e49719bcd4f8ded234ccc972811a4f535b7ceee21de50802aef2d02ee24f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-17T00:19:33Z","title_canon_sha256":"66f3badd8965ecfc7aaa3844c1b74aa6f7afcf756989850aa318d791815e0f7a"},"schema_version":"1.0","source":{"id":"1709.05584","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.05584","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"arxiv_version","alias_value":"1709.05584v3","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.05584","created_at":"2026-05-18T00:18:53Z"},{"alias_kind":"pith_short_12","alias_value":"PVFHEBSTBWTT","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_16","alias_value":"PVFHEBSTBWTTWZSS","created_at":"2026-05-18T12:31:37Z"},{"alias_kind":"pith_short_8","alias_value":"PVFHEBST","created_at":"2026-05-18T12:31:37Z"}],"graph_snapshots":[{"event_id":"sha256:6e9f371549af1fbf3e48d9635a8cc06df7d79b80a5fe8680766e0e26a6424ce8","target":"graph","created_at":"2026-05-18T00:18:53Z","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":"Machine learning on graphs is an important and ubiquitous task with applications ranging from drug design to friendship recommendation in social networks. The primary challenge in this domain is finding a way to represent, or encode, graph structure so that it can be easily exploited by machine learning models. Traditionally, machine learning approaches relied on user-defined heuristics to extract features encoding structural information about a graph (e.g., degree statistics or kernel functions). However, recent years have seen a surge in approaches that automatically learn to encode graph st","authors_text":"Jure Leskovec, Rex Ying, William L. Hamilton","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-17T00:19:33Z","title":"Representation Learning on Graphs: Methods and Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.05584","kind":"arxiv","version":3},"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:95eeaa36035d9a238da8d52d7b310f07a14955824531f938295a8c43c3bd62ac","target":"record","created_at":"2026-05-18T00:18:53Z","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":"7533e49719bcd4f8ded234ccc972811a4f535b7ceee21de50802aef2d02ee24f","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.SI","submitted_at":"2017-09-17T00:19:33Z","title_canon_sha256":"66f3badd8965ecfc7aaa3844c1b74aa6f7afcf756989850aa318d791815e0f7a"},"schema_version":"1.0","source":{"id":"1709.05584","kind":"arxiv","version":3}},"canonical_sha256":"7d4a7206530da73b6652f1e7ef77e2b7c8cc124a4a5681f41b773291feb9c022","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7d4a7206530da73b6652f1e7ef77e2b7c8cc124a4a5681f41b773291feb9c022","first_computed_at":"2026-05-18T00:18:53.353167Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:53.353167Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"sXYGwnj6WtQJehmLHbyPr+nMd3Rl5l8HGwZd3LqZeN4thfuP3rVnV6+t5tdJ8aB+pVPTl1DSJwytv2g5X7z4DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:53.353666Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.05584","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:95eeaa36035d9a238da8d52d7b310f07a14955824531f938295a8c43c3bd62ac","sha256:6e9f371549af1fbf3e48d9635a8cc06df7d79b80a5fe8680766e0e26a6424ce8"],"state_sha256":"06b0c8e7c65feeeeb6cadbae143225eecddf2f2828131ce2e587163a3a99b22f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Si58E01Ipa60BCa5mzp8iIOe81pzWxGdRHV+r0PHb3fQMEL2yEpffE15cp0MZZHT/7h5t5AlUm4DxjkGS7yJDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T12:06:13.020551Z","bundle_sha256":"101f2400dba7e29bb6234ac19ec89cfaf25912cf21e60a3a6d711a2b2a2495fa"}}