{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:ZJN4DZ6FPGPGW2H3V2VFIEQUFE","short_pith_number":"pith:ZJN4DZ6F","canonical_record":{"source":{"id":"1012.2738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-13T14:31:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e9bb4466a2e3ddabdc8cb7342b74b113d0dd9f7541d73cceff9e4e580500ffd1","abstract_canon_sha256":"1fce4755988a82b5ab7e7f139c842ad5dbcd211407769ae8761d12d03681b388"},"schema_version":"1.0"},"canonical_sha256":"ca5bc1e7c5799e6b68fbaeaa541214292f2ccab04753a91dc9acec9a65c9a467","source":{"kind":"arxiv","id":"1012.2738","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2738","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2738v1","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2738","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZJN4DZ6FPGPG","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"ZJN4DZ6FPGPGW2H3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"ZJN4DZ6F","created_at":"2026-05-18T12:26:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:ZJN4DZ6FPGPGW2H3V2VFIEQUFE","target":"record","payload":{"canonical_record":{"source":{"id":"1012.2738","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-13T14:31:33Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"e9bb4466a2e3ddabdc8cb7342b74b113d0dd9f7541d73cceff9e4e580500ffd1","abstract_canon_sha256":"1fce4755988a82b5ab7e7f139c842ad5dbcd211407769ae8761d12d03681b388"},"schema_version":"1.0"},"canonical_sha256":"ca5bc1e7c5799e6b68fbaeaa541214292f2ccab04753a91dc9acec9a65c9a467","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:33:27.900069Z","signature_b64":"2b3L6Ywmc3OSJmjqQLzWXAeiuXO/whQkJq1ujXiUmj3yuLmXKPhHuFtqiqbdtb6dpu843sEp82mF6w2WTQA2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca5bc1e7c5799e6b68fbaeaa541214292f2ccab04753a91dc9acec9a65c9a467","last_reissued_at":"2026-05-18T04:33:27.899581Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:33:27.899581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1012.2738","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:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ncg+Cdu+QM05MTBvdckhbq+HkZfO9QQq/r/T5T+SOGbahmQCljdhl/ihn6AxMtm2In3h0m3hbS5WWvE4ti80Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:57:34.533636Z"},"content_sha256":"b69f77881d26d0afcb0f64411677ab728c03e5309f887a1becc95cbcc890ccb6","schema_version":"1.0","event_id":"sha256:b69f77881d26d0afcb0f64411677ab728c03e5309f887a1becc95cbcc890ccb6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:ZJN4DZ6FPGPGW2H3V2VFIEQUFE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Dense locally testable codes cannot have constant rate and distance","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.CC","authors_text":"Irit Dinur, Tali Kaufman","submitted_at":"2010-12-13T14:31:33Z","abstract_excerpt":"A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important question is whether there exist LTCs that have the ccc-property: constant relative rate, constant relative distance, and that can be tested with a constant number of queries. Such codes are sometimes referred to as \"asymptotically good\".\n  We show that dense LTCs cannot be ccc. The density of a tester is roughly the average number of distinct local views in which a coordinate participates. An LTC is dense if it has a teste"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2738","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:33:27Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sEEJ4pRS5tKlR6P98LqNaeo5fKdJ9tzmqWj2zVY36V2IC0yVo2q8PirXPMaW1YZS4vAaQjKms/jV6Bkp3UP0Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:57:34.534047Z"},"content_sha256":"1354b6428da31743213aa28f2ddb4190e34e044e297484f1acdf0283fdea6dbb","schema_version":"1.0","event_id":"sha256:1354b6428da31743213aa28f2ddb4190e34e044e297484f1acdf0283fdea6dbb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/bundle.json","state_url":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/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-03T22:57:34Z","links":{"resolver":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE","bundle":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/bundle.json","state":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:ZJN4DZ6FPGPGW2H3V2VFIEQUFE","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":"1fce4755988a82b5ab7e7f139c842ad5dbcd211407769ae8761d12d03681b388","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-13T14:31:33Z","title_canon_sha256":"e9bb4466a2e3ddabdc8cb7342b74b113d0dd9f7541d73cceff9e4e580500ffd1"},"schema_version":"1.0","source":{"id":"1012.2738","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1012.2738","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"arxiv_version","alias_value":"1012.2738v1","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2738","created_at":"2026-05-18T04:33:27Z"},{"alias_kind":"pith_short_12","alias_value":"ZJN4DZ6FPGPG","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_16","alias_value":"ZJN4DZ6FPGPGW2H3","created_at":"2026-05-18T12:26:17Z"},{"alias_kind":"pith_short_8","alias_value":"ZJN4DZ6F","created_at":"2026-05-18T12:26:17Z"}],"graph_snapshots":[{"event_id":"sha256:1354b6428da31743213aa28f2ddb4190e34e044e297484f1acdf0283fdea6dbb","target":"graph","created_at":"2026-05-18T04:33:27Z","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":"A q-query locally testable code (LTC) is an error correcting code that can be tested by a randomized algorithm that reads at most q symbols from the given word. An important question is whether there exist LTCs that have the ccc-property: constant relative rate, constant relative distance, and that can be tested with a constant number of queries. Such codes are sometimes referred to as \"asymptotically good\".\n  We show that dense LTCs cannot be ccc. The density of a tester is roughly the average number of distinct local views in which a coordinate participates. An LTC is dense if it has a teste","authors_text":"Irit Dinur, Tali Kaufman","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-13T14:31:33Z","title":"Dense locally testable codes cannot have constant rate and distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1012.2738","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:b69f77881d26d0afcb0f64411677ab728c03e5309f887a1becc95cbcc890ccb6","target":"record","created_at":"2026-05-18T04:33:27Z","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":"1fce4755988a82b5ab7e7f139c842ad5dbcd211407769ae8761d12d03681b388","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-12-13T14:31:33Z","title_canon_sha256":"e9bb4466a2e3ddabdc8cb7342b74b113d0dd9f7541d73cceff9e4e580500ffd1"},"schema_version":"1.0","source":{"id":"1012.2738","kind":"arxiv","version":1}},"canonical_sha256":"ca5bc1e7c5799e6b68fbaeaa541214292f2ccab04753a91dc9acec9a65c9a467","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca5bc1e7c5799e6b68fbaeaa541214292f2ccab04753a91dc9acec9a65c9a467","first_computed_at":"2026-05-18T04:33:27.899581Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:33:27.899581Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2b3L6Ywmc3OSJmjqQLzWXAeiuXO/whQkJq1ujXiUmj3yuLmXKPhHuFtqiqbdtb6dpu843sEp82mF6w2WTQA2DA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:33:27.900069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1012.2738","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b69f77881d26d0afcb0f64411677ab728c03e5309f887a1becc95cbcc890ccb6","sha256:1354b6428da31743213aa28f2ddb4190e34e044e297484f1acdf0283fdea6dbb"],"state_sha256":"751e81ec161b4993b30a8be665e576ad37e792b28c3b824ecc14433de9deb7d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"aDP7qh4w6k1ZfXRBcJwc9TOkw0bGGyKaWcaNq/6NsIqcHZF84/Yt0tfrd6MfT2MD+Iu0s8bJ896dwNEGHvBnCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:57:34.536247Z","bundle_sha256":"ff3d4f44f23a95da260ec51d9c7dd0e66503c770460a7b77ea3fad7bcc09e34d"}}