{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:3V2RGOJ6UOCMZMY6HJI4NSBBMG","short_pith_number":"pith:3V2RGOJ6","schema_version":"1.0","canonical_sha256":"dd7513393ea384ccb31e3a51c6c821618116e2a26e75e2e4df9c77c029c42ea6","source":{"kind":"arxiv","id":"1907.05401","version":1},"attestation_state":"computed","paper":{"title":"Computational Concentration of Measure: Optimal Bounds, Reductions, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Mohammad Mahmoody, Omid Etesami, Saeed Mahloujifar","submitted_at":"2019-07-11T17:33:03Z","abstract_excerpt":"Product measures of dimension $n$ are known to be concentrated in Hamming distance: for any set $S$ in the product space of probability $\\epsilon$, a random point in the space, with probability $1-\\delta$, has a neighbor in $S$ that is different from the original point in only $O(\\sqrt{n\\ln(1/(\\epsilon\\delta))})$ coordinates. We obtain the tight computational version of this result, showing how given a random point and access to an $S$-membership oracle, we can find such a close point in polynomial time. This resolves an open question of [Mahloujifar and Mahmoody, ALT 2019]. As corollaries, we"},"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":"1907.05401","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T17:33:03Z","cross_cats_sorted":["cs.CC","cs.CG","cs.CR","cs.LG"],"title_canon_sha256":"07cb1e532490b19a62a8d00bb6f78af9042fcba28351b91e8314af8fc7f160de","abstract_canon_sha256":"0a886b5acc12a4e7584ae9d0f224317a343395aadc62b40dc1b05f75009be18e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:50.389076Z","signature_b64":"PJd4BrarITQohiI2WZOrwgDu/pVfmIpW2pXS3MO9ICrCiFiR8gS5qRRW60lNv1uM0/HHvXSGw4vjfZha4CWYCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"dd7513393ea384ccb31e3a51c6c821618116e2a26e75e2e4df9c77c029c42ea6","last_reissued_at":"2026-05-17T23:40:50.388299Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:50.388299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computational Concentration of Measure: Optimal Bounds, Reductions, and More","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","cs.CG","cs.CR","cs.LG"],"primary_cat":"cs.DS","authors_text":"Mohammad Mahmoody, Omid Etesami, Saeed Mahloujifar","submitted_at":"2019-07-11T17:33:03Z","abstract_excerpt":"Product measures of dimension $n$ are known to be concentrated in Hamming distance: for any set $S$ in the product space of probability $\\epsilon$, a random point in the space, with probability $1-\\delta$, has a neighbor in $S$ that is different from the original point in only $O(\\sqrt{n\\ln(1/(\\epsilon\\delta))})$ coordinates. We obtain the tight computational version of this result, showing how given a random point and access to an $S$-membership oracle, we can find such a close point in polynomial time. This resolves an open question of [Mahloujifar and Mahmoody, ALT 2019]. As corollaries, we"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05401","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":"1907.05401","created_at":"2026-05-17T23:40:50.388439+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.05401v1","created_at":"2026-05-17T23:40:50.388439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05401","created_at":"2026-05-17T23:40:50.388439+00:00"},{"alias_kind":"pith_short_12","alias_value":"3V2RGOJ6UOCM","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_16","alias_value":"3V2RGOJ6UOCMZMY6","created_at":"2026-05-18T12:33:10.108867+00:00"},{"alias_kind":"pith_short_8","alias_value":"3V2RGOJ6","created_at":"2026-05-18T12:33:10.108867+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/3V2RGOJ6UOCMZMY6HJI4NSBBMG","json":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG.json","graph_json":"https://pith.science/api/pith-number/3V2RGOJ6UOCMZMY6HJI4NSBBMG/graph.json","events_json":"https://pith.science/api/pith-number/3V2RGOJ6UOCMZMY6HJI4NSBBMG/events.json","paper":"https://pith.science/paper/3V2RGOJ6"},"agent_actions":{"view_html":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG","download_json":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG.json","view_paper":"https://pith.science/paper/3V2RGOJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.05401&json=true","fetch_graph":"https://pith.science/api/pith-number/3V2RGOJ6UOCMZMY6HJI4NSBBMG/graph.json","fetch_events":"https://pith.science/api/pith-number/3V2RGOJ6UOCMZMY6HJI4NSBBMG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/action/storage_attestation","attest_author":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/action/author_attestation","sign_citation":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/action/citation_signature","submit_replication":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/action/replication_record"}},"created_at":"2026-05-17T23:40:50.388439+00:00","updated_at":"2026-05-17T23:40:50.388439+00:00"}