{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NSOALDYYATVW3G52KI53KKS4JL","short_pith_number":"pith:NSOALDYY","canonical_record":{"source":{"id":"1404.5398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T07:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"be8c45bfce49cda37b165c3e9e8122b7460927c156fe4b9db65f9795392f6d3b","abstract_canon_sha256":"ee9992d4581ecbcc5ad4da4fdd0b6e0e2c8ccc0630e8f184a3f9c90ac914595b"},"schema_version":"1.0"},"canonical_sha256":"6c9c058f1804eb6d9bba523bb52a5c4acf7a8f1822833aaeef4bab9a9c6452fc","source":{"kind":"arxiv","id":"1404.5398","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5398","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5398v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5398","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"NSOALDYYATVW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NSOALDYYATVW3G52","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NSOALDYY","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NSOALDYYATVW3G52KI53KKS4JL","target":"record","payload":{"canonical_record":{"source":{"id":"1404.5398","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T07:15:27Z","cross_cats_sorted":[],"title_canon_sha256":"be8c45bfce49cda37b165c3e9e8122b7460927c156fe4b9db65f9795392f6d3b","abstract_canon_sha256":"ee9992d4581ecbcc5ad4da4fdd0b6e0e2c8ccc0630e8f184a3f9c90ac914595b"},"schema_version":"1.0"},"canonical_sha256":"6c9c058f1804eb6d9bba523bb52a5c4acf7a8f1822833aaeef4bab9a9c6452fc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:31.618170Z","signature_b64":"eGW/P49hBI+jXJvkKWMC2r6Y1fxGyksLwbgSRR7kktLU0AbD7eBEbGx61/1h0uysVOg9jfdXD0fyJu1RwxZwAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c9c058f1804eb6d9bba523bb52a5c4acf7a8f1822833aaeef4bab9a9c6452fc","last_reissued_at":"2026-05-18T02:53:31.617394Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:31.617394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1404.5398","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DPnLRytGZNZ/AhZeQXfHhK+zfJfUhJMxvXhpB25vRajEbEAYyeebP9PwaOagtiGa6yRJwb9sIHCOTGLCKRSDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:43:06.289418Z"},"content_sha256":"86d2c6064f6a1d36564dc6133681f9f9c4f1f58b86438ff5c624895a47af61b2","schema_version":"1.0","event_id":"sha256:86d2c6064f6a1d36564dc6133681f9f9c4f1f58b86438ff5c624895a47af61b2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NSOALDYYATVW3G52KI53KKS4JL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Techniques and Tighter Bounds for Local Computation Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Omer Reingold, Shai Vardi","submitted_at":"2014-04-22T07:15:27Z","abstract_excerpt":"Given an input $x$, and a search problem $F$, local computation algorithms (LCAs) implement access to specified locations of $y$ in a legal output $y \\in F(x)$, using polylogarithmic time and space. Mansour et al., (2012), had previously shown how to convert certain online algorithms to LCAs. In this work, we expand on that line of work and develop new techniques for designing LCAs and bounding their space and time complexity. Our contributions are fourfold: (1) We significantly improve the running times and space requirements of LCAs for previous results, (2) we expand and better define the f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5398","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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JQkViqG1fpn7Gm6ue0iG88z+9E2sTJy2DNWN5WBY9UItW/OEQBrvpD2Zpvxa9YFgzQuk9x0wxVBZwJMmfnvnDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T13:43:06.289768Z"},"content_sha256":"db569173065bf8b9bdee6f0ac198d1fa502bd4e2738a889502a2303a6b1c7514","schema_version":"1.0","event_id":"sha256:db569173065bf8b9bdee6f0ac198d1fa502bd4e2738a889502a2303a6b1c7514"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NSOALDYYATVW3G52KI53KKS4JL/bundle.json","state_url":"https://pith.science/pith/NSOALDYYATVW3G52KI53KKS4JL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NSOALDYYATVW3G52KI53KKS4JL/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-05T13:43:06Z","links":{"resolver":"https://pith.science/pith/NSOALDYYATVW3G52KI53KKS4JL","bundle":"https://pith.science/pith/NSOALDYYATVW3G52KI53KKS4JL/bundle.json","state":"https://pith.science/pith/NSOALDYYATVW3G52KI53KKS4JL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NSOALDYYATVW3G52KI53KKS4JL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NSOALDYYATVW3G52KI53KKS4JL","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":"ee9992d4581ecbcc5ad4da4fdd0b6e0e2c8ccc0630e8f184a3f9c90ac914595b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T07:15:27Z","title_canon_sha256":"be8c45bfce49cda37b165c3e9e8122b7460927c156fe4b9db65f9795392f6d3b"},"schema_version":"1.0","source":{"id":"1404.5398","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5398","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5398v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5398","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"NSOALDYYATVW","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NSOALDYYATVW3G52","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NSOALDYY","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:db569173065bf8b9bdee6f0ac198d1fa502bd4e2738a889502a2303a6b1c7514","target":"graph","created_at":"2026-05-18T02:53:31Z","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":"Given an input $x$, and a search problem $F$, local computation algorithms (LCAs) implement access to specified locations of $y$ in a legal output $y \\in F(x)$, using polylogarithmic time and space. Mansour et al., (2012), had previously shown how to convert certain online algorithms to LCAs. In this work, we expand on that line of work and develop new techniques for designing LCAs and bounding their space and time complexity. Our contributions are fourfold: (1) We significantly improve the running times and space requirements of LCAs for previous results, (2) we expand and better define the f","authors_text":"Omer Reingold, Shai Vardi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T07:15:27Z","title":"New Techniques and Tighter Bounds for Local Computation Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5398","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:86d2c6064f6a1d36564dc6133681f9f9c4f1f58b86438ff5c624895a47af61b2","target":"record","created_at":"2026-05-18T02:53:31Z","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":"ee9992d4581ecbcc5ad4da4fdd0b6e0e2c8ccc0630e8f184a3f9c90ac914595b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-04-22T07:15:27Z","title_canon_sha256":"be8c45bfce49cda37b165c3e9e8122b7460927c156fe4b9db65f9795392f6d3b"},"schema_version":"1.0","source":{"id":"1404.5398","kind":"arxiv","version":1}},"canonical_sha256":"6c9c058f1804eb6d9bba523bb52a5c4acf7a8f1822833aaeef4bab9a9c6452fc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6c9c058f1804eb6d9bba523bb52a5c4acf7a8f1822833aaeef4bab9a9c6452fc","first_computed_at":"2026-05-18T02:53:31.617394Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:31.617394Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eGW/P49hBI+jXJvkKWMC2r6Y1fxGyksLwbgSRR7kktLU0AbD7eBEbGx61/1h0uysVOg9jfdXD0fyJu1RwxZwAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:31.618170Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5398","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:86d2c6064f6a1d36564dc6133681f9f9c4f1f58b86438ff5c624895a47af61b2","sha256:db569173065bf8b9bdee6f0ac198d1fa502bd4e2738a889502a2303a6b1c7514"],"state_sha256":"2fbb009f41c7a0126c6e44df95884e0dd1b32a05132c8a4d4a8132a13c1e862c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUfJKkLVUJwkwkNugwJnCBPFaPw28RJsmTF6xiU2rAomUY/TN68x9awx9mYznzrYZFZ3nCgxtIdOafdH+OqoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T13:43:06.291627Z","bundle_sha256":"9a2c5442914015d024014d3d9fe4937ae71a7f513a2ec12a7f62b1702f96f59d"}}