{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:XMT2IWU5Y3XB43XLTVZCJWMJ7E","short_pith_number":"pith:XMT2IWU5","schema_version":"1.0","canonical_sha256":"bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d","source":{"kind":"arxiv","id":"cs/0607042","version":1},"attestation_state":"computed","paper":{"title":"Towards a classical proof of exponential lower bound for 2-probe smooth codes","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Rahul Jain","submitted_at":"2006-07-11T02:56:28Z","abstract_excerpt":"Let C: {0,1}^n -> {0,1}^m be a code encoding an n-bit string into an m-bit string. Such a code is called a (q, c, e) smooth code if there exists a decoding algorithm which while decoding any bit of the input, makes at most q probes on the code word and the probability that it looks at any location is at most c/m. The error made by the decoding algorithm is at most e. Smooth codes were introduced by Katz and Trevisan in connection with Locally decodable codes.\n  For 2-probe smooth codes Kerenedis and de Wolf have shown exponential in n lower bound on m in case c and e are constants. Their lower"},"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":"cs/0607042","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.CR","submitted_at":"2006-07-11T02:56:28Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"7d74121e51a339d45cd733457895051abad2f9ce5b45bea19007f84b232f240e","abstract_canon_sha256":"90849ac6bed9b2059ca36754cc1c1b73787cb8e687d4df551f3cd953aac55fff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:02:52.818963Z","signature_b64":"mlLpxnj9oDvv9UcHG1QfUqCL9fMmJxpTkpRETEq9Ebp1FE7gOAgFpp8I4Zy4n5FCvLBYlHoxnw9RBIPjRvZcCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d","last_reissued_at":"2026-07-04T15:02:52.818561Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:02:52.818561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Towards a classical proof of exponential lower bound for 2-probe smooth codes","license":"","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"cs.CR","authors_text":"Rahul Jain","submitted_at":"2006-07-11T02:56:28Z","abstract_excerpt":"Let C: {0,1}^n -> {0,1}^m be a code encoding an n-bit string into an m-bit string. Such a code is called a (q, c, e) smooth code if there exists a decoding algorithm which while decoding any bit of the input, makes at most q probes on the code word and the probability that it looks at any location is at most c/m. The error made by the decoding algorithm is at most e. Smooth codes were introduced by Katz and Trevisan in connection with Locally decodable codes.\n  For 2-probe smooth codes Kerenedis and de Wolf have shown exponential in n lower bound on m in case c and e are constants. Their lower"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0607042","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/cs/0607042/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"cs/0607042","created_at":"2026-07-04T15:02:52.818628+00:00"},{"alias_kind":"arxiv_version","alias_value":"cs/0607042v1","created_at":"2026-07-04T15:02:52.818628+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607042","created_at":"2026-07-04T15:02:52.818628+00:00"},{"alias_kind":"pith_short_12","alias_value":"XMT2IWU5Y3XB","created_at":"2026-07-04T15:02:52.818628+00:00"},{"alias_kind":"pith_short_16","alias_value":"XMT2IWU5Y3XB43XL","created_at":"2026-07-04T15:02:52.818628+00:00"},{"alias_kind":"pith_short_8","alias_value":"XMT2IWU5","created_at":"2026-07-04T15:02:52.818628+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/XMT2IWU5Y3XB43XLTVZCJWMJ7E","json":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E.json","graph_json":"https://pith.science/api/pith-number/XMT2IWU5Y3XB43XLTVZCJWMJ7E/graph.json","events_json":"https://pith.science/api/pith-number/XMT2IWU5Y3XB43XLTVZCJWMJ7E/events.json","paper":"https://pith.science/paper/XMT2IWU5"},"agent_actions":{"view_html":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E","download_json":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E.json","view_paper":"https://pith.science/paper/XMT2IWU5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=cs/0607042&json=true","fetch_graph":"https://pith.science/api/pith-number/XMT2IWU5Y3XB43XLTVZCJWMJ7E/graph.json","fetch_events":"https://pith.science/api/pith-number/XMT2IWU5Y3XB43XLTVZCJWMJ7E/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/action/storage_attestation","attest_author":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/action/author_attestation","sign_citation":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/action/citation_signature","submit_replication":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/action/replication_record"}},"created_at":"2026-07-04T15:02:52.818628+00:00","updated_at":"2026-07-04T15:02:52.818628+00:00"}