{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NUDEE7T262IVL7SHGJYUMRAMUY","short_pith_number":"pith:NUDEE7T2","schema_version":"1.0","canonical_sha256":"6d06427e7af69155fe47327146440ca60ddbda0797c6e7e56f64709c53a3cac9","source":{"kind":"arxiv","id":"2306.13262","version":3},"attestation_state":"computed","paper":{"title":"Reliable computation by large-alphabet formulas in the presence of noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew K. Tan, Isaac L. Chuang, Matthew Ho","submitted_at":"2023-06-23T02:14:21Z","abstract_excerpt":"We present two new positive results for reliable computation using formulas over physical alphabets of size $q > 2$. First, we show that for logical alphabets of size $\\ell = q$ the threshold for denoising using gates subject to $q$-ary symmetric noise with error probability $\\varepsilon$ is strictly larger than that for Boolean computation, and is possible as long as signals remain distinguishable, i.e. $\\epsilon < (q - 1) / q$, in the limit of large fan-in $k \\rightarrow \\infty$. We also determine the point at which generalized majority gates with bounded fan-in fail, and show in particular "},"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":"2306.13262","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2023-06-23T02:14:21Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7b40d16134429b700f77e4c816dca853113f1c7ebc8b10047c611ddafd92a881","abstract_canon_sha256":"152978d4a85507e93842ab5b0721e88f56a39e158d1d8f1363d58482e7b340d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:52.712294Z","signature_b64":"f/s5HIsgwLbpIAoGIPydouj4qpg+M2EN9ZDTChm0D9ZlVNQGv4Drfz0uirTYScD06TbHpp9utFPWK0dJGQOiCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d06427e7af69155fe47327146440ca60ddbda0797c6e7e56f64709c53a3cac9","last_reissued_at":"2026-07-05T09:40:52.711787Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:52.711787Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Reliable computation by large-alphabet formulas in the presence of noise","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Andrew K. Tan, Isaac L. Chuang, Matthew Ho","submitted_at":"2023-06-23T02:14:21Z","abstract_excerpt":"We present two new positive results for reliable computation using formulas over physical alphabets of size $q > 2$. First, we show that for logical alphabets of size $\\ell = q$ the threshold for denoising using gates subject to $q$-ary symmetric noise with error probability $\\varepsilon$ is strictly larger than that for Boolean computation, and is possible as long as signals remain distinguishable, i.e. $\\epsilon < (q - 1) / q$, in the limit of large fan-in $k \\rightarrow \\infty$. We also determine the point at which generalized majority gates with bounded fan-in fail, and show in particular "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.13262","kind":"arxiv","version":3},"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/2306.13262/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":"2306.13262","created_at":"2026-07-05T09:40:52.711852+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.13262v3","created_at":"2026-07-05T09:40:52.711852+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.13262","created_at":"2026-07-05T09:40:52.711852+00:00"},{"alias_kind":"pith_short_12","alias_value":"NUDEE7T262IV","created_at":"2026-07-05T09:40:52.711852+00:00"},{"alias_kind":"pith_short_16","alias_value":"NUDEE7T262IVL7SH","created_at":"2026-07-05T09:40:52.711852+00:00"},{"alias_kind":"pith_short_8","alias_value":"NUDEE7T2","created_at":"2026-07-05T09:40:52.711852+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/NUDEE7T262IVL7SHGJYUMRAMUY","json":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY.json","graph_json":"https://pith.science/api/pith-number/NUDEE7T262IVL7SHGJYUMRAMUY/graph.json","events_json":"https://pith.science/api/pith-number/NUDEE7T262IVL7SHGJYUMRAMUY/events.json","paper":"https://pith.science/paper/NUDEE7T2"},"agent_actions":{"view_html":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY","download_json":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY.json","view_paper":"https://pith.science/paper/NUDEE7T2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.13262&json=true","fetch_graph":"https://pith.science/api/pith-number/NUDEE7T262IVL7SHGJYUMRAMUY/graph.json","fetch_events":"https://pith.science/api/pith-number/NUDEE7T262IVL7SHGJYUMRAMUY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY/action/storage_attestation","attest_author":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY/action/author_attestation","sign_citation":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY/action/citation_signature","submit_replication":"https://pith.science/pith/NUDEE7T262IVL7SHGJYUMRAMUY/action/replication_record"}},"created_at":"2026-07-05T09:40:52.711852+00:00","updated_at":"2026-07-05T09:40:52.711852+00:00"}