{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:QXWCVNBSUPTT77NRXYO3NE4T7O","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":"fa1157dcfc8d46600b95898885ac77340041bd7cf5d005ea6544deedadb62180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T11:01:40Z","title_canon_sha256":"147ccb0dce19652962bdec90e9b5c93bd17f6268ec32dba51acff8049a4279f7"},"schema_version":"1.0","source":{"id":"1012.4938","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.4938","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"arxiv_version","alias_value":"1012.4938v1","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.4938","created_at":"2026-05-18T04:32:44Z"},{"alias_kind":"pith_short_12","alias_value":"QXWCVNBSUPTT","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_16","alias_value":"QXWCVNBSUPTT77NR","created_at":"2026-05-18T12:26:13Z"},{"alias_kind":"pith_short_8","alias_value":"QXWCVNBS","created_at":"2026-05-18T12:26:13Z"}],"graph_snapshots":[{"event_id":"sha256:c9aee1bbea7b55db70401234dc29758909a4525072e3935e2a94a57c665cfe96","target":"graph","created_at":"2026-05-18T04:32:44Z","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":"For a given collection G of directed graphs we define the join-reachability graph of G, denoted by J(G), as the directed graph that, for any pair of vertices a and b, contains a path from a to b if and only if such a path exists in all graphs of G. Our goal is to compute an efficient representation of J(G). In particular, we consider two versions of this problem. In the explicit version we wish to construct the smallest join-reachability graph for G. In the implicit version we wish to build an efficient data structure (in terms of space and query time) such that we can report fast the set of v","authors_text":"Leonidas Palios, Loukas Georgiadis, Stavros D. Nikolopoulos","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T11:01:40Z","title":"Join-Reachability Problems in Directed Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.4938","kind":"arxiv","version":1},"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:0feefbb84705dfe191a694dbd385ed828fa4d79054763ddd686be32d454a80cc","target":"record","created_at":"2026-05-18T04:32:44Z","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":"fa1157dcfc8d46600b95898885ac77340041bd7cf5d005ea6544deedadb62180","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-12-22T11:01:40Z","title_canon_sha256":"147ccb0dce19652962bdec90e9b5c93bd17f6268ec32dba51acff8049a4279f7"},"schema_version":"1.0","source":{"id":"1012.4938","kind":"arxiv","version":1}},"canonical_sha256":"85ec2ab432a3e73ffdb1be1db69393fba249ad005c3989ab6445845c124fcfce","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"85ec2ab432a3e73ffdb1be1db69393fba249ad005c3989ab6445845c124fcfce","first_computed_at":"2026-05-18T04:32:44.864371Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:32:44.864371Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ihLLSOWR8S79upaxLZNGSv075dpdzSITxvsc9Q/k2XLa7VBuRhKHBgfJexONwkdOFmb8e2tAFjwyfqG3xz/WDw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:32:44.865039Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.4938","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0feefbb84705dfe191a694dbd385ed828fa4d79054763ddd686be32d454a80cc","sha256:c9aee1bbea7b55db70401234dc29758909a4525072e3935e2a94a57c665cfe96"],"state_sha256":"ed6fa4f7e924431a1548e113bb93b1c19596733f766098c228b6334f55fd4ea7"}