{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:UTEVMXINGDBEGMV2IDJQJB7RX3","short_pith_number":"pith:UTEVMXIN","canonical_record":{"source":{"id":"1911.03082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-08T06:48:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d8a008519b9f2ef43f869e4c19e1cb977a8dfdbdf4dc5d14382432fd121759a2","abstract_canon_sha256":"045c766c46ef2b9afb4831a2b13f5aa00fe6348d9b937f8ce4128eb1b0d281fe"},"schema_version":"1.0"},"canonical_sha256":"a4c9565d0d30c24332ba40d30487f1bef83e44d04b6466f104627c6cc647e8a0","source":{"kind":"arxiv","id":"1911.03082","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.03082","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"1911.03082v2","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03082","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"UTEVMXINGDBE","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"pith_short_16","alias_value":"UTEVMXINGDBEGMV2","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"pith_short_8","alias_value":"UTEVMXIN","created_at":"2026-07-05T00:34:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:UTEVMXINGDBEGMV2IDJQJB7RX3","target":"record","payload":{"canonical_record":{"source":{"id":"1911.03082","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-08T06:48:40Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"d8a008519b9f2ef43f869e4c19e1cb977a8dfdbdf4dc5d14382432fd121759a2","abstract_canon_sha256":"045c766c46ef2b9afb4831a2b13f5aa00fe6348d9b937f8ce4128eb1b0d281fe"},"schema_version":"1.0"},"canonical_sha256":"a4c9565d0d30c24332ba40d30487f1bef83e44d04b6466f104627c6cc647e8a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:34:19.183649Z","signature_b64":"klC05iFoHgyi9IB7AMd1PSSqaM+dsdqC+oZ2vHF1KB0kERazMXuDxyjv2DeNwq6IwaJf9NeMKqhMpRSC6ci2Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a4c9565d0d30c24332ba40d30487f1bef83e44d04b6466f104627c6cc647e8a0","last_reissued_at":"2026-07-05T00:34:19.183173Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:34:19.183173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1911.03082","source_version":2,"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-07-05T00:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CU9btIbG8zhsa5Q8e1fDYF5TcStyHo+yzeG7HXX7QscfQ9xCp1HuBalZHXvXpuRzbTM5seWwJPOL9+HzwqC+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:22:27.181419Z"},"content_sha256":"bb36b41e0b570b73810f8b3086a309581b64c8cb03a23efac1784875801ebc3c","schema_version":"1.0","event_id":"sha256:bb36b41e0b570b73810f8b3086a309581b64c8cb03a23efac1784875801ebc3c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:UTEVMXINGDBEGMV2IDJQJB7RX3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Composition-based Multi-Relational Graph Convolutional Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"cs.LG","authors_text":"Partha Talukdar, Shikhar Vashishth, Soumya Sanyal, Vikram Nitin","submitted_at":"2019-11-08T06:48:40Z","abstract_excerpt":"Graph Convolutional Networks (GCNs) have recently been shown to be quite successful in modeling graph-structured data. However, the primary focus has been on handling simple undirected graphs. Multi-relational graphs are a more general and prevalent form of graphs where each edge has a label and direction associated with it. Most of the existing approaches to handle such graphs suffer from over-parameterization and are restricted to learning representations of nodes only. In this paper, we propose CompGCN, a novel Graph Convolutional framework which jointly embeds both nodes and relations in a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03082","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1911.03082/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T00:34:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4eN4bD5n/EH+kMgsk5Sb+ryJfDEzp9MlYriuDt4SZzXy/e9ogf4wV6JPq0hMK2B9wqxKolfLHwaYWE4dd26rCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T16:22:27.181919Z"},"content_sha256":"b7f307bdcf90d6a5bf587402c3e2b06fe3441d011562d28a09e875d11f23ef96","schema_version":"1.0","event_id":"sha256:b7f307bdcf90d6a5bf587402c3e2b06fe3441d011562d28a09e875d11f23ef96"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/bundle.json","state_url":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/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-08-07T16:22:27Z","links":{"resolver":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3","bundle":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/bundle.json","state":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:UTEVMXINGDBEGMV2IDJQJB7RX3","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":"045c766c46ef2b9afb4831a2b13f5aa00fe6348d9b937f8ce4128eb1b0d281fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-08T06:48:40Z","title_canon_sha256":"d8a008519b9f2ef43f869e4c19e1cb977a8dfdbdf4dc5d14382432fd121759a2"},"schema_version":"1.0","source":{"id":"1911.03082","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1911.03082","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"arxiv_version","alias_value":"1911.03082v2","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03082","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"pith_short_12","alias_value":"UTEVMXINGDBE","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"pith_short_16","alias_value":"UTEVMXINGDBEGMV2","created_at":"2026-07-05T00:34:19Z"},{"alias_kind":"pith_short_8","alias_value":"UTEVMXIN","created_at":"2026-07-05T00:34:19Z"}],"graph_snapshots":[{"event_id":"sha256:b7f307bdcf90d6a5bf587402c3e2b06fe3441d011562d28a09e875d11f23ef96","target":"graph","created_at":"2026-07-05T00:34:19Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1911.03082/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Graph Convolutional Networks (GCNs) have recently been shown to be quite successful in modeling graph-structured data. However, the primary focus has been on handling simple undirected graphs. Multi-relational graphs are a more general and prevalent form of graphs where each edge has a label and direction associated with it. Most of the existing approaches to handle such graphs suffer from over-parameterization and are restricted to learning representations of nodes only. In this paper, we propose CompGCN, a novel Graph Convolutional framework which jointly embeds both nodes and relations in a","authors_text":"Partha Talukdar, Shikhar Vashishth, Soumya Sanyal, Vikram Nitin","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-08T06:48:40Z","title":"Composition-based Multi-Relational Graph Convolutional Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1911.03082","kind":"arxiv","version":2},"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:bb36b41e0b570b73810f8b3086a309581b64c8cb03a23efac1784875801ebc3c","target":"record","created_at":"2026-07-05T00:34:19Z","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":"045c766c46ef2b9afb4831a2b13f5aa00fe6348d9b937f8ce4128eb1b0d281fe","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2019-11-08T06:48:40Z","title_canon_sha256":"d8a008519b9f2ef43f869e4c19e1cb977a8dfdbdf4dc5d14382432fd121759a2"},"schema_version":"1.0","source":{"id":"1911.03082","kind":"arxiv","version":2}},"canonical_sha256":"a4c9565d0d30c24332ba40d30487f1bef83e44d04b6466f104627c6cc647e8a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a4c9565d0d30c24332ba40d30487f1bef83e44d04b6466f104627c6cc647e8a0","first_computed_at":"2026-07-05T00:34:19.183173Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:34:19.183173Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"klC05iFoHgyi9IB7AMd1PSSqaM+dsdqC+oZ2vHF1KB0kERazMXuDxyjv2DeNwq6IwaJf9NeMKqhMpRSC6ci2Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T00:34:19.183649Z","signed_message":"canonical_sha256_bytes"},"source_id":"1911.03082","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bb36b41e0b570b73810f8b3086a309581b64c8cb03a23efac1784875801ebc3c","sha256:b7f307bdcf90d6a5bf587402c3e2b06fe3441d011562d28a09e875d11f23ef96"],"state_sha256":"d27c93d18396e7a87c8c71b68e872de249f4b9d699053ae8f98b37022b029615"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2apHScYJ49xja1knhF1QhCufDkfJbphbDC731Z2hiDGNDTOVB2EDPERWZiLpWOj3LeVLapTc53fwSDm9VmzpCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T16:22:27.187628Z","bundle_sha256":"03175fad03a596518136ba15816a9fdc1df21fdb1f115b7ad97530b2b25baa86"}}