{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KYNIILEJVYRBNDX2IRPTDJ35CY","short_pith_number":"pith:KYNIILEJ","schema_version":"1.0","canonical_sha256":"561a842c89ae22168efa445f31a77d161186f4cdaf5c477df8d945220d41a12d","source":{"kind":"arxiv","id":"2005.05537","version":1},"attestation_state":"computed","paper":{"title":"GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Defu Lian, Hanchen Wang, Lu Qin, Xuemin Lin, Ying Zhang","submitted_at":"2020-05-12T03:46:15Z","abstract_excerpt":"Entity interaction prediction is essential in many important applications such as chemistry, biology, material science, and medical science. The problem becomes quite challenging when each entity is represented by a complex structure, namely structured entity, because two types of graphs are involved: local graphs for structured entities and a global graph to capture the interactions between structured entities. We observe that existing works on structured entity interaction prediction cannot properly exploit the unique graph of graphs model. In this paper, we propose a Graph of Graphs Neural "},"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":"2005.05537","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2020-05-12T03:46:15Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"bab467d9bd8cdf51cbec5e4b14e0dac59ef3a3e91055e36a8a4880dd91de7408","abstract_canon_sha256":"68a9dcbf730c2917943882ef25164889af8c1b8c589c85d936a668c35a395ba5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:30:57.647577Z","signature_b64":"oxc7LyCfUUqquFRA89xBxq8sFs5aL3ujxqzBKH+Ig7SgSROpS4OkBQnwwpqDMLBrLoKMsdOKNlqbU+T0avSbDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"561a842c89ae22168efa445f31a77d161186f4cdaf5c477df8d945220d41a12d","last_reissued_at":"2026-07-05T02:30:57.647056Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:30:57.647056Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Defu Lian, Hanchen Wang, Lu Qin, Xuemin Lin, Ying Zhang","submitted_at":"2020-05-12T03:46:15Z","abstract_excerpt":"Entity interaction prediction is essential in many important applications such as chemistry, biology, material science, and medical science. The problem becomes quite challenging when each entity is represented by a complex structure, namely structured entity, because two types of graphs are involved: local graphs for structured entities and a global graph to capture the interactions between structured entities. We observe that existing works on structured entity interaction prediction cannot properly exploit the unique graph of graphs model. In this paper, we propose a Graph of Graphs Neural "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2005.05537","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2005.05537/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":"2005.05537","created_at":"2026-07-05T02:30:57.647120+00:00"},{"alias_kind":"arxiv_version","alias_value":"2005.05537v1","created_at":"2026-07-05T02:30:57.647120+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2005.05537","created_at":"2026-07-05T02:30:57.647120+00:00"},{"alias_kind":"pith_short_12","alias_value":"KYNIILEJVYRB","created_at":"2026-07-05T02:30:57.647120+00:00"},{"alias_kind":"pith_short_16","alias_value":"KYNIILEJVYRBNDX2","created_at":"2026-07-05T02:30:57.647120+00:00"},{"alias_kind":"pith_short_8","alias_value":"KYNIILEJ","created_at":"2026-07-05T02:30:57.647120+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2509.02113","citing_title":"HiGraph: A Large-Scale Hierarchical Graph Dataset for Malware Analysis","ref_index":28,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY","json":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY.json","graph_json":"https://pith.science/api/pith-number/KYNIILEJVYRBNDX2IRPTDJ35CY/graph.json","events_json":"https://pith.science/api/pith-number/KYNIILEJVYRBNDX2IRPTDJ35CY/events.json","paper":"https://pith.science/paper/KYNIILEJ"},"agent_actions":{"view_html":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY","download_json":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY.json","view_paper":"https://pith.science/paper/KYNIILEJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2005.05537&json=true","fetch_graph":"https://pith.science/api/pith-number/KYNIILEJVYRBNDX2IRPTDJ35CY/graph.json","fetch_events":"https://pith.science/api/pith-number/KYNIILEJVYRBNDX2IRPTDJ35CY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY/action/storage_attestation","attest_author":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY/action/author_attestation","sign_citation":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY/action/citation_signature","submit_replication":"https://pith.science/pith/KYNIILEJVYRBNDX2IRPTDJ35CY/action/replication_record"}},"created_at":"2026-07-05T02:30:57.647120+00:00","updated_at":"2026-07-05T02:30:57.647120+00:00"}