{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:53TNOXFHM4J7RRSJQNOUDV62W5","short_pith_number":"pith:53TNOXFH","schema_version":"1.0","canonical_sha256":"eee6d75ca76713f8c649835d41d7dab77a917a0b4053446bb16ffe57656764cd","source":{"kind":"arxiv","id":"2505.15746","version":1},"attestation_state":"computed","paper":{"title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Harry Shomer, Jiliang Tang, Jingzhe Liu, Kaveh Hassani, Yan Xie, Yu Song, Zhigang Hua","submitted_at":"2025-05-21T16:51:44Z","abstract_excerpt":"Temporal Graph Neural Networks (TGNNs) have gained growing attention for modeling and predicting structures in temporal graphs. However, existing TGNNs primarily focus on pairwise interactions while overlooking higher-order structures that are integral to link formation and evolution in real-world temporal graphs. Meanwhile, these models often suffer from efficiency bottlenecks, further limiting their expressive power. To tackle these challenges, we propose a Higher-order structure Temporal Graph Neural Network, which incorporates hypergraph representations into temporal graph learning. In par"},"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":"2505.15746","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-05-21T16:51:44Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"1f73f91100c75d81866d30f19327344d02ed9b618415150266d68b628f10ba19","abstract_canon_sha256":"fb53835ddc6bc6f655e6671fc56559e1d8911fb05b4f1089173c3cd5936cc77f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:06:57.425663Z","signature_b64":"tmsSNK/NEX6LQVcuK+RD+sq2zfr1aygzrIkuPWp3nKfgdG54Jx/W8HyKHRmAXxGnsA84pxseKHDTYap5Zwf4Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eee6d75ca76713f8c649835d41d7dab77a917a0b4053446bb16ffe57656764cd","last_reissued_at":"2026-07-05T11:06:57.425214Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:06:57.425214Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Higher-order Structure Boosts Link Prediction on Temporal Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Bingheng Li, Harry Shomer, Jiliang Tang, Jingzhe Liu, Kaveh Hassani, Yan Xie, Yu Song, Zhigang Hua","submitted_at":"2025-05-21T16:51:44Z","abstract_excerpt":"Temporal Graph Neural Networks (TGNNs) have gained growing attention for modeling and predicting structures in temporal graphs. However, existing TGNNs primarily focus on pairwise interactions while overlooking higher-order structures that are integral to link formation and evolution in real-world temporal graphs. Meanwhile, these models often suffer from efficiency bottlenecks, further limiting their expressive power. To tackle these challenges, we propose a Higher-order structure Temporal Graph Neural Network, which incorporates hypergraph representations into temporal graph learning. In par"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.15746","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/2505.15746/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":"2505.15746","created_at":"2026-07-05T11:06:57.425274+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.15746v1","created_at":"2026-07-05T11:06:57.425274+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.15746","created_at":"2026-07-05T11:06:57.425274+00:00"},{"alias_kind":"pith_short_12","alias_value":"53TNOXFHM4J7","created_at":"2026-07-05T11:06:57.425274+00:00"},{"alias_kind":"pith_short_16","alias_value":"53TNOXFHM4J7RRSJ","created_at":"2026-07-05T11:06:57.425274+00:00"},{"alias_kind":"pith_short_8","alias_value":"53TNOXFH","created_at":"2026-07-05T11:06:57.425274+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.20089","citing_title":"Homophily Enhanced Graph Domain Adaptation","ref_index":2021,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5","json":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5.json","graph_json":"https://pith.science/api/pith-number/53TNOXFHM4J7RRSJQNOUDV62W5/graph.json","events_json":"https://pith.science/api/pith-number/53TNOXFHM4J7RRSJQNOUDV62W5/events.json","paper":"https://pith.science/paper/53TNOXFH"},"agent_actions":{"view_html":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5","download_json":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5.json","view_paper":"https://pith.science/paper/53TNOXFH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.15746&json=true","fetch_graph":"https://pith.science/api/pith-number/53TNOXFHM4J7RRSJQNOUDV62W5/graph.json","fetch_events":"https://pith.science/api/pith-number/53TNOXFHM4J7RRSJQNOUDV62W5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5/action/storage_attestation","attest_author":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5/action/author_attestation","sign_citation":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5/action/citation_signature","submit_replication":"https://pith.science/pith/53TNOXFHM4J7RRSJQNOUDV62W5/action/replication_record"}},"created_at":"2026-07-05T11:06:57.425274+00:00","updated_at":"2026-07-05T11:06:57.425274+00:00"}