{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:TKV4BZPGCO2VOUU2QDVHZYF3TZ","short_pith_number":"pith:TKV4BZPG","canonical_record":{"source":{"id":"1703.06103","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:14Z","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"title_canon_sha256":"7f58c0ead74826a83cd51d91816ae4ae7de6cd9251f10f12b4b27936f19e1831","abstract_canon_sha256":"d3bab9569ee7e26b6801ec011ac03866f33f24d09df2f295f191a54232517d74"},"schema_version":"1.0"},"canonical_sha256":"9aabc0e5e613b557529a80ea7ce0bb9e5a992720ba4a0a9c21089706dd9a6375","source":{"kind":"arxiv","id":"1703.06103","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06103","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06103v4","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06103","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"TKV4BZPGCO2V","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TKV4BZPGCO2VOUU2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TKV4BZPG","created_at":"2026-05-18T12:31:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:TKV4BZPGCO2VOUU2QDVHZYF3TZ","target":"record","payload":{"canonical_record":{"source":{"id":"1703.06103","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:14Z","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"title_canon_sha256":"7f58c0ead74826a83cd51d91816ae4ae7de6cd9251f10f12b4b27936f19e1831","abstract_canon_sha256":"d3bab9569ee7e26b6801ec011ac03866f33f24d09df2f295f191a54232517d74"},"schema_version":"1.0"},"canonical_sha256":"9aabc0e5e613b557529a80ea7ce0bb9e5a992720ba4a0a9c21089706dd9a6375","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:31:55.966248Z","signature_b64":"amXhRer22YUNDDdbTGIXu8gYSi470JyKXM6tC3Vj/VgQSPdQ+2k3ssbsjCP2+k5eB0awJOKjCKAAZjEbPPYxCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9aabc0e5e613b557529a80ea7ce0bb9e5a992720ba4a0a9c21089706dd9a6375","last_reissued_at":"2026-05-18T00:31:55.965835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:31:55.965835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.06103","source_version":4,"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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rnh0XmWlqoZqphEbErRs3Pkg/LldTwALPxTZ+RIaiAF4bSZejzwxzW8VYAKtuE1niJXY1ZW/QNiQIoO/DMx/Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:37:02.240375Z"},"content_sha256":"c9990343adb55b40d2aea6c3aff2a43c79b1238825de4af5962304858c3ee247","schema_version":"1.0","event_id":"sha256:c9990343adb55b40d2aea6c3aff2a43c79b1238825de4af5962304858c3ee247"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:TKV4BZPGCO2VOUU2QDVHZYF3TZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Modeling Relational Data with Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.DB","cs.LG"],"primary_cat":"stat.ML","authors_text":"Ivan Titov, Max Welling, Michael Schlichtkrull, Peter Bloem, Rianne van den Berg, Thomas N. Kipf","submitted_at":"2017-03-17T17:09:14Z","abstract_excerpt":"Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and apply them to two standard knowledge base completion tasks: Link prediction (recovery of missing facts, i.e. subject-predicate-object triples) and entity classification (recovery of missing entity attributes). R-GCNs are related to a recent class of neural networks operating on grap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06103","kind":"arxiv","version":4},"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:31:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0Q3D/gkybX3zLk5uFEBgfUe0B4tF2xIDMDJqne6c8Cu3t7rHP6aQeZIyv2OBkmz5zJ7POmQVzV7IMXW84amhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T06:37:02.240955Z"},"content_sha256":"5d9c75ebb72840588b4d765685f3f5430ccbeb26647a01879cccc4025561e9fb","schema_version":"1.0","event_id":"sha256:5d9c75ebb72840588b4d765685f3f5430ccbeb26647a01879cccc4025561e9fb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKV4BZPGCO2VOUU2QDVHZYF3TZ/bundle.json","state_url":"https://pith.science/pith/TKV4BZPGCO2VOUU2QDVHZYF3TZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKV4BZPGCO2VOUU2QDVHZYF3TZ/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-31T06:37:02Z","links":{"resolver":"https://pith.science/pith/TKV4BZPGCO2VOUU2QDVHZYF3TZ","bundle":"https://pith.science/pith/TKV4BZPGCO2VOUU2QDVHZYF3TZ/bundle.json","state":"https://pith.science/pith/TKV4BZPGCO2VOUU2QDVHZYF3TZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKV4BZPGCO2VOUU2QDVHZYF3TZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:TKV4BZPGCO2VOUU2QDVHZYF3TZ","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":"d3bab9569ee7e26b6801ec011ac03866f33f24d09df2f295f191a54232517d74","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:14Z","title_canon_sha256":"7f58c0ead74826a83cd51d91816ae4ae7de6cd9251f10f12b4b27936f19e1831"},"schema_version":"1.0","source":{"id":"1703.06103","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.06103","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"arxiv_version","alias_value":"1703.06103v4","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.06103","created_at":"2026-05-18T00:31:55Z"},{"alias_kind":"pith_short_12","alias_value":"TKV4BZPGCO2V","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_16","alias_value":"TKV4BZPGCO2VOUU2","created_at":"2026-05-18T12:31:46Z"},{"alias_kind":"pith_short_8","alias_value":"TKV4BZPG","created_at":"2026-05-18T12:31:46Z"}],"graph_snapshots":[{"event_id":"sha256:5d9c75ebb72840588b4d765685f3f5430ccbeb26647a01879cccc4025561e9fb","target":"graph","created_at":"2026-05-18T00:31:55Z","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":"Knowledge graphs enable a wide variety of applications, including question answering and information retrieval. Despite the great effort invested in their creation and maintenance, even the largest (e.g., Yago, DBPedia or Wikidata) remain incomplete. We introduce Relational Graph Convolutional Networks (R-GCNs) and apply them to two standard knowledge base completion tasks: Link prediction (recovery of missing facts, i.e. subject-predicate-object triples) and entity classification (recovery of missing entity attributes). R-GCNs are related to a recent class of neural networks operating on grap","authors_text":"Ivan Titov, Max Welling, Michael Schlichtkrull, Peter Bloem, Rianne van den Berg, Thomas N. Kipf","cross_cats":["cs.AI","cs.DB","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:14Z","title":"Modeling Relational Data with Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.06103","kind":"arxiv","version":4},"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:c9990343adb55b40d2aea6c3aff2a43c79b1238825de4af5962304858c3ee247","target":"record","created_at":"2026-05-18T00:31:55Z","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":"d3bab9569ee7e26b6801ec011ac03866f33f24d09df2f295f191a54232517d74","cross_cats_sorted":["cs.AI","cs.DB","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2017-03-17T17:09:14Z","title_canon_sha256":"7f58c0ead74826a83cd51d91816ae4ae7de6cd9251f10f12b4b27936f19e1831"},"schema_version":"1.0","source":{"id":"1703.06103","kind":"arxiv","version":4}},"canonical_sha256":"9aabc0e5e613b557529a80ea7ce0bb9e5a992720ba4a0a9c21089706dd9a6375","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9aabc0e5e613b557529a80ea7ce0bb9e5a992720ba4a0a9c21089706dd9a6375","first_computed_at":"2026-05-18T00:31:55.965835Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:31:55.965835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"amXhRer22YUNDDdbTGIXu8gYSi470JyKXM6tC3Vj/VgQSPdQ+2k3ssbsjCP2+k5eB0awJOKjCKAAZjEbPPYxCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:31:55.966248Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.06103","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9990343adb55b40d2aea6c3aff2a43c79b1238825de4af5962304858c3ee247","sha256:5d9c75ebb72840588b4d765685f3f5430ccbeb26647a01879cccc4025561e9fb"],"state_sha256":"dc662401fe844534519acac7d4fe8c31a502fc01acb379a61b2af0d59821e9ca"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MKaLf4AUFkqhsIXr8+lybl1LCBlJBDIFC8OWEL/e6ncKL5ZxedtQzNOQQSw/RCbZcutb6IUJKEsTdk33GwqJDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T06:37:02.244146Z","bundle_sha256":"1b00b34c0b6ac0811cb9cc0b98dbbe6d80090f30c2254531d6ecd6d028f0cedb"}}