{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:ZJN4DZ6FPGPGW2H3V2VFIEQUFE","short_pith_number":"pith:ZJN4DZ6F","schema_version":"1.0","canonical_sha256":"ca5bc1e7c5799e6b68fbaeaa541214292f2ccab04753a91dc9acec9a65c9a467","source":{"kind":"arxiv","id":"1012.2738","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1012.2738","created_at":"2026-05-18T04:33:27.899653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1012.2738v1","created_at":"2026-05-18T04:33:27.899653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1012.2738","created_at":"2026-05-18T04:33:27.899653+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZJN4DZ6FPGPG","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZJN4DZ6FPGPGW2H3","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZJN4DZ6F","created_at":"2026-05-18T12:26:17.028572+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE","json":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE.json","graph_json":"https://pith.science/api/pith-number/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/graph.json","events_json":"https://pith.science/api/pith-number/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/events.json","paper":"https://pith.science/paper/ZJN4DZ6F"},"agent_actions":{"view_html":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE","download_json":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE.json","view_paper":"https://pith.science/paper/ZJN4DZ6F","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1012.2738&json=true","fetch_graph":"https://pith.science/api/pith-number/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/graph.json","fetch_events":"https://pith.science/api/pith-number/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/action/storage_attestation","attest_author":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/action/author_attestation","sign_citation":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/action/citation_signature","submit_replication":"https://pith.science/pith/ZJN4DZ6FPGPGW2H3V2VFIEQUFE/action/replication_record"}},"created_at":"2026-05-18T04:33:27.899653+00:00","updated_at":"2026-05-18T04:33:27.899653+00:00"}