{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:4B5SEDM6PPZW4XFXT2GKR2CIGK","short_pith_number":"pith:4B5SEDM6","canonical_record":{"source":{"id":"1703.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-22T16:28:17Z","cross_cats_sorted":[],"title_canon_sha256":"2bc261b58488fa810ffb980b595a29ba0cc133b4bb83454fb51895c2d560ed5a","abstract_canon_sha256":"18d9e6dd997ba31035f228bbab57497333e720825104ee75433a82871ac74151"},"schema_version":"1.0"},"canonical_sha256":"e07b220d9e7bf36e5cb79e8ca8e848329cd97a216bceffc582abfb87f48d8e83","source":{"kind":"arxiv","id":"1703.07734","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07734","created_at":"2026-05-18T00:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07734v1","created_at":"2026-05-18T00:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07734","created_at":"2026-05-18T00:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"4B5SEDM6PPZW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4B5SEDM6PPZW4XFX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4B5SEDM6","created_at":"2026-05-18T12:30:58Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:4B5SEDM6PPZW4XFXT2GKR2CIGK","target":"record","payload":{"canonical_record":{"source":{"id":"1703.07734","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-22T16:28:17Z","cross_cats_sorted":[],"title_canon_sha256":"2bc261b58488fa810ffb980b595a29ba0cc133b4bb83454fb51895c2d560ed5a","abstract_canon_sha256":"18d9e6dd997ba31035f228bbab57497333e720825104ee75433a82871ac74151"},"schema_version":"1.0"},"canonical_sha256":"e07b220d9e7bf36e5cb79e8ca8e848329cd97a216bceffc582abfb87f48d8e83","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:48:06.271672Z","signature_b64":"rc+hDPKQQbj5bW3+aYxQQ1okGFJxGmjyPY7yf/O/O1nRYGPw+F8k62fPrID4h+ZEj3tORfXJFzt377Z3sYnMDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e07b220d9e7bf36e5cb79e8ca8e848329cd97a216bceffc582abfb87f48d8e83","last_reissued_at":"2026-05-18T00:48:06.270879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:48:06.270879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1703.07734","source_version":1,"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:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VfwVohV/06jJtqxU71W/SbGElQMhrjsjWzmim5aoyeGbAuiTjYtB2tiuZ0SeDZlvcU3uh2OsKadn9qBzh7m3Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:34:17.556328Z"},"content_sha256":"e8d5952cac2a40d6a2fc1e40093c1d3d1547eed1719a33e8e8d93d0a928ea475","schema_version":"1.0","event_id":"sha256:e8d5952cac2a40d6a2fc1e40093c1d3d1547eed1719a33e8e8d93d0a928ea475"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:4B5SEDM6PPZW4XFXT2GKR2CIGK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Probe Complexity of Local Computation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Boaz Patt-Shamir, Shai Vardi, Uriel Feige","submitted_at":"2017-03-22T16:28:17Z","abstract_excerpt":"The Local Computation Algorithms (LCA) model is a computational model aimed at problem instances with huge inputs and output. For graph problems, the input graph is accessed using probes: strong probes (SP) specify a vertex $v$ and receive as a reply a list of $v$'s neighbors, and weak probes (WP) specify a vertex $v$ and a port number $i$ and receive as a reply $v$'s $i^{th}$ neighbor. Given a local query (e.g., \"is a certain vertex in the vertex cover of the input graph?\"), an LCA should compute the corresponding local output (e.g., \"yes\" or \"no\") while making only a small number of probes, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07734","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"},"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:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZfnCu9gdPKJxKFC9q3yfKFwdbq5OpJr7fDijrI5B5NwaTRZ42SnxaZ1Sf3H4PqbKRmVQ5jMhP/7OeocZUJ55CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T21:34:17.556676Z"},"content_sha256":"f73c04471920c9fad5112eb08f0c8442700024ec57706ee5c37ba63343ccd509","schema_version":"1.0","event_id":"sha256:f73c04471920c9fad5112eb08f0c8442700024ec57706ee5c37ba63343ccd509"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/bundle.json","state_url":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/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-03T21:34:17Z","links":{"resolver":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK","bundle":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/bundle.json","state":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:4B5SEDM6PPZW4XFXT2GKR2CIGK","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":"18d9e6dd997ba31035f228bbab57497333e720825104ee75433a82871ac74151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-22T16:28:17Z","title_canon_sha256":"2bc261b58488fa810ffb980b595a29ba0cc133b4bb83454fb51895c2d560ed5a"},"schema_version":"1.0","source":{"id":"1703.07734","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1703.07734","created_at":"2026-05-18T00:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1703.07734v1","created_at":"2026-05-18T00:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07734","created_at":"2026-05-18T00:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"4B5SEDM6PPZW","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_16","alias_value":"4B5SEDM6PPZW4XFX","created_at":"2026-05-18T12:30:58Z"},{"alias_kind":"pith_short_8","alias_value":"4B5SEDM6","created_at":"2026-05-18T12:30:58Z"}],"graph_snapshots":[{"event_id":"sha256:f73c04471920c9fad5112eb08f0c8442700024ec57706ee5c37ba63343ccd509","target":"graph","created_at":"2026-05-18T00:48:06Z","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":"The Local Computation Algorithms (LCA) model is a computational model aimed at problem instances with huge inputs and output. For graph problems, the input graph is accessed using probes: strong probes (SP) specify a vertex $v$ and receive as a reply a list of $v$'s neighbors, and weak probes (WP) specify a vertex $v$ and a port number $i$ and receive as a reply $v$'s $i^{th}$ neighbor. Given a local query (e.g., \"is a certain vertex in the vertex cover of the input graph?\"), an LCA should compute the corresponding local output (e.g., \"yes\" or \"no\") while making only a small number of probes, ","authors_text":"Boaz Patt-Shamir, Shai Vardi, Uriel Feige","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-22T16:28:17Z","title":"On the Probe Complexity of Local Computation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1703.07734","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:e8d5952cac2a40d6a2fc1e40093c1d3d1547eed1719a33e8e8d93d0a928ea475","target":"record","created_at":"2026-05-18T00:48:06Z","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":"18d9e6dd997ba31035f228bbab57497333e720825104ee75433a82871ac74151","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-03-22T16:28:17Z","title_canon_sha256":"2bc261b58488fa810ffb980b595a29ba0cc133b4bb83454fb51895c2d560ed5a"},"schema_version":"1.0","source":{"id":"1703.07734","kind":"arxiv","version":1}},"canonical_sha256":"e07b220d9e7bf36e5cb79e8ca8e848329cd97a216bceffc582abfb87f48d8e83","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e07b220d9e7bf36e5cb79e8ca8e848329cd97a216bceffc582abfb87f48d8e83","first_computed_at":"2026-05-18T00:48:06.270879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:48:06.270879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"rc+hDPKQQbj5bW3+aYxQQ1okGFJxGmjyPY7yf/O/O1nRYGPw+F8k62fPrID4h+ZEj3tORfXJFzt377Z3sYnMDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:48:06.271672Z","signed_message":"canonical_sha256_bytes"},"source_id":"1703.07734","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e8d5952cac2a40d6a2fc1e40093c1d3d1547eed1719a33e8e8d93d0a928ea475","sha256:f73c04471920c9fad5112eb08f0c8442700024ec57706ee5c37ba63343ccd509"],"state_sha256":"c2d743f6faa24ef832129c635174870c1417d25453c76d1045c28d319aa722ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P4SSbo9mbY4PG1ARD3NSEHm2ucWJmiQvHvgo4EX8KD2up6YL215LBUYK0AeQ0rEOE7Vm58clUQzm7gMPp13VDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T21:34:17.558591Z","bundle_sha256":"af158b3dde36431f2752774ff6492c422f43e96ea9d772bb56611e6361cf1fcb"}}