{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:JNIVFHP4LAU6QAPBYSXYYBA4OH","short_pith_number":"pith:JNIVFHP4","schema_version":"1.0","canonical_sha256":"4b51529dfc5829e801e1c4af8c041c71de4bba45279b3b31e2e36ecd75be0c7c","source":{"kind":"arxiv","id":"2302.07491","version":3},"attestation_state":"computed","paper":{"title":"Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Ke Liang, Kunlun He, Meng Liu, Sihang Zhou, Wenxuan Tu, Xinbiao Gan, Xinwang Liu, Yawei Zhao","submitted_at":"2023-02-15T06:36:04Z","abstract_excerpt":"Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information, which has recently garnered increasing attention. In contrast to static graphs, temporal graphs are typically organized as node interaction sequences over continuous time rather than an adjacency matrix. Most temporal graph learning methods model current interactions by incorporating historical neighborhood. However, such methods only consider first-order temporal information while disregarding crucial high-order structural information, resulting in suboptimal performance. To 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":"2302.07491","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-15T06:36:04Z","cross_cats_sorted":["cs.AI","cs.SI"],"title_canon_sha256":"24f9c5e43d58bff1917fc928e7be8d49577029d7071a1c0bbbba787565467997","abstract_canon_sha256":"294f397f1bed5827cc0c69517edafb85e7bb1ce932dd06babe4ef1df0885b05b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:12:42.459243Z","signature_b64":"Vb6RQaWiETYeehxt9a6kxtoOKmNASWOnnPIPx5IwC0DXOW2C+ElwFLA3LmMg6XZCuttzm94sdRTtckCeHC/PAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b51529dfc5829e801e1c4af8c041c71de4bba45279b3b31e2e36ecd75be0c7c","last_reissued_at":"2026-07-05T08:12:42.458736Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:12:42.458736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Supervised Temporal Graph learning with Temporal and Structural Intensity Alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","cs.SI"],"primary_cat":"cs.LG","authors_text":"Ke Liang, Kunlun He, Meng Liu, Sihang Zhou, Wenxuan Tu, Xinbiao Gan, Xinwang Liu, Yawei Zhao","submitted_at":"2023-02-15T06:36:04Z","abstract_excerpt":"Temporal graph learning aims to generate high-quality representations for graph-based tasks with dynamic information, which has recently garnered increasing attention. In contrast to static graphs, temporal graphs are typically organized as node interaction sequences over continuous time rather than an adjacency matrix. Most temporal graph learning methods model current interactions by incorporating historical neighborhood. However, such methods only consider first-order temporal information while disregarding crucial high-order structural information, resulting in suboptimal performance. To a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.07491","kind":"arxiv","version":3},"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/2302.07491/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":"2302.07491","created_at":"2026-07-05T08:12:42.458795+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.07491v3","created_at":"2026-07-05T08:12:42.458795+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.07491","created_at":"2026-07-05T08:12:42.458795+00:00"},{"alias_kind":"pith_short_12","alias_value":"JNIVFHP4LAU6","created_at":"2026-07-05T08:12:42.458795+00:00"},{"alias_kind":"pith_short_16","alias_value":"JNIVFHP4LAU6QAPB","created_at":"2026-07-05T08:12:42.458795+00:00"},{"alias_kind":"pith_short_8","alias_value":"JNIVFHP4","created_at":"2026-07-05T08:12:42.458795+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.19822","citing_title":"ST-TGExplainer: Disentangling Stability and Transition Patterns for Temporal GNN Interpretability","ref_index":14,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH","json":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH.json","graph_json":"https://pith.science/api/pith-number/JNIVFHP4LAU6QAPBYSXYYBA4OH/graph.json","events_json":"https://pith.science/api/pith-number/JNIVFHP4LAU6QAPBYSXYYBA4OH/events.json","paper":"https://pith.science/paper/JNIVFHP4"},"agent_actions":{"view_html":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH","download_json":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH.json","view_paper":"https://pith.science/paper/JNIVFHP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.07491&json=true","fetch_graph":"https://pith.science/api/pith-number/JNIVFHP4LAU6QAPBYSXYYBA4OH/graph.json","fetch_events":"https://pith.science/api/pith-number/JNIVFHP4LAU6QAPBYSXYYBA4OH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH/action/storage_attestation","attest_author":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH/action/author_attestation","sign_citation":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH/action/citation_signature","submit_replication":"https://pith.science/pith/JNIVFHP4LAU6QAPBYSXYYBA4OH/action/replication_record"}},"created_at":"2026-07-05T08:12:42.458795+00:00","updated_at":"2026-07-05T08:12:42.458795+00:00"}