{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:BOS7STC7GY362KAYBEZ6TZOTAL","short_pith_number":"pith:BOS7STC7","schema_version":"1.0","canonical_sha256":"0ba5f94c5f3637ed28180933e9e5d302fd25b3b4259d58f3664080aebfac94e4","source":{"kind":"arxiv","id":"1109.6178","version":2},"attestation_state":"computed","paper":{"title":"Space-efficient Local Computation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ning Xie, Noga Alon, Ronitt Rubinfeld, Shai Vardi","submitted_at":"2011-09-28T11:56:40Z","abstract_excerpt":"Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \\emph{local computation algorithms}. In this model, a computation problem $F$ may have more than one legal solution and each of them consists of many bits. The local computation algorithm for $F$ should answer in an online fashion, for any index $i$, the $i^{\\mathrm{th}}$ bit of some legal solution of $F$. Further, all the answers given by the algorithm should be consistent with at least one solution of $F$.\n  In this work, we continue the study of local computation algorithms. In particular,"},"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":"1109.6178","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-28T11:56:40Z","cross_cats_sorted":[],"title_canon_sha256":"6ea80ed3225c4434560bb29eeae03e1123b73da1b54b7cfcc17e8ab5402c5e44","abstract_canon_sha256":"c43a2fa7c45376dcfb0156af6ffe7057ee5c9ac05afe8ebf49f389af11003098"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:19.297491Z","signature_b64":"V4r3vww37eDk9+UJngZMDAxM6E9dQPXE0oQztOo8be3W8G8tKozdHh+GcaLxss1HSfKeJJW5k9N0ulcjc8o0CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba5f94c5f3637ed28180933e9e5d302fd25b3b4259d58f3664080aebfac94e4","last_reissued_at":"2026-05-18T04:07:19.296710Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:19.296710Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Space-efficient Local Computation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ning Xie, Noga Alon, Ronitt Rubinfeld, Shai Vardi","submitted_at":"2011-09-28T11:56:40Z","abstract_excerpt":"Recently Rubinfeld et al. (ICS 2011, pp. 223--238) proposed a new model of sublinear algorithms called \\emph{local computation algorithms}. In this model, a computation problem $F$ may have more than one legal solution and each of them consists of many bits. The local computation algorithm for $F$ should answer in an online fashion, for any index $i$, the $i^{\\mathrm{th}}$ bit of some legal solution of $F$. Further, all the answers given by the algorithm should be consistent with at least one solution of $F$.\n  In this work, we continue the study of local computation algorithms. In particular,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.6178","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1109.6178","created_at":"2026-05-18T04:07:19.296848+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.6178v2","created_at":"2026-05-18T04:07:19.296848+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.6178","created_at":"2026-05-18T04:07:19.296848+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOS7STC7GY36","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOS7STC7GY362KAY","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOS7STC7","created_at":"2026-05-18T12:26:24.575870+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/BOS7STC7GY362KAYBEZ6TZOTAL","json":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL.json","graph_json":"https://pith.science/api/pith-number/BOS7STC7GY362KAYBEZ6TZOTAL/graph.json","events_json":"https://pith.science/api/pith-number/BOS7STC7GY362KAYBEZ6TZOTAL/events.json","paper":"https://pith.science/paper/BOS7STC7"},"agent_actions":{"view_html":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL","download_json":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL.json","view_paper":"https://pith.science/paper/BOS7STC7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.6178&json=true","fetch_graph":"https://pith.science/api/pith-number/BOS7STC7GY362KAYBEZ6TZOTAL/graph.json","fetch_events":"https://pith.science/api/pith-number/BOS7STC7GY362KAYBEZ6TZOTAL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL/action/storage_attestation","attest_author":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL/action/author_attestation","sign_citation":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL/action/citation_signature","submit_replication":"https://pith.science/pith/BOS7STC7GY362KAYBEZ6TZOTAL/action/replication_record"}},"created_at":"2026-05-18T04:07:19.296848+00:00","updated_at":"2026-05-18T04:07:19.296848+00:00"}