{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:TMXJ4ZSMYGNDJ3S7BQ2YG2M777","short_pith_number":"pith:TMXJ4ZSM","canonical_record":{"source":{"id":"1611.03959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-12T06:22:28Z","cross_cats_sorted":[],"title_canon_sha256":"95ef8d838578f1c6677f39bd3d5c950ab8f06a95a568f19c1ce50d3f07132fe3","abstract_canon_sha256":"e9678c74e7e418383fdfb8e9f6e683c202d73ef90703ed43f982bd65a2df69a7"},"schema_version":"1.0"},"canonical_sha256":"9b2e9e664cc19a34ee5f0c3583699fffef1971617b24a2c9b216899472fdc751","source":{"kind":"arxiv","id":"1611.03959","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03959","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03959v2","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03959","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"TMXJ4ZSMYGND","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMXJ4ZSMYGNDJ3S7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMXJ4ZSM","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:TMXJ4ZSMYGNDJ3S7BQ2YG2M777","target":"record","payload":{"canonical_record":{"source":{"id":"1611.03959","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-12T06:22:28Z","cross_cats_sorted":[],"title_canon_sha256":"95ef8d838578f1c6677f39bd3d5c950ab8f06a95a568f19c1ce50d3f07132fe3","abstract_canon_sha256":"e9678c74e7e418383fdfb8e9f6e683c202d73ef90703ed43f982bd65a2df69a7"},"schema_version":"1.0"},"canonical_sha256":"9b2e9e664cc19a34ee5f0c3583699fffef1971617b24a2c9b216899472fdc751","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:55.515761Z","signature_b64":"SNHzzT4/Au/4PmaaWqu3SEsHg/sVMGc5bGgXQixHfm7b5L8I95k4tWn7pREdpMSqEVNnd+N4tshc4Vo4sWkcBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b2e9e664cc19a34ee5f0c3583699fffef1971617b24a2c9b216899472fdc751","last_reissued_at":"2026-05-18T00:32:55.514972Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:55.514972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1611.03959","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-05-18T00:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oB6HAtW2JPRGjYiaLHNY7G3bixipxYz7dRQ9IHZbKy22WYObpc9ikNSXBXvPo95BD2m0/bGvfkvnpv/9BVL6BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:50:38.128136Z"},"content_sha256":"767152c5f34d60fa0cc2ad4db8892767e8aa4347b78d8065beaa26029c08ff02","schema_version":"1.0","event_id":"sha256:767152c5f34d60fa0cc2ad4db8892767e8aa4347b78d8065beaa26029c08ff02"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:TMXJ4ZSMYGNDJ3S7BQ2YG2M777","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Smart Query Routing: For Distributed Graph Querying with Decoupled Storage","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DB","authors_text":"Arijit Khan, Donald Kossmann, Gustavo Segovia","submitted_at":"2016-11-12T06:22:28Z","abstract_excerpt":"We study online graph queries that retrieve nearby nodes of a query node from a large network. To answer such queries with high throughput and low latency, we partition the graph and process the data in parallel across a cluster of servers. State-of-the-art distributed graph querying systems place each graph partition on a separate server, where query answering over that partition takes place. This design has two major disadvantages. First, the router needs to maintain a fixed routing table. Hence, these systems are less flexible with respect to query routing, fault tolerance, and graph update"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03959","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":""},"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-05-18T00:32:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gkSS5IfWblYl1eaDcdatCGKJ+NULVl8cjv3bG3PpmsoMBojYCAiWismfHa4OiClpiUpAbxBM9r97qpN+2rYOAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T20:50:38.128834Z"},"content_sha256":"9d7f2a1ea70b5a7df49eea9ae1798a9dbc689266d7648bebf83394597b4e16e6","schema_version":"1.0","event_id":"sha256:9d7f2a1ea70b5a7df49eea9ae1798a9dbc689266d7648bebf83394597b4e16e6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TMXJ4ZSMYGNDJ3S7BQ2YG2M777/bundle.json","state_url":"https://pith.science/pith/TMXJ4ZSMYGNDJ3S7BQ2YG2M777/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TMXJ4ZSMYGNDJ3S7BQ2YG2M777/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-06-07T20:50:38Z","links":{"resolver":"https://pith.science/pith/TMXJ4ZSMYGNDJ3S7BQ2YG2M777","bundle":"https://pith.science/pith/TMXJ4ZSMYGNDJ3S7BQ2YG2M777/bundle.json","state":"https://pith.science/pith/TMXJ4ZSMYGNDJ3S7BQ2YG2M777/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TMXJ4ZSMYGNDJ3S7BQ2YG2M777/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:TMXJ4ZSMYGNDJ3S7BQ2YG2M777","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":"e9678c74e7e418383fdfb8e9f6e683c202d73ef90703ed43f982bd65a2df69a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-12T06:22:28Z","title_canon_sha256":"95ef8d838578f1c6677f39bd3d5c950ab8f06a95a568f19c1ce50d3f07132fe3"},"schema_version":"1.0","source":{"id":"1611.03959","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.03959","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"arxiv_version","alias_value":"1611.03959v2","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.03959","created_at":"2026-05-18T00:32:55Z"},{"alias_kind":"pith_short_12","alias_value":"TMXJ4ZSMYGND","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"TMXJ4ZSMYGNDJ3S7","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"TMXJ4ZSM","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:9d7f2a1ea70b5a7df49eea9ae1798a9dbc689266d7648bebf83394597b4e16e6","target":"graph","created_at":"2026-05-18T00:32:55Z","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":"We study online graph queries that retrieve nearby nodes of a query node from a large network. To answer such queries with high throughput and low latency, we partition the graph and process the data in parallel across a cluster of servers. State-of-the-art distributed graph querying systems place each graph partition on a separate server, where query answering over that partition takes place. This design has two major disadvantages. First, the router needs to maintain a fixed routing table. Hence, these systems are less flexible with respect to query routing, fault tolerance, and graph update","authors_text":"Arijit Khan, Donald Kossmann, Gustavo Segovia","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-12T06:22:28Z","title":"On Smart Query Routing: For Distributed Graph Querying with Decoupled Storage"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.03959","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:767152c5f34d60fa0cc2ad4db8892767e8aa4347b78d8065beaa26029c08ff02","target":"record","created_at":"2026-05-18T00:32:55Z","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":"e9678c74e7e418383fdfb8e9f6e683c202d73ef90703ed43f982bd65a2df69a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2016-11-12T06:22:28Z","title_canon_sha256":"95ef8d838578f1c6677f39bd3d5c950ab8f06a95a568f19c1ce50d3f07132fe3"},"schema_version":"1.0","source":{"id":"1611.03959","kind":"arxiv","version":2}},"canonical_sha256":"9b2e9e664cc19a34ee5f0c3583699fffef1971617b24a2c9b216899472fdc751","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b2e9e664cc19a34ee5f0c3583699fffef1971617b24a2c9b216899472fdc751","first_computed_at":"2026-05-18T00:32:55.514972Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:32:55.514972Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SNHzzT4/Au/4PmaaWqu3SEsHg/sVMGc5bGgXQixHfm7b5L8I95k4tWn7pREdpMSqEVNnd+N4tshc4Vo4sWkcBw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:32:55.515761Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.03959","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:767152c5f34d60fa0cc2ad4db8892767e8aa4347b78d8065beaa26029c08ff02","sha256:9d7f2a1ea70b5a7df49eea9ae1798a9dbc689266d7648bebf83394597b4e16e6"],"state_sha256":"4492d306ae6eddf1bc18cda37fc9749d1f47662c7e93b24b093bf524e4def012"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6AbknaQfE7SxB1WRSUG7rZiPwUaiUZMQq12c07nRfiIkSqRKuPtJet726VZJ6HrqDZWKxW6Ih42vAg0mYLG9BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T20:50:38.132587Z","bundle_sha256":"1da8e2f56a1d6120ae4d27ae0132ca02a2c15bd6fd11de0dfefd52974d229fa3"}}