{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:EWGL7VNL6F7U5DC7MYUGE3RGY3","short_pith_number":"pith:EWGL7VNL","canonical_record":{"source":{"id":"1004.4017","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T21:32:17Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"e89e78dc81e678cbacbbc8ef49a366c501c9c6eb1372453abda9489866c80f0d","abstract_canon_sha256":"2e8cf2141bc0d2c686a861cc499ffcd619ab00e7cc959db37697aadaf0e27793"},"schema_version":"1.0"},"canonical_sha256":"258cbfd5abf17f4e8c5f6628626e26c6c59a074ebf1c26328d8df2d08cd4875a","source":{"kind":"arxiv","id":"1004.4017","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4017","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4017v4","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4017","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"EWGL7VNL6F7U","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EWGL7VNL6F7U5DC7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EWGL7VNL","created_at":"2026-05-18T12:26:06Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:EWGL7VNL6F7U5DC7MYUGE3RGY3","target":"record","payload":{"canonical_record":{"source":{"id":"1004.4017","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T21:32:17Z","cross_cats_sorted":["cs.CC","math.IT"],"title_canon_sha256":"e89e78dc81e678cbacbbc8ef49a366c501c9c6eb1372453abda9489866c80f0d","abstract_canon_sha256":"2e8cf2141bc0d2c686a861cc499ffcd619ab00e7cc959db37697aadaf0e27793"},"schema_version":"1.0"},"canonical_sha256":"258cbfd5abf17f4e8c5f6628626e26c6c59a074ebf1c26328d8df2d08cd4875a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:32:17.330845Z","signature_b64":"nATOoEOM2oBwSuOT5eWXhYL4bXu9dUQ6PXH0ia1wcU5A1new662lrHQyuxEIOipjXPfEOpKGerYCaQ42QveHAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"258cbfd5abf17f4e8c5f6628626e26c6c59a074ebf1c26328d8df2d08cd4875a","last_reissued_at":"2026-05-18T03:32:17.330150Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:32:17.330150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1004.4017","source_version":4,"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-18T03:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPAwW8EbSteanPMPvRs6petFNTlHV1vrqvgrEOsvw6XgBd8r69S+aW1B2eHdME/MkDRPo8o/fmbupf++eMd7AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:34:55.792820Z"},"content_sha256":"459b09dbb48018566736669350284d7367ec7965c82fa4d67a24003af95f4fed","schema_version":"1.0","event_id":"sha256:459b09dbb48018566736669350284d7367ec7965c82fa4d67a24003af95f4fed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:EWGL7VNL6F7U5DC7MYUGE3RGY3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal-Rate Code Constructions for Computationally Simple Channels","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.IT"],"primary_cat":"cs.IT","authors_text":"Adam Smith, Venkatesan Guruswami","submitted_at":"2010-04-22T21:32:17Z","abstract_excerpt":"We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the errors can be described by a sufficiently simple circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time.\n  For two classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only inefficiently "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4017","kind":"arxiv","version":4},"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-18T03:32:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K3JOIgjiNC09DHeK+2xBXi6ZB78VX9/em7lGA6vBezeIQuez6Xo3C1VD8x3iFHZM/hq45GhcPcuMc7mBLLAHCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T14:34:55.793256Z"},"content_sha256":"aea9bf18bac40af4015bed1c6085edf2ffd6b54486d5afaeb0500e59fe3f1ba9","schema_version":"1.0","event_id":"sha256:aea9bf18bac40af4015bed1c6085edf2ffd6b54486d5afaeb0500e59fe3f1ba9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EWGL7VNL6F7U5DC7MYUGE3RGY3/bundle.json","state_url":"https://pith.science/pith/EWGL7VNL6F7U5DC7MYUGE3RGY3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EWGL7VNL6F7U5DC7MYUGE3RGY3/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-09T14:34:55Z","links":{"resolver":"https://pith.science/pith/EWGL7VNL6F7U5DC7MYUGE3RGY3","bundle":"https://pith.science/pith/EWGL7VNL6F7U5DC7MYUGE3RGY3/bundle.json","state":"https://pith.science/pith/EWGL7VNL6F7U5DC7MYUGE3RGY3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EWGL7VNL6F7U5DC7MYUGE3RGY3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:EWGL7VNL6F7U5DC7MYUGE3RGY3","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":"2e8cf2141bc0d2c686a861cc499ffcd619ab00e7cc959db37697aadaf0e27793","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T21:32:17Z","title_canon_sha256":"e89e78dc81e678cbacbbc8ef49a366c501c9c6eb1372453abda9489866c80f0d"},"schema_version":"1.0","source":{"id":"1004.4017","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1004.4017","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"arxiv_version","alias_value":"1004.4017v4","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1004.4017","created_at":"2026-05-18T03:32:17Z"},{"alias_kind":"pith_short_12","alias_value":"EWGL7VNL6F7U","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_16","alias_value":"EWGL7VNL6F7U5DC7","created_at":"2026-05-18T12:26:06Z"},{"alias_kind":"pith_short_8","alias_value":"EWGL7VNL","created_at":"2026-05-18T12:26:06Z"}],"graph_snapshots":[{"event_id":"sha256:aea9bf18bac40af4015bed1c6085edf2ffd6b54486d5afaeb0500e59fe3f1ba9","target":"graph","created_at":"2026-05-18T03:32:17Z","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":"We consider coding schemes for computationally bounded channels, which can introduce an arbitrary set of errors as long as (a) the fraction of errors is bounded with high probability by a parameter $p$ and (b) the process which adds the errors can be described by a sufficiently simple circuit. Codes for such channel models are attractive since, like codes for standard adversarial errors, they can handle channels whose true behavior is unknown or varying over time.\n  For two classes of channels, we provide explicit, efficiently encodable/decodable codes of optimal rate where only inefficiently ","authors_text":"Adam Smith, Venkatesan Guruswami","cross_cats":["cs.CC","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T21:32:17Z","title":"Optimal-Rate Code Constructions for Computationally Simple Channels"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1004.4017","kind":"arxiv","version":4},"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:459b09dbb48018566736669350284d7367ec7965c82fa4d67a24003af95f4fed","target":"record","created_at":"2026-05-18T03:32:17Z","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":"2e8cf2141bc0d2c686a861cc499ffcd619ab00e7cc959db37697aadaf0e27793","cross_cats_sorted":["cs.CC","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2010-04-22T21:32:17Z","title_canon_sha256":"e89e78dc81e678cbacbbc8ef49a366c501c9c6eb1372453abda9489866c80f0d"},"schema_version":"1.0","source":{"id":"1004.4017","kind":"arxiv","version":4}},"canonical_sha256":"258cbfd5abf17f4e8c5f6628626e26c6c59a074ebf1c26328d8df2d08cd4875a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"258cbfd5abf17f4e8c5f6628626e26c6c59a074ebf1c26328d8df2d08cd4875a","first_computed_at":"2026-05-18T03:32:17.330150Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:32:17.330150Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nATOoEOM2oBwSuOT5eWXhYL4bXu9dUQ6PXH0ia1wcU5A1new662lrHQyuxEIOipjXPfEOpKGerYCaQ42QveHAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:32:17.330845Z","signed_message":"canonical_sha256_bytes"},"source_id":"1004.4017","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:459b09dbb48018566736669350284d7367ec7965c82fa4d67a24003af95f4fed","sha256:aea9bf18bac40af4015bed1c6085edf2ffd6b54486d5afaeb0500e59fe3f1ba9"],"state_sha256":"d01f6a2ac6cd1f322bd3fc202227ada3ad2e0ac1746539f2e3d95634f0a1d370"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"59mGe02+TIZBri5dAmgE0tH6AT7xsLNtHAliPkcPiI3mrjt9GP8KhR7SlOwTewx/RDwseZFVxNCCD4jA4JukBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T14:34:55.795181Z","bundle_sha256":"7c285a67f30c17ea0acd0ecccc43c54314ff10d5d24810aec6bd2e67e9d5580d"}}