{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BXBFMGNFFIZTKCZ3RE5NDGIXYQ","short_pith_number":"pith:BXBFMGNF","canonical_record":{"source":{"id":"1104.1377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-07T16:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"324c9c564783b58ddda874d751a1cdcd2ae379b8462a7822dbe6000310191819","abstract_canon_sha256":"8fb3b3519beae69d783aae8a8f123b8db40d40b0196ed492e84f23ee5c050ac8"},"schema_version":"1.0"},"canonical_sha256":"0dc25619a52a33350b3b893ad19917c4271ffde5a878657fe78cb1636b13a4ee","source":{"kind":"arxiv","id":"1104.1377","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1377","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1377v1","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1377","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"BXBFMGNFFIZT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BXBFMGNFFIZTKCZ3","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BXBFMGNF","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BXBFMGNFFIZTKCZ3RE5NDGIXYQ","target":"record","payload":{"canonical_record":{"source":{"id":"1104.1377","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-07T16:55:23Z","cross_cats_sorted":[],"title_canon_sha256":"324c9c564783b58ddda874d751a1cdcd2ae379b8462a7822dbe6000310191819","abstract_canon_sha256":"8fb3b3519beae69d783aae8a8f123b8db40d40b0196ed492e84f23ee5c050ac8"},"schema_version":"1.0"},"canonical_sha256":"0dc25619a52a33350b3b893ad19917c4271ffde5a878657fe78cb1636b13a4ee","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:24:52.354604Z","signature_b64":"B4tq+GHPEJQWmAAqEFnNCeaImjUsmeSQ/5tnl8EZRgt/jeEct+0B+vSoZe0cdM4ZuAqSKSt5pgmkd6b9+E7PAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dc25619a52a33350b3b893ad19917c4271ffde5a878657fe78cb1636b13a4ee","last_reissued_at":"2026-05-18T04:24:52.354141Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:24:52.354141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1104.1377","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-18T04:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KeQAd43Sv65WMBaopECADoQw4UPpgvhZybC4cbBAJ3utFzfgVswHDVpN5O8W5g2gaiVcZGsudhsdwiyP6XvbDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:12.004256Z"},"content_sha256":"44173ed08597bed15700b8682ce8ccfab3ad15e5bbd00c8fa4e190299e0694b3","schema_version":"1.0","event_id":"sha256:44173ed08597bed15700b8682ce8ccfab3ad15e5bbd00c8fa4e190299e0694b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BXBFMGNFFIZTKCZ3RE5NDGIXYQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Local Computation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gil Tamir, Ning Xie, Ronitt Rubinfeld, Shai Vardi","submitted_at":"2011-04-07T16:55:23Z","abstract_excerpt":"For input $x$, let $F(x)$ denote the set of outputs that are the \"legal\" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of {\\em local computation algorithms} which for a given input $x$, support queries by a user to values of specified locations $y_i$ in a legal output $y \\in F(x)$. When more than one legal output $y$ exists for a given $x$, the local computation algorithm should output in a way that is consistent with at least one such $y$. Local computation algorithms are intend"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1377","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-18T04:24:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NbmEx3Ze6LZT0Dc5LHWxoXYVJwDD7FJYXvfrxTURZO1Oclia8xYBV1Jx3zfxqsEghVt8f4XmhFU2DgIDd3qrCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T19:23:12.004913Z"},"content_sha256":"7486c81ad7737b383c8bbba68595500f456ad6bc14913f0cc04066eb0e816572","schema_version":"1.0","event_id":"sha256:7486c81ad7737b383c8bbba68595500f456ad6bc14913f0cc04066eb0e816572"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXBFMGNFFIZTKCZ3RE5NDGIXYQ/bundle.json","state_url":"https://pith.science/pith/BXBFMGNFFIZTKCZ3RE5NDGIXYQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXBFMGNFFIZTKCZ3RE5NDGIXYQ/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-05-27T19:23:12Z","links":{"resolver":"https://pith.science/pith/BXBFMGNFFIZTKCZ3RE5NDGIXYQ","bundle":"https://pith.science/pith/BXBFMGNFFIZTKCZ3RE5NDGIXYQ/bundle.json","state":"https://pith.science/pith/BXBFMGNFFIZTKCZ3RE5NDGIXYQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXBFMGNFFIZTKCZ3RE5NDGIXYQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BXBFMGNFFIZTKCZ3RE5NDGIXYQ","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":"8fb3b3519beae69d783aae8a8f123b8db40d40b0196ed492e84f23ee5c050ac8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-07T16:55:23Z","title_canon_sha256":"324c9c564783b58ddda874d751a1cdcd2ae379b8462a7822dbe6000310191819"},"schema_version":"1.0","source":{"id":"1104.1377","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1104.1377","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"arxiv_version","alias_value":"1104.1377v1","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1104.1377","created_at":"2026-05-18T04:24:52Z"},{"alias_kind":"pith_short_12","alias_value":"BXBFMGNFFIZT","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BXBFMGNFFIZTKCZ3","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BXBFMGNF","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:7486c81ad7737b383c8bbba68595500f456ad6bc14913f0cc04066eb0e816572","target":"graph","created_at":"2026-05-18T04:24:52Z","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":"For input $x$, let $F(x)$ denote the set of outputs that are the \"legal\" answers for a computational problem $F$. Suppose $x$ and members of $F(x)$ are so large that there is not time to read them in their entirety. We propose a model of {\\em local computation algorithms} which for a given input $x$, support queries by a user to values of specified locations $y_i$ in a legal output $y \\in F(x)$. When more than one legal output $y$ exists for a given $x$, the local computation algorithm should output in a way that is consistent with at least one such $y$. Local computation algorithms are intend","authors_text":"Gil Tamir, Ning Xie, Ronitt Rubinfeld, Shai Vardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-07T16:55:23Z","title":"Fast Local Computation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1104.1377","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:44173ed08597bed15700b8682ce8ccfab3ad15e5bbd00c8fa4e190299e0694b3","target":"record","created_at":"2026-05-18T04:24:52Z","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":"8fb3b3519beae69d783aae8a8f123b8db40d40b0196ed492e84f23ee5c050ac8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-04-07T16:55:23Z","title_canon_sha256":"324c9c564783b58ddda874d751a1cdcd2ae379b8462a7822dbe6000310191819"},"schema_version":"1.0","source":{"id":"1104.1377","kind":"arxiv","version":1}},"canonical_sha256":"0dc25619a52a33350b3b893ad19917c4271ffde5a878657fe78cb1636b13a4ee","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dc25619a52a33350b3b893ad19917c4271ffde5a878657fe78cb1636b13a4ee","first_computed_at":"2026-05-18T04:24:52.354141Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:24:52.354141Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"B4tq+GHPEJQWmAAqEFnNCeaImjUsmeSQ/5tnl8EZRgt/jeEct+0B+vSoZe0cdM4ZuAqSKSt5pgmkd6b9+E7PAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:24:52.354604Z","signed_message":"canonical_sha256_bytes"},"source_id":"1104.1377","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:44173ed08597bed15700b8682ce8ccfab3ad15e5bbd00c8fa4e190299e0694b3","sha256:7486c81ad7737b383c8bbba68595500f456ad6bc14913f0cc04066eb0e816572"],"state_sha256":"9306ab5c66a91fd0e61c6f4da2d8d7153616586c0d7e94e7e9254978934f9e24"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Te6gDQ0UVzTvofuuJ03RN/dRHxOsQUWdXLsCOuAEYftLxp1eWoee3xysKhBF9XSsfJC38YnhYSsLfApHvRgSBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T19:23:12.007513Z","bundle_sha256":"1c4058c7517db9eeaa98b80fe41c47cdf2c674ce1606fc4b84d0d8eae5fe412b"}}