{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:K25DKDLVQSMQX73WW4Y4X7H67Y","short_pith_number":"pith:K25DKDLV","schema_version":"1.0","canonical_sha256":"56ba350d7584990bff76b731cbfcfefe3eba8548e6bef9664191fc48f8212dd9","source":{"kind":"arxiv","id":"2406.00943","version":2},"attestation_state":"computed","paper":{"title":"State Space Models on Temporal Graphs: A First-Principles Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boqun Ma, Jintang Li, Liang Chen, Ruofan Wu, Xinzhou Jin, Zibin Zheng","submitted_at":"2024-06-03T02:56:11Z","abstract_excerpt":"Over the past few years, research on deep graph learning has shifted from static graphs to temporal graphs in response to real-world complex systems that exhibit dynamic behaviors. In practice, temporal graphs are formalized as an ordered sequence of static graph snapshots observed at discrete time points. Sequence models such as RNNs or Transformers have long been the predominant backbone networks for modeling such temporal graphs. Yet, despite the promising results, RNNs struggle with long-range dependencies, while transformers are burdened by quadratic computational complexity. Recently, st"},"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":"2406.00943","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-03T02:56:11Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"f09e3c7a420e0db92c26439a83fec5e7409322fe964797276990b207d750e6a1","abstract_canon_sha256":"824cb44558341ab1263ab3a6dd708770ca37e62d3826cd156b65d77ecdab3c18"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:54.764119Z","signature_b64":"WyXXTl9mIS+6AlUur97b/l/tHkDsHKwgcM19HlTVIbh6pJrheHBASCazIzf5BUMuCxCIPuQnjMix/hwP8o2PCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"56ba350d7584990bff76b731cbfcfefe3eba8548e6bef9664191fc48f8212dd9","last_reissued_at":"2026-07-05T09:27:54.763611Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:54.763611Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"State Space Models on Temporal Graphs: A First-Principles Study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Boqun Ma, Jintang Li, Liang Chen, Ruofan Wu, Xinzhou Jin, Zibin Zheng","submitted_at":"2024-06-03T02:56:11Z","abstract_excerpt":"Over the past few years, research on deep graph learning has shifted from static graphs to temporal graphs in response to real-world complex systems that exhibit dynamic behaviors. In practice, temporal graphs are formalized as an ordered sequence of static graph snapshots observed at discrete time points. Sequence models such as RNNs or Transformers have long been the predominant backbone networks for modeling such temporal graphs. Yet, despite the promising results, RNNs struggle with long-range dependencies, while transformers are burdened by quadratic computational complexity. Recently, st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.00943","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/2406.00943/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":"2406.00943","created_at":"2026-07-05T09:27:54.763675+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.00943v2","created_at":"2026-07-05T09:27:54.763675+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.00943","created_at":"2026-07-05T09:27:54.763675+00:00"},{"alias_kind":"pith_short_12","alias_value":"K25DKDLVQSMQ","created_at":"2026-07-05T09:27:54.763675+00:00"},{"alias_kind":"pith_short_16","alias_value":"K25DKDLVQSMQX73W","created_at":"2026-07-05T09:27:54.763675+00:00"},{"alias_kind":"pith_short_8","alias_value":"K25DKDLV","created_at":"2026-07-05T09:27:54.763675+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.18322","citing_title":"Exploring Graph Mamba: A Comprehensive Survey on State-Space Models for Graph Learning","ref_index":49,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y","json":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y.json","graph_json":"https://pith.science/api/pith-number/K25DKDLVQSMQX73WW4Y4X7H67Y/graph.json","events_json":"https://pith.science/api/pith-number/K25DKDLVQSMQX73WW4Y4X7H67Y/events.json","paper":"https://pith.science/paper/K25DKDLV"},"agent_actions":{"view_html":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y","download_json":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y.json","view_paper":"https://pith.science/paper/K25DKDLV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.00943&json=true","fetch_graph":"https://pith.science/api/pith-number/K25DKDLVQSMQX73WW4Y4X7H67Y/graph.json","fetch_events":"https://pith.science/api/pith-number/K25DKDLVQSMQX73WW4Y4X7H67Y/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y/action/storage_attestation","attest_author":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y/action/author_attestation","sign_citation":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y/action/citation_signature","submit_replication":"https://pith.science/pith/K25DKDLVQSMQX73WW4Y4X7H67Y/action/replication_record"}},"created_at":"2026-07-05T09:27:54.763675+00:00","updated_at":"2026-07-05T09:27:54.763675+00:00"}