{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:NXT6W4DPMBX4P33OPLTOOQEL4F","short_pith_number":"pith:NXT6W4DP","canonical_record":{"source":{"id":"2404.06513","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-09T17:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"10f93f2199e2e6045f922850abb4698cd4805ab9800ca9d60681100ad911096e","abstract_canon_sha256":"f1bb2972b2b189c60e6e143f912729f0b4cf4717160ab02cfa4df5639cbc6563"},"schema_version":"1.0"},"canonical_sha256":"6de7eb706f606fc7ef6e7ae6e7408be17028d07bfd84b8e9a42970d4022177a0","source":{"kind":"arxiv","id":"2404.06513","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06513","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06513v2","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06513","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"NXT6W4DPMBX4","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_16","alias_value":"NXT6W4DPMBX4P33O","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_8","alias_value":"NXT6W4DP","created_at":"2026-07-05T09:26:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:NXT6W4DPMBX4P33OPLTOOQEL4F","target":"record","payload":{"canonical_record":{"source":{"id":"2404.06513","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-09T17:59:47Z","cross_cats_sorted":[],"title_canon_sha256":"10f93f2199e2e6045f922850abb4698cd4805ab9800ca9d60681100ad911096e","abstract_canon_sha256":"f1bb2972b2b189c60e6e143f912729f0b4cf4717160ab02cfa4df5639cbc6563"},"schema_version":"1.0"},"canonical_sha256":"6de7eb706f606fc7ef6e7ae6e7408be17028d07bfd84b8e9a42970d4022177a0","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:26:59.541672Z","signature_b64":"hWbJ9W5kWa8p+3NPxHOvWJX0C6mNhWWVHfs6aA1iEJ0E0MAoJz54bKx9IMmqDzik8rDOevnj6L9+Zjg4DC/DBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6de7eb706f606fc7ef6e7ae6e7408be17028d07bfd84b8e9a42970d4022177a0","last_reissued_at":"2026-07-05T09:26:59.541232Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:26:59.541232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2404.06513","source_version":2,"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-05T09:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pRxVUwQmySdvVFORbs+YpWyhbo5q9lNSdBeZkYFep6RAL8an+/4Nsof5KS0Wh0L6G2Pu0+ONg8cpHXUHjB5uCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:30:05.604928Z"},"content_sha256":"d9bae1df0352352af226dbf1e24b685cbe38297a7d6802856d625ed1c4e967a5","schema_version":"1.0","event_id":"sha256:d9bae1df0352352af226dbf1e24b685cbe38297a7d6802856d625ed1c4e967a5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:NXT6W4DPMBX4P33OPLTOOQEL4F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Peter Manohar, Pravesh K. Kothari","submitted_at":"2024-04-09T17:59:47Z","abstract_excerpt":"We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \\colon \\{0,1\\}^k \\rightarrow \\{0,1\\}^n$. Specifically, we prove:\n  (1) If $C$ is a linear design 3-LCC, then $n \\geq 2^{(1 - o(1))\\sqrt{k} }$. A design 3-LCC has the additional property that the correcting sets for every codeword bit form a perfect matching and every pair of codeword bits is queried an equal number of times across all matchings. Our bound is tight up to a factor $\\sqrt{8}$ in the exponent of $2$, as the best construction of binary $3$-LCCs (obtained by taking Reed-Muller codes on $\\mathbb{"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06513","kind":"arxiv","version":2},"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/2404.06513/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-05T09:26:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vMkaos8mOAltDhCtKmjFetaF51hDxHMlhh/S0DZ0THimxqIzt3VgxncvnuySKnwXVlfUaweqi0mUPgTbOQZCBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T14:30:05.605828Z"},"content_sha256":"c0d761f0683fc0bdc0aeccf8b9d2dafa32cbc0df1811205503be96d73ceb84e1","schema_version":"1.0","event_id":"sha256:c0d761f0683fc0bdc0aeccf8b9d2dafa32cbc0df1811205503be96d73ceb84e1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NXT6W4DPMBX4P33OPLTOOQEL4F/bundle.json","state_url":"https://pith.science/pith/NXT6W4DPMBX4P33OPLTOOQEL4F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NXT6W4DPMBX4P33OPLTOOQEL4F/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-13T14:30:05Z","links":{"resolver":"https://pith.science/pith/NXT6W4DPMBX4P33OPLTOOQEL4F","bundle":"https://pith.science/pith/NXT6W4DPMBX4P33OPLTOOQEL4F/bundle.json","state":"https://pith.science/pith/NXT6W4DPMBX4P33OPLTOOQEL4F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NXT6W4DPMBX4P33OPLTOOQEL4F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:NXT6W4DPMBX4P33OPLTOOQEL4F","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":"f1bb2972b2b189c60e6e143f912729f0b4cf4717160ab02cfa4df5639cbc6563","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-09T17:59:47Z","title_canon_sha256":"10f93f2199e2e6045f922850abb4698cd4805ab9800ca9d60681100ad911096e"},"schema_version":"1.0","source":{"id":"2404.06513","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2404.06513","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"arxiv_version","alias_value":"2404.06513v2","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.06513","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_12","alias_value":"NXT6W4DPMBX4","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_16","alias_value":"NXT6W4DPMBX4P33O","created_at":"2026-07-05T09:26:59Z"},{"alias_kind":"pith_short_8","alias_value":"NXT6W4DP","created_at":"2026-07-05T09:26:59Z"}],"graph_snapshots":[{"event_id":"sha256:c0d761f0683fc0bdc0aeccf8b9d2dafa32cbc0df1811205503be96d73ceb84e1","target":"graph","created_at":"2026-07-05T09:26:59Z","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/2404.06513/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We give improved lower bounds for binary $3$-query locally correctable codes (3-LCCs) $C \\colon \\{0,1\\}^k \\rightarrow \\{0,1\\}^n$. Specifically, we prove:\n  (1) If $C$ is a linear design 3-LCC, then $n \\geq 2^{(1 - o(1))\\sqrt{k} }$. A design 3-LCC has the additional property that the correcting sets for every codeword bit form a perfect matching and every pair of codeword bits is queried an equal number of times across all matchings. Our bound is tight up to a factor $\\sqrt{8}$ in the exponent of $2$, as the best construction of binary $3$-LCCs (obtained by taking Reed-Muller codes on $\\mathbb{","authors_text":"Peter Manohar, Pravesh K. Kothari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-09T17:59:47Z","title":"Exponential Lower Bounds for Smooth 3-LCCs and Sharp Bounds for Designs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.06513","kind":"arxiv","version":2},"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:d9bae1df0352352af226dbf1e24b685cbe38297a7d6802856d625ed1c4e967a5","target":"record","created_at":"2026-07-05T09:26:59Z","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":"f1bb2972b2b189c60e6e143f912729f0b4cf4717160ab02cfa4df5639cbc6563","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2024-04-09T17:59:47Z","title_canon_sha256":"10f93f2199e2e6045f922850abb4698cd4805ab9800ca9d60681100ad911096e"},"schema_version":"1.0","source":{"id":"2404.06513","kind":"arxiv","version":2}},"canonical_sha256":"6de7eb706f606fc7ef6e7ae6e7408be17028d07bfd84b8e9a42970d4022177a0","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6de7eb706f606fc7ef6e7ae6e7408be17028d07bfd84b8e9a42970d4022177a0","first_computed_at":"2026-07-05T09:26:59.541232Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:26:59.541232Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hWbJ9W5kWa8p+3NPxHOvWJX0C6mNhWWVHfs6aA1iEJ0E0MAoJz54bKx9IMmqDzik8rDOevnj6L9+Zjg4DC/DBg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:26:59.541672Z","signed_message":"canonical_sha256_bytes"},"source_id":"2404.06513","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d9bae1df0352352af226dbf1e24b685cbe38297a7d6802856d625ed1c4e967a5","sha256:c0d761f0683fc0bdc0aeccf8b9d2dafa32cbc0df1811205503be96d73ceb84e1"],"state_sha256":"def0bdf843ce2c1c440773a0be475af16cead5964799816cef04cb6c0f1b92dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nHwcQVbUMRoj4Pg2XMXN6kDicMeQGr9YEKKnDPOboRipXAoT0kn5jRlq1Mavynyb1v5xEka5VxZ8Gn8hut+mAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T14:30:05.611565Z","bundle_sha256":"2f3443521708bc41e6b720fa2749b09292bccec8cdc3aea5fe8b4236063459e5"}}