{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:O5PU7O7YLKK744H4FTM5X22GMN","short_pith_number":"pith:O5PU7O7Y","schema_version":"1.0","canonical_sha256":"775f4fbbf85a95fe70fc2cd9dbeb46637b7691c9f2c2afac19293fa2067436e3","source":{"kind":"arxiv","id":"1208.0091","version":1},"attestation_state":"computed","paper":{"title":"Performance Guarantees for Distributed Reachability Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Wenfei Fan, Xin Wang, Yinghui Wu","submitted_at":"2012-08-01T03:56:31Z","abstract_excerpt":"In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs. This paper proposes distributed evaluation algorithms for three classes of queries: reachability for determining whether one node can reach another, bounded reachability for deciding whether there exists a path of a bounded length between a pair of nodes, and regular reachability for checking whether there exists a path connecting two nodes such that the node labels on the path form a string in a given regular expression. We develop these "},"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":"1208.0091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-08-01T03:56:31Z","cross_cats_sorted":[],"title_canon_sha256":"e4ab98da1fca4ed07b1b9b94eccec0171b618ebe0aeb78eff79db7ab51e0432b","abstract_canon_sha256":"234aad5b81aa5f265fa89707579c2f6384d37c950c6acdf630fc0d93d2c394d8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:49:36.306000Z","signature_b64":"aTvW+Nh3tnk2NUc+LzOSS3F812zQXZ6tqPI48aFPr1gJvULNIndeoxtWd+X2suH9kL0LoAsok89nUo3sSpPDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"775f4fbbf85a95fe70fc2cd9dbeb46637b7691c9f2c2afac19293fa2067436e3","last_reissued_at":"2026-05-18T03:49:36.305363Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:49:36.305363Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Performance Guarantees for Distributed Reachability Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Wenfei Fan, Xin Wang, Yinghui Wu","submitted_at":"2012-08-01T03:56:31Z","abstract_excerpt":"In the real world a graph is often fragmented and distributed across different sites. This highlights the need for evaluating queries on distributed graphs. This paper proposes distributed evaluation algorithms for three classes of queries: reachability for determining whether one node can reach another, bounded reachability for deciding whether there exists a path of a bounded length between a pair of nodes, and regular reachability for checking whether there exists a path connecting two nodes such that the node labels on the path form a string in a given regular expression. We develop these "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.0091","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1208.0091","created_at":"2026-05-18T03:49:36.305468+00:00"},{"alias_kind":"arxiv_version","alias_value":"1208.0091v1","created_at":"2026-05-18T03:49:36.305468+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.0091","created_at":"2026-05-18T03:49:36.305468+00:00"},{"alias_kind":"pith_short_12","alias_value":"O5PU7O7YLKK7","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"O5PU7O7YLKK744H4","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"O5PU7O7Y","created_at":"2026-05-18T12:27:16.716162+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN","json":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN.json","graph_json":"https://pith.science/api/pith-number/O5PU7O7YLKK744H4FTM5X22GMN/graph.json","events_json":"https://pith.science/api/pith-number/O5PU7O7YLKK744H4FTM5X22GMN/events.json","paper":"https://pith.science/paper/O5PU7O7Y"},"agent_actions":{"view_html":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN","download_json":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN.json","view_paper":"https://pith.science/paper/O5PU7O7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1208.0091&json=true","fetch_graph":"https://pith.science/api/pith-number/O5PU7O7YLKK744H4FTM5X22GMN/graph.json","fetch_events":"https://pith.science/api/pith-number/O5PU7O7YLKK744H4FTM5X22GMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN/action/storage_attestation","attest_author":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN/action/author_attestation","sign_citation":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN/action/citation_signature","submit_replication":"https://pith.science/pith/O5PU7O7YLKK744H4FTM5X22GMN/action/replication_record"}},"created_at":"2026-05-18T03:49:36.305468+00:00","updated_at":"2026-05-18T03:49:36.305468+00:00"}