{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EEAXZOWAEEQIGLJ3S77LHSMS27","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":"5f68d2566a39344172fb0a8f0b2c49005202c0c62aa0fa8cb465acd4ec4d1540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-01-22T08:49:39Z","title_canon_sha256":"15968339e0cf04814bd8b949ea6a67eeaf3caf7146ef33f79f7cd4a8b550e318"},"schema_version":"1.0","source":{"id":"1601.05909","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.05909","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"arxiv_version","alias_value":"1601.05909v2","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.05909","created_at":"2026-05-18T01:22:05Z"},{"alias_kind":"pith_short_12","alias_value":"EEAXZOWAEEQI","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EEAXZOWAEEQIGLJ3","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EEAXZOWA","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:d45f9c1344119218af8c61eece957c8a22c1acbb8edc895c4fb7808876c7f675","target":"graph","created_at":"2026-05-18T01:22:05Z","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"},"paper":{"abstract_excerpt":"A temporal graph is a graph in which vertices communicate with each other at specific time, e.g., $A$ calls $B$ at 11 a.m. and talks for 7 minutes, which is modeled by an edge from $A$ to $B$ with starting time \"11 a.m.\" and duration \"7 mins\". Temporal graphs can be used to model many networks with time-related activities, but efficient algorithms for analyzing temporal graphs are severely inadequate. We study fundamental problems such as answering reachability and time-based path queries in a temporal graph, and propose an efficient indexing technique specifically designed for processing thes","authors_text":"Huanhuan Wu, James Cheng, Jinfeng Li, Yiping Ke, Yuzhen Huang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-01-22T08:49:39Z","title":"Efficient Processing of Reachability and Time-Based Path Queries in a Temporal Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.05909","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:fcb9b212a7e637469c8fc68800e5d701af3421a828e086435596da865f092f5d","target":"record","created_at":"2026-05-18T01:22:05Z","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":"5f68d2566a39344172fb0a8f0b2c49005202c0c62aa0fa8cb465acd4ec4d1540","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-01-22T08:49:39Z","title_canon_sha256":"15968339e0cf04814bd8b949ea6a67eeaf3caf7146ef33f79f7cd4a8b550e318"},"schema_version":"1.0","source":{"id":"1601.05909","kind":"arxiv","version":2}},"canonical_sha256":"21017cbac02120832d3b97feb3c992d7c0520ba74d0bf2c78789038267d17a92","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"21017cbac02120832d3b97feb3c992d7c0520ba74d0bf2c78789038267d17a92","first_computed_at":"2026-05-18T01:22:05.264471Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:22:05.264471Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"m3Je1Yz/i9HfHnkH2D2+w1ZzOOxyC+x7ryfpAdkdVcon7mrIALJPm6ad7Alic/0BvqeFUB8S9CFmft8Co0+CAg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:22:05.265121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.05909","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fcb9b212a7e637469c8fc68800e5d701af3421a828e086435596da865f092f5d","sha256:d45f9c1344119218af8c61eece957c8a22c1acbb8edc895c4fb7808876c7f675"],"state_sha256":"0c13dbf661c78c1d05495a508b99a6a4f197d887dbf56845affa1525300ed7ea"}