{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:SQXPXS3KJDXQRCFWMG2L6BWUDY","short_pith_number":"pith:SQXPXS3K","canonical_record":{"source":{"id":"2309.12694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-22T08:09:55Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5b84e321b62bb6a41d094a666e1ae1def3267194320ca045d358c22352b0b2a6","abstract_canon_sha256":"9f99b3cfc7bc2b32f44b47103275e06fbe33ab54837a23d8d4957c5d0b22572c"},"schema_version":"1.0"},"canonical_sha256":"942efbcb6a48ef0888b661b4bf06d41e3a12993d80d38fa32ef10b7952db42f2","source":{"kind":"arxiv","id":"2309.12694","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.12694","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"arxiv_version","alias_value":"2309.12694v2","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12694","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"pith_short_12","alias_value":"SQXPXS3KJDXQ","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"pith_short_16","alias_value":"SQXPXS3KJDXQRCFW","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"pith_short_8","alias_value":"SQXPXS3K","created_at":"2026-07-05T06:54:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:SQXPXS3KJDXQRCFWMG2L6BWUDY","target":"record","payload":{"canonical_record":{"source":{"id":"2309.12694","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-22T08:09:55Z","cross_cats_sorted":["cs.SI"],"title_canon_sha256":"5b84e321b62bb6a41d094a666e1ae1def3267194320ca045d358c22352b0b2a6","abstract_canon_sha256":"9f99b3cfc7bc2b32f44b47103275e06fbe33ab54837a23d8d4957c5d0b22572c"},"schema_version":"1.0"},"canonical_sha256":"942efbcb6a48ef0888b661b4bf06d41e3a12993d80d38fa32ef10b7952db42f2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:54:23.564277Z","signature_b64":"bx72OooTh50slFc0abjcViUn5n1Xvnwg6fpbK+XdaGNWD/x942bhTqIfBEMau8tsQ0tT4nsV4VXdyUFX777PDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"942efbcb6a48ef0888b661b4bf06d41e3a12993d80d38fa32ef10b7952db42f2","last_reissued_at":"2026-07-05T06:54:23.563867Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:54:23.563867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2309.12694","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:54:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1LpW2yhPBUr5IH7FWmAw9ic29AiqJik9R/o1rGELOsg++SkniMrLn3LzU/7T24nZ2HaVfC5tGSKTrDP5mX4yDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:19:53.566765Z"},"content_sha256":"46104a99a4f97262bb37ca7bd2ea552c33473addcee47424bffb3aacd4cce76a","schema_version":"1.0","event_id":"sha256:46104a99a4f97262bb37ca7bd2ea552c33473addcee47424bffb3aacd4cce76a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:SQXPXS3KJDXQRCFWMG2L6BWUDY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Recurrent Temporal Revision Graph Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SI"],"primary_cat":"cs.LG","authors_text":"Anxiang Zeng, Cao Yuanpeng, Guangda Huzhang, Han Yu, Kangle Wu, Kerui Zhang, Qingtao Yu, Yizhou Chen, Zhiming Zhou","submitted_at":"2023-09-22T08:09:55Z","abstract_excerpt":"Temporal graphs offer more accurate modeling of many real-world scenarios than static graphs. However, neighbor aggregation, a critical building block of graph networks, for temporal graphs, is currently straightforwardly extended from that of static graphs. It can be computationally expensive when involving all historical neighbors during such aggregation. In practice, typically only a subset of the most recent neighbors are involved. However, such subsampling leads to incomplete and biased neighbor information. To address this limitation, we propose a novel framework for temporal neighbor ag"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12694","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/2309.12694/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T06:54:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BL520XJBxrbwzNppjgJXWFEG6Gw+YVZyPd95U4o1HollREKaW/x9h9K1oq3f6/QqBKLA+m3/3EwpZNyoVkWOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T08:19:53.567219Z"},"content_sha256":"df4fae91b2b3fcc0713125235c0dbccbd4e124189ea8bbe9957a6dbea03eaf09","schema_version":"1.0","event_id":"sha256:df4fae91b2b3fcc0713125235c0dbccbd4e124189ea8bbe9957a6dbea03eaf09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SQXPXS3KJDXQRCFWMG2L6BWUDY/bundle.json","state_url":"https://pith.science/pith/SQXPXS3KJDXQRCFWMG2L6BWUDY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SQXPXS3KJDXQRCFWMG2L6BWUDY/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T08:19:53Z","links":{"resolver":"https://pith.science/pith/SQXPXS3KJDXQRCFWMG2L6BWUDY","bundle":"https://pith.science/pith/SQXPXS3KJDXQRCFWMG2L6BWUDY/bundle.json","state":"https://pith.science/pith/SQXPXS3KJDXQRCFWMG2L6BWUDY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SQXPXS3KJDXQRCFWMG2L6BWUDY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:SQXPXS3KJDXQRCFWMG2L6BWUDY","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"9f99b3cfc7bc2b32f44b47103275e06fbe33ab54837a23d8d4957c5d0b22572c","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-22T08:09:55Z","title_canon_sha256":"5b84e321b62bb6a41d094a666e1ae1def3267194320ca045d358c22352b0b2a6"},"schema_version":"1.0","source":{"id":"2309.12694","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2309.12694","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"arxiv_version","alias_value":"2309.12694v2","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2309.12694","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"pith_short_12","alias_value":"SQXPXS3KJDXQ","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"pith_short_16","alias_value":"SQXPXS3KJDXQRCFW","created_at":"2026-07-05T06:54:23Z"},{"alias_kind":"pith_short_8","alias_value":"SQXPXS3K","created_at":"2026-07-05T06:54:23Z"}],"graph_snapshots":[{"event_id":"sha256:df4fae91b2b3fcc0713125235c0dbccbd4e124189ea8bbe9957a6dbea03eaf09","target":"graph","created_at":"2026-07-05T06:54:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2309.12694/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Temporal graphs offer more accurate modeling of many real-world scenarios than static graphs. However, neighbor aggregation, a critical building block of graph networks, for temporal graphs, is currently straightforwardly extended from that of static graphs. It can be computationally expensive when involving all historical neighbors during such aggregation. In practice, typically only a subset of the most recent neighbors are involved. However, such subsampling leads to incomplete and biased neighbor information. To address this limitation, we propose a novel framework for temporal neighbor ag","authors_text":"Anxiang Zeng, Cao Yuanpeng, Guangda Huzhang, Han Yu, Kangle Wu, Kerui Zhang, Qingtao Yu, Yizhou Chen, Zhiming Zhou","cross_cats":["cs.SI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-22T08:09:55Z","title":"Recurrent Temporal Revision Graph Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2309.12694","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:46104a99a4f97262bb37ca7bd2ea552c33473addcee47424bffb3aacd4cce76a","target":"record","created_at":"2026-07-05T06:54:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"9f99b3cfc7bc2b32f44b47103275e06fbe33ab54837a23d8d4957c5d0b22572c","cross_cats_sorted":["cs.SI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-09-22T08:09:55Z","title_canon_sha256":"5b84e321b62bb6a41d094a666e1ae1def3267194320ca045d358c22352b0b2a6"},"schema_version":"1.0","source":{"id":"2309.12694","kind":"arxiv","version":2}},"canonical_sha256":"942efbcb6a48ef0888b661b4bf06d41e3a12993d80d38fa32ef10b7952db42f2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"942efbcb6a48ef0888b661b4bf06d41e3a12993d80d38fa32ef10b7952db42f2","first_computed_at":"2026-07-05T06:54:23.563867Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:54:23.563867Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bx72OooTh50slFc0abjcViUn5n1Xvnwg6fpbK+XdaGNWD/x942bhTqIfBEMau8tsQ0tT4nsV4VXdyUFX777PDw==","signature_status":"signed_v1","signed_at":"2026-07-05T06:54:23.564277Z","signed_message":"canonical_sha256_bytes"},"source_id":"2309.12694","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:46104a99a4f97262bb37ca7bd2ea552c33473addcee47424bffb3aacd4cce76a","sha256:df4fae91b2b3fcc0713125235c0dbccbd4e124189ea8bbe9957a6dbea03eaf09"],"state_sha256":"3e1a2855ec702b4a037a57f3f9d60c7223bb20aab85d3ff484b0290b8cc3b1aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AnVCaT4OIg/JTAuGtlFYBRM+pc1QucT/cA4p2+ItlargSazvuQiAX7y8WImfOkbwLSXCzQ6bJlwGjrdX/TotDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T08:19:53.569145Z","bundle_sha256":"d72c394675e0cdedc0fa3c3dd70e1b262a1a30c1cf1563cb806155578c77b4a3"}}