{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2004:RV2NW7YMNBNYVVW67NGTDETLLM","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":"39ba139b7046c7d5309f2902426d2332bf1dcd0834230ae9fdb52185b158ac4b","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.CC","submitted_at":"2004-09-24T02:38:24Z","title_canon_sha256":"ba93bfac24c4b7979397589c1be82698fdaec82f04940d156a2ef756557d1ffc"},"schema_version":"1.0","source":{"id":"cs/0409044","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0409044","created_at":"2026-07-04T15:02:44Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0409044v1","created_at":"2026-07-04T15:02:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0409044","created_at":"2026-07-04T15:02:44Z"},{"alias_kind":"pith_short_12","alias_value":"RV2NW7YMNBNY","created_at":"2026-07-04T15:02:44Z"},{"alias_kind":"pith_short_16","alias_value":"RV2NW7YMNBNYVVW6","created_at":"2026-07-04T15:02:44Z"},{"alias_kind":"pith_short_8","alias_value":"RV2NW7YM","created_at":"2026-07-04T15:02:44Z"}],"graph_snapshots":[{"event_id":"sha256:673bbd3fe39e573c22cc9d4947d337bb51c11e16c45b223d6760ff5656f6f324","target":"graph","created_at":"2026-07-04T15:02:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/cs/0409044/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Error-correcting codes and related combinatorial constructs play an important role in several recent (and old) results in computational complexity theory. In this paper we survey results on locally-testable and locally-decodable error-correcting codes, and their applications to complexity theory and to cryptography.\n  Locally decodable codes are error-correcting codes with sub-linear time error-correcting algorithms. They are related to private information retrieval (a type of cryptographic protocol), and they are used in average-case complexity and to construct ``hard-core predicates'' for on","authors_text":"Luca Trevisan","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"cs.CC","submitted_at":"2004-09-24T02:38:24Z","title":"Some Applications of Coding Theory in Computational Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0409044","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:2a59377a9eb0547a25b6776c55b7e47319d0a7bfff169c71c8e63514969a2705","target":"record","created_at":"2026-07-04T15:02:44Z","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":"39ba139b7046c7d5309f2902426d2332bf1dcd0834230ae9fdb52185b158ac4b","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.CC","submitted_at":"2004-09-24T02:38:24Z","title_canon_sha256":"ba93bfac24c4b7979397589c1be82698fdaec82f04940d156a2ef756557d1ffc"},"schema_version":"1.0","source":{"id":"cs/0409044","kind":"arxiv","version":1}},"canonical_sha256":"8d74db7f0c685b8ad6defb4d31926b5b1e14259f88f1c2ed21b14178a3854b9b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8d74db7f0c685b8ad6defb4d31926b5b1e14259f88f1c2ed21b14178a3854b9b","first_computed_at":"2026-07-04T15:02:44.610591Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:44.610591Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QVd/KOtTmFCIPlqATATHSwDKVw9dR+kn/XaGxdZI961iAB6/W8O0VbfG19tj5KcJmrSqkVDsqFDjcOY+2W0WBQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:44.610957Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0409044","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2a59377a9eb0547a25b6776c55b7e47319d0a7bfff169c71c8e63514969a2705","sha256:673bbd3fe39e573c22cc9d4947d337bb51c11e16c45b223d6760ff5656f6f324"],"state_sha256":"13f5e75bc10e43df71a56c5bd4953d6ac51936305c282ec7a3fe6be8d3ad6426"}