{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MN44SDYVROTWFNLENCNZY674EG","short_pith_number":"pith:MN44SDYV","schema_version":"1.0","canonical_sha256":"6379c90f158ba762b564689b9c7bfc21a0ca49637ac7a79f4d151acc221a0e9c","source":{"kind":"arxiv","id":"2411.08183","version":2},"attestation_state":"computed","paper":{"title":"Locally Sampleable Uniform Symmetric Distributions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anthony Ostuni, Daniel M. Kane, Kewen Wu","submitted_at":"2024-11-12T21:07:25Z","abstract_excerpt":"We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\\colon\\{0,1\\}^m\\to\\{0,1\\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the output distribution of $f$ on uniform input bits is close to a uniform distribution $D$ with a symmetric support. We show that $D$ is essentially one of the following six possibilities: (1) point distribution on $0^n$, (2) point distribution on $1^n$, (3) uniform over $\\{0^n,1^n\\}$, (4) uniform over strings with even Hamming weights, (5) uniform over strings"},"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":"2411.08183","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2024-11-12T21:07:25Z","cross_cats_sorted":[],"title_canon_sha256":"ec220d4f5f904350b887ab085913b9dfde05a0d511f6ad3e9270f7d665b71678","abstract_canon_sha256":"9868ba467bf35f228c7e9419b7cbebec52106e518cf370d0efe6d7048c5f14f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:19:56.479425Z","signature_b64":"9pjf2iJZReWWNAwqleLCpx4YVZmNyUIc6v7+43bpvTKAuhnkxG1Q81b47MMdfUXXLZAb4CNjCigrrQeVGxXRCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6379c90f158ba762b564689b9c7bfc21a0ca49637ac7a79f4d151acc221a0e9c","last_reissued_at":"2026-07-05T10:19:56.478963Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:19:56.478963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Locally Sampleable Uniform Symmetric Distributions","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Anthony Ostuni, Daniel M. Kane, Kewen Wu","submitted_at":"2024-11-12T21:07:25Z","abstract_excerpt":"We characterize the power of constant-depth Boolean circuits in generating uniform symmetric distributions. Let $f\\colon\\{0,1\\}^m\\to\\{0,1\\}^n$ be a Boolean function where each output bit of $f$ depends only on $O(1)$ input bits. Assume the output distribution of $f$ on uniform input bits is close to a uniform distribution $D$ with a symmetric support. We show that $D$ is essentially one of the following six possibilities: (1) point distribution on $0^n$, (2) point distribution on $1^n$, (3) uniform over $\\{0^n,1^n\\}$, (4) uniform over strings with even Hamming weights, (5) uniform over strings"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.08183","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/2411.08183/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":"2411.08183","created_at":"2026-07-05T10:19:56.479019+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.08183v2","created_at":"2026-07-05T10:19:56.479019+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.08183","created_at":"2026-07-05T10:19:56.479019+00:00"},{"alias_kind":"pith_short_12","alias_value":"MN44SDYVROTW","created_at":"2026-07-05T10:19:56.479019+00:00"},{"alias_kind":"pith_short_16","alias_value":"MN44SDYVROTWFNLE","created_at":"2026-07-05T10:19:56.479019+00:00"},{"alias_kind":"pith_short_8","alias_value":"MN44SDYV","created_at":"2026-07-05T10:19:56.479019+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/MN44SDYVROTWFNLENCNZY674EG","json":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG.json","graph_json":"https://pith.science/api/pith-number/MN44SDYVROTWFNLENCNZY674EG/graph.json","events_json":"https://pith.science/api/pith-number/MN44SDYVROTWFNLENCNZY674EG/events.json","paper":"https://pith.science/paper/MN44SDYV"},"agent_actions":{"view_html":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG","download_json":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG.json","view_paper":"https://pith.science/paper/MN44SDYV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.08183&json=true","fetch_graph":"https://pith.science/api/pith-number/MN44SDYVROTWFNLENCNZY674EG/graph.json","fetch_events":"https://pith.science/api/pith-number/MN44SDYVROTWFNLENCNZY674EG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG/action/storage_attestation","attest_author":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG/action/author_attestation","sign_citation":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG/action/citation_signature","submit_replication":"https://pith.science/pith/MN44SDYVROTWFNLENCNZY674EG/action/replication_record"}},"created_at":"2026-07-05T10:19:56.479019+00:00","updated_at":"2026-07-05T10:19:56.479019+00:00"}