{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UTEVMXINGDBEGMV2IDJQJB7RX3","short_pith_number":"pith:UTEVMXIN","schema_version":"1.0","canonical_sha256":"a4c9565d0d30c24332ba40d30487f1bef83e44d04b6466f104627c6cc647e8a0","source":{"kind":"arxiv","id":"1911.03082","version":2},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1911.03082","created_at":"2026-07-05T00:34:19.183243+00:00"},{"alias_kind":"arxiv_version","alias_value":"1911.03082v2","created_at":"2026-07-05T00:34:19.183243+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1911.03082","created_at":"2026-07-05T00:34:19.183243+00:00"},{"alias_kind":"pith_short_12","alias_value":"UTEVMXINGDBE","created_at":"2026-07-05T00:34:19.183243+00:00"},{"alias_kind":"pith_short_16","alias_value":"UTEVMXINGDBEGMV2","created_at":"2026-07-05T00:34:19.183243+00:00"},{"alias_kind":"pith_short_8","alias_value":"UTEVMXIN","created_at":"2026-07-05T00:34:19.183243+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":5,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.25497","citing_title":"SAGE-Nav: Leveraging LLM Planning and Alignment Fusion for Hierarchical Scene Graph-Guided Navigation","ref_index":43,"is_internal_anchor":false},{"citing_arxiv_id":"2606.20208","citing_title":"Beyond Accuracy: Measuring Logical Compliance of Predictive Models","ref_index":22,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07583","citing_title":"Outage Detection in Self-Healing Smart Grids Using Reinforcement Learning with Spectral Graph Neural Networks","ref_index":45,"is_internal_anchor":false},{"citing_arxiv_id":"2605.07999","citing_title":"Graph-Structured Hyperdimensional Computing for Data-Efficient and Explainable Process-Structure-Property Prediction","ref_index":38,"is_internal_anchor":false},{"citing_arxiv_id":"2604.18344","citing_title":"One Pass for All: A Discrete Diffusion Model for Knowledge Graph Triple Set Prediction","ref_index":34,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3","json":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3.json","graph_json":"https://pith.science/api/pith-number/UTEVMXINGDBEGMV2IDJQJB7RX3/graph.json","events_json":"https://pith.science/api/pith-number/UTEVMXINGDBEGMV2IDJQJB7RX3/events.json","paper":"https://pith.science/paper/UTEVMXIN"},"agent_actions":{"view_html":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3","download_json":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3.json","view_paper":"https://pith.science/paper/UTEVMXIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1911.03082&json=true","fetch_graph":"https://pith.science/api/pith-number/UTEVMXINGDBEGMV2IDJQJB7RX3/graph.json","fetch_events":"https://pith.science/api/pith-number/UTEVMXINGDBEGMV2IDJQJB7RX3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/action/storage_attestation","attest_author":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/action/author_attestation","sign_citation":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/action/citation_signature","submit_replication":"https://pith.science/pith/UTEVMXINGDBEGMV2IDJQJB7RX3/action/replication_record"}},"created_at":"2026-07-05T00:34:19.183243+00:00","updated_at":"2026-07-05T00:34:19.183243+00:00"}