{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5RMQNMJEAXABGENABRUMP6322V","short_pith_number":"pith:5RMQNMJE","canonical_record":{"source":{"id":"1803.05652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-15T09:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"f55ba49911a6b5bf5a4204a9541495bb22d0cda84d4b909543f1d6ee486f1532","abstract_canon_sha256":"f2bde76311003a941c3312f780c4c03732cd7aff2c03a0933344578c49b9dd7d"},"schema_version":"1.0"},"canonical_sha256":"ec5906b12405c01311a00c68c7fb7ad547e4cba4999193a938d49298b4f98939","source":{"kind":"arxiv","id":"1803.05652","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05652","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05652v2","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05652","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"5RMQNMJEAXAB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5RMQNMJEAXABGENA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5RMQNMJE","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5RMQNMJEAXABGENABRUMP6322V","target":"record","payload":{"canonical_record":{"source":{"id":"1803.05652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-15T09:23:58Z","cross_cats_sorted":[],"title_canon_sha256":"f55ba49911a6b5bf5a4204a9541495bb22d0cda84d4b909543f1d6ee486f1532","abstract_canon_sha256":"f2bde76311003a941c3312f780c4c03732cd7aff2c03a0933344578c49b9dd7d"},"schema_version":"1.0"},"canonical_sha256":"ec5906b12405c01311a00c68c7fb7ad547e4cba4999193a938d49298b4f98939","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:31.840080Z","signature_b64":"/C1Uhi6JHhiGs/Qbfn9u3MmbJl+XMuL5jDnBhSEuhb4i5wG0f/oQfDATB2NqqY9GB4oXn9R8f07ADiv884W3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ec5906b12405c01311a00c68c7fb7ad547e4cba4999193a938d49298b4f98939","last_reissued_at":"2026-05-18T00:05:31.839405Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:31.839405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1803.05652","source_version":2,"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:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7EitX/FKyYXQ1XkLv25HQFMZXxLCOR38EE+2ELnRtjk9n/3K9DJVSlBseskFHI/5M81JetIik0nZLCuEvZorBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:31:45.423698Z"},"content_sha256":"aa0080904620b93d77aa89c931e354ea46290d83a36b01499a5dd3a168fd23cf","schema_version":"1.0","event_id":"sha256:aa0080904620b93d77aa89c931e354ea46290d83a36b01499a5dd3a168fd23cf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5RMQNMJEAXABGENABRUMP6322V","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Relaxed Locally Correctable Codes in Computationally Bounded Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Elena Grigorescu, Jeremiah Blocki, Samson Zhou, Venkata Gandikota","submitted_at":"2018-03-15T09:23:58Z","abstract_excerpt":"Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous theoretical and practical applications. An important goal is to obtain the best possible tradeoffs between the number of queries the algorithm makes to its oracle (the locality of the task), and the amount of redundancy in the encoding (the information rate).\n  In Hamming's classical adversarial channel model, the current tradeoffs are dramatic, allowing either small locality, but superpolynomial blocklength, or small blocklength, but high locality. Howev"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05652","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"},"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:05:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vtBMnqL0Z+FB/dEUcIjFypUx1OqyWrhmV0nFBOUwbfq0DKJnkTbN04Y6wAFyvaqRS5gcgOvJn8yQ2OsFWkxAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T00:31:45.424365Z"},"content_sha256":"a3867bfce4d35fe6c11e9eadde648688f1c84770b110b17f6453f9f2f4e5a0f1","schema_version":"1.0","event_id":"sha256:a3867bfce4d35fe6c11e9eadde648688f1c84770b110b17f6453f9f2f4e5a0f1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5RMQNMJEAXABGENABRUMP6322V/bundle.json","state_url":"https://pith.science/pith/5RMQNMJEAXABGENABRUMP6322V/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5RMQNMJEAXABGENABRUMP6322V/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-27T00:31:45Z","links":{"resolver":"https://pith.science/pith/5RMQNMJEAXABGENABRUMP6322V","bundle":"https://pith.science/pith/5RMQNMJEAXABGENABRUMP6322V/bundle.json","state":"https://pith.science/pith/5RMQNMJEAXABGENABRUMP6322V/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5RMQNMJEAXABGENABRUMP6322V/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5RMQNMJEAXABGENABRUMP6322V","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":"f2bde76311003a941c3312f780c4c03732cd7aff2c03a0933344578c49b9dd7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-15T09:23:58Z","title_canon_sha256":"f55ba49911a6b5bf5a4204a9541495bb22d0cda84d4b909543f1d6ee486f1532"},"schema_version":"1.0","source":{"id":"1803.05652","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.05652","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"arxiv_version","alias_value":"1803.05652v2","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.05652","created_at":"2026-05-18T00:05:31Z"},{"alias_kind":"pith_short_12","alias_value":"5RMQNMJEAXAB","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5RMQNMJEAXABGENA","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5RMQNMJE","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:a3867bfce4d35fe6c11e9eadde648688f1c84770b110b17f6453f9f2f4e5a0f1","target":"graph","created_at":"2026-05-18T00:05: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":"Error-correcting codes that admit local decoding and correcting algorithms have been the focus of much recent research due to their numerous theoretical and practical applications. An important goal is to obtain the best possible tradeoffs between the number of queries the algorithm makes to its oracle (the locality of the task), and the amount of redundancy in the encoding (the information rate).\n  In Hamming's classical adversarial channel model, the current tradeoffs are dramatic, allowing either small locality, but superpolynomial blocklength, or small blocklength, but high locality. Howev","authors_text":"Elena Grigorescu, Jeremiah Blocki, Samson Zhou, Venkata Gandikota","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-15T09:23:58Z","title":"Relaxed Locally Correctable Codes in Computationally Bounded Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.05652","kind":"arxiv","version":2},"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:aa0080904620b93d77aa89c931e354ea46290d83a36b01499a5dd3a168fd23cf","target":"record","created_at":"2026-05-18T00:05: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":"f2bde76311003a941c3312f780c4c03732cd7aff2c03a0933344578c49b9dd7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-03-15T09:23:58Z","title_canon_sha256":"f55ba49911a6b5bf5a4204a9541495bb22d0cda84d4b909543f1d6ee486f1532"},"schema_version":"1.0","source":{"id":"1803.05652","kind":"arxiv","version":2}},"canonical_sha256":"ec5906b12405c01311a00c68c7fb7ad547e4cba4999193a938d49298b4f98939","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ec5906b12405c01311a00c68c7fb7ad547e4cba4999193a938d49298b4f98939","first_computed_at":"2026-05-18T00:05:31.839405Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:31.839405Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/C1Uhi6JHhiGs/Qbfn9u3MmbJl+XMuL5jDnBhSEuhb4i5wG0f/oQfDATB2NqqY9GB4oXn9R8f07ADiv884W3DA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:31.840080Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.05652","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aa0080904620b93d77aa89c931e354ea46290d83a36b01499a5dd3a168fd23cf","sha256:a3867bfce4d35fe6c11e9eadde648688f1c84770b110b17f6453f9f2f4e5a0f1"],"state_sha256":"2b8de3a280888820b6d2aabdaef95853186f2deb67c0fb7fec1fb63d2e4a473a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yoHCyrG2MDL4T6QvDRkbPhpv+9iniKW4IO7NXo9Dd7w7e64acf74DexwWfcx1EZdJPRh/ISLnHJ7m+dfoqAhBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T00:31:45.427132Z","bundle_sha256":"58c055cf537acf67542cd61b77347697593b6c743fa09f5186ed668e42cbeaf8"}}