{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4B5SEDM6PPZW4XFXT2GKR2CIGK","short_pith_number":"pith:4B5SEDM6","schema_version":"1.0","canonical_sha256":"e07b220d9e7bf36e5cb79e8ca8e848329cd97a216bceffc582abfb87f48d8e83","source":{"kind":"arxiv","id":"1703.07734","version":1},"attestation_state":"computed","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, "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1703.07734","created_at":"2026-05-18T00:48:06.271011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1703.07734v1","created_at":"2026-05-18T00:48:06.271011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1703.07734","created_at":"2026-05-18T00:48:06.271011+00:00"},{"alias_kind":"pith_short_12","alias_value":"4B5SEDM6PPZW","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"4B5SEDM6PPZW4XFX","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"4B5SEDM6","created_at":"2026-05-18T12:30:58.224056+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/4B5SEDM6PPZW4XFXT2GKR2CIGK","json":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK.json","graph_json":"https://pith.science/api/pith-number/4B5SEDM6PPZW4XFXT2GKR2CIGK/graph.json","events_json":"https://pith.science/api/pith-number/4B5SEDM6PPZW4XFXT2GKR2CIGK/events.json","paper":"https://pith.science/paper/4B5SEDM6"},"agent_actions":{"view_html":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK","download_json":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK.json","view_paper":"https://pith.science/paper/4B5SEDM6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1703.07734&json=true","fetch_graph":"https://pith.science/api/pith-number/4B5SEDM6PPZW4XFXT2GKR2CIGK/graph.json","fetch_events":"https://pith.science/api/pith-number/4B5SEDM6PPZW4XFXT2GKR2CIGK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/action/storage_attestation","attest_author":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/action/author_attestation","sign_citation":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/action/citation_signature","submit_replication":"https://pith.science/pith/4B5SEDM6PPZW4XFXT2GKR2CIGK/action/replication_record"}},"created_at":"2026-05-18T00:48:06.271011+00:00","updated_at":"2026-05-18T00:48:06.271011+00:00"}