{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2006:XMT2IWU5Y3XB43XLTVZCJWMJ7E","short_pith_number":"pith:XMT2IWU5","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"},"canonical_sha256":"bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d","source":{"kind":"arxiv","id":"cs/0607042","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0607042","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0607042v1","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607042","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"XMT2IWU5Y3XB","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"pith_short_16","alias_value":"XMT2IWU5Y3XB43XL","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"pith_short_8","alias_value":"XMT2IWU5","created_at":"2026-07-04T15:02:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2006:XMT2IWU5Y3XB43XLTVZCJWMJ7E","target":"record","payload":{"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"},"canonical_sha256":"bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d","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"},"source_kind":"arxiv","source_id":"cs/0607042","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-07-04T15:02:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sSyojGShHP/uJphnmi7opkaMw9Kuwy0BiEg3Hof9yulbVAbQrjUgrLxwBNQ00SBkqo0pdGkNc7F4xAIpNeAvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:52:41.561289Z"},"content_sha256":"8adaabf4d2359f8a4aade3499cf9eb3d9e207db73103c2444f0e90366e8e6524","schema_version":"1.0","event_id":"sha256:8adaabf4d2359f8a4aade3499cf9eb3d9e207db73103c2444f0e90366e8e6524"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2006:XMT2IWU5Y3XB43XLTVZCJWMJ7E","target":"graph","payload":{"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"},"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-07-04T15:02:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"10kqkBdpq5ab1sjH7FJ7IWtJSaV19yJ2G3tJbpdq108W3vPuLckXQOKPFg9rnX2G12NRsZcF/kFITvMU9BgTDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T19:52:41.562240Z"},"content_sha256":"44f831b4dfe636642d8e98c3a0ae3fdacee7aa6b1cb1f4c2b6f44de103d64af7","schema_version":"1.0","event_id":"sha256:44f831b4dfe636642d8e98c3a0ae3fdacee7aa6b1cb1f4c2b6f44de103d64af7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/bundle.json","state_url":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/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-08-12T19:52:41Z","links":{"resolver":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E","bundle":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/bundle.json","state":"https://pith.science/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XMT2IWU5Y3XB43XLTVZCJWMJ7E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2006:XMT2IWU5Y3XB43XLTVZCJWMJ7E","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":"90849ac6bed9b2059ca36754cc1c1b73787cb8e687d4df551f3cd953aac55fff","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.CR","submitted_at":"2006-07-11T02:56:28Z","title_canon_sha256":"7d74121e51a339d45cd733457895051abad2f9ce5b45bea19007f84b232f240e"},"schema_version":"1.0","source":{"id":"cs/0607042","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"cs/0607042","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"arxiv_version","alias_value":"cs/0607042v1","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.cs/0607042","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"pith_short_12","alias_value":"XMT2IWU5Y3XB","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"pith_short_16","alias_value":"XMT2IWU5Y3XB43XL","created_at":"2026-07-04T15:02:52Z"},{"alias_kind":"pith_short_8","alias_value":"XMT2IWU5","created_at":"2026-07-04T15:02:52Z"}],"graph_snapshots":[{"event_id":"sha256:44f831b4dfe636642d8e98c3a0ae3fdacee7aa6b1cb1f4c2b6f44de103d64af7","target":"graph","created_at":"2026-07-04T15:02:52Z","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/0607042/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Rahul Jain","cross_cats":["cs.IT","math.IT"],"headline":"","license":"","primary_cat":"cs.CR","submitted_at":"2006-07-11T02:56:28Z","title":"Towards a classical proof of exponential lower bound for 2-probe smooth codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"cs/0607042","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:8adaabf4d2359f8a4aade3499cf9eb3d9e207db73103c2444f0e90366e8e6524","target":"record","created_at":"2026-07-04T15:02:52Z","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":"90849ac6bed9b2059ca36754cc1c1b73787cb8e687d4df551f3cd953aac55fff","cross_cats_sorted":["cs.IT","math.IT"],"license":"","primary_cat":"cs.CR","submitted_at":"2006-07-11T02:56:28Z","title_canon_sha256":"7d74121e51a339d45cd733457895051abad2f9ce5b45bea19007f84b232f240e"},"schema_version":"1.0","source":{"id":"cs/0607042","kind":"arxiv","version":1}},"canonical_sha256":"bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bb27a45a9dc6ee1e6eeb9d7224d989f93aa35d6471c3618e1f2f8b8d0a39b43d","first_computed_at":"2026-07-04T15:02:52.818561Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-04T15:02:52.818561Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mlLpxnj9oDvv9UcHG1QfUqCL9fMmJxpTkpRETEq9Ebp1FE7gOAgFpp8I4Zy4n5FCvLBYlHoxnw9RBIPjRvZcCQ==","signature_status":"signed_v1","signed_at":"2026-07-04T15:02:52.818963Z","signed_message":"canonical_sha256_bytes"},"source_id":"cs/0607042","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8adaabf4d2359f8a4aade3499cf9eb3d9e207db73103c2444f0e90366e8e6524","sha256:44f831b4dfe636642d8e98c3a0ae3fdacee7aa6b1cb1f4c2b6f44de103d64af7"],"state_sha256":"61c2e7ee46f7e6e948630bbb2a64eb1aa05c57829fba1a6681692455c97cced4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"2F7J2cfXdZXiswOJbe1gKiTJb1zZW0ybhGFT+StUMP1Iw8vJMAyR8cGMbflxibP5FwB3Pyam3Yf9Vb2OOlQhBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T19:52:41.568463Z","bundle_sha256":"320a964726c4e640f9786d93719755147bae7a8394f9a129445167fd4c913edd"}}