{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3V2RGOJ6UOCMZMY6HJI4NSBBMG","short_pith_number":"pith:3V2RGOJ6","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"},"canonical_sha256":"dd7513393ea384ccb31e3a51c6c821618116e2a26e75e2e4df9c77c029c42ea6","source":{"kind":"arxiv","id":"1907.05401","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05401","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05401v1","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05401","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"3V2RGOJ6UOCM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3V2RGOJ6UOCMZMY6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3V2RGOJ6","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3V2RGOJ6UOCMZMY6HJI4NSBBMG","target":"record","payload":{"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"},"canonical_sha256":"dd7513393ea384ccb31e3a51c6c821618116e2a26e75e2e4df9c77c029c42ea6","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"},"source_kind":"arxiv","source_id":"1907.05401","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-05-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WVL+NpIHBT2ZIdTIkUgSAdo6gY/CrVdyxFwDDFKrNIBMl8AO0GUaPjDp7W7dXbxULOs08lTD6HOJwbmf5noYBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:00:30.518479Z"},"content_sha256":"6af4dee2ac3e6bf7572dfedc093661868686a5aa2c2236571c4d6a08c763198a","schema_version":"1.0","event_id":"sha256:6af4dee2ac3e6bf7572dfedc093661868686a5aa2c2236571c4d6a08c763198a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3V2RGOJ6UOCMZMY6HJI4NSBBMG","target":"graph","payload":{"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"},"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-05-17T23:40:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hFvJCsHBAs8kzD5fkVdpDnAVt3ERCeHHa3D/9MXeu0AbMxhqRZck47mQv0lrB7VJYR11heCY0GdBqMcXKPjTCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T03:00:30.519149Z"},"content_sha256":"c8c5d54be75635983d1b7e66fa81f1c613d3d790335a30c16604ebc018dee7c5","schema_version":"1.0","event_id":"sha256:c8c5d54be75635983d1b7e66fa81f1c613d3d790335a30c16604ebc018dee7c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/bundle.json","state_url":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/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-05-31T03:00:30Z","links":{"resolver":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG","bundle":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/bundle.json","state":"https://pith.science/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3V2RGOJ6UOCMZMY6HJI4NSBBMG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3V2RGOJ6UOCMZMY6HJI4NSBBMG","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":"0a886b5acc12a4e7584ae9d0f224317a343395aadc62b40dc1b05f75009be18e","cross_cats_sorted":["cs.CC","cs.CG","cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T17:33:03Z","title_canon_sha256":"07cb1e532490b19a62a8d00bb6f78af9042fcba28351b91e8314af8fc7f160de"},"schema_version":"1.0","source":{"id":"1907.05401","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.05401","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"arxiv_version","alias_value":"1907.05401v1","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.05401","created_at":"2026-05-17T23:40:50Z"},{"alias_kind":"pith_short_12","alias_value":"3V2RGOJ6UOCM","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"3V2RGOJ6UOCMZMY6","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"3V2RGOJ6","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:c8c5d54be75635983d1b7e66fa81f1c613d3d790335a30c16604ebc018dee7c5","target":"graph","created_at":"2026-05-17T23:40:50Z","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"},"paper":{"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","authors_text":"Mohammad Mahmoody, Omid Etesami, Saeed Mahloujifar","cross_cats":["cs.CC","cs.CG","cs.CR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T17:33:03Z","title":"Computational Concentration of Measure: Optimal Bounds, Reductions, and More"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.05401","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:6af4dee2ac3e6bf7572dfedc093661868686a5aa2c2236571c4d6a08c763198a","target":"record","created_at":"2026-05-17T23:40:50Z","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":"0a886b5acc12a4e7584ae9d0f224317a343395aadc62b40dc1b05f75009be18e","cross_cats_sorted":["cs.CC","cs.CG","cs.CR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-11T17:33:03Z","title_canon_sha256":"07cb1e532490b19a62a8d00bb6f78af9042fcba28351b91e8314af8fc7f160de"},"schema_version":"1.0","source":{"id":"1907.05401","kind":"arxiv","version":1}},"canonical_sha256":"dd7513393ea384ccb31e3a51c6c821618116e2a26e75e2e4df9c77c029c42ea6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"dd7513393ea384ccb31e3a51c6c821618116e2a26e75e2e4df9c77c029c42ea6","first_computed_at":"2026-05-17T23:40:50.388299Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:50.388299Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PJd4BrarITQohiI2WZOrwgDu/pVfmIpW2pXS3MO9ICrCiFiR8gS5qRRW60lNv1uM0/HHvXSGw4vjfZha4CWYCQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:50.389076Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.05401","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6af4dee2ac3e6bf7572dfedc093661868686a5aa2c2236571c4d6a08c763198a","sha256:c8c5d54be75635983d1b7e66fa81f1c613d3d790335a30c16604ebc018dee7c5"],"state_sha256":"b189cf177101e7d15bfebfcb96d0693396137b7dfb64673f561beae489dd3327"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tBgDEJJGp5igi8jkdrIhGznk9eTBVrNXBc82FZJbWinL4D0+4AeA0IssZGGN42l1cqGtM6VglNiTGUDdvrfDBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T03:00:30.522441Z","bundle_sha256":"5791b1fe6d78cc0fb80363583a2d1f74e2ff5a011325751952518be5b5316ff4"}}