{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:6MQ7IBL2WUH3OROLOE4O4H7NTO","short_pith_number":"pith:6MQ7IBL2","schema_version":"1.0","canonical_sha256":"f321f4057ab50fb745cb7138ee1fed9b81186cd447a912cce0b1b6ba211d6a24","source":{"kind":"arxiv","id":"1206.4851","version":2},"attestation_state":"computed","paper":{"title":"On reliable computation by noisy random Boolean formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alexander Mozeika, David Saad","submitted_at":"2012-06-21T12:31:28Z","abstract_excerpt":"We study noisy computation in randomly generated k-ary Boolean formulas. We establish bounds on the noise level above which the results of computation by random formulas are not reliable. This bound is saturated by formulas constructed from a single majority-like gates. We show that these gates can be used to compute any Boolean function reliably below the noise bound."},"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":"1206.4851","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cond-mat.dis-nn","submitted_at":"2012-06-21T12:31:28Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"643e6b342843282c11207b22643d1e69fa8cbafe78b13c3a663700650decd390","abstract_canon_sha256":"c03d7d62ae4d98573e7a33a655ac8028188d36bbb97dfaacae2e32f572c3c76e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:33:25.721544Z","signature_b64":"gkaAUERCKFvbI1Ejnl3MY5H57Fv7RKTmJkrOq8TBlrSfrWkdH5tWddDM+L7EbtwZlImFpSjSTlXC0zblFN54Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f321f4057ab50fb745cb7138ee1fed9b81186cd447a912cce0b1b6ba211d6a24","last_reissued_at":"2026-05-18T02:33:25.721125Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:33:25.721125Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On reliable computation by noisy random Boolean formulas","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cond-mat.dis-nn","authors_text":"Alexander Mozeika, David Saad","submitted_at":"2012-06-21T12:31:28Z","abstract_excerpt":"We study noisy computation in randomly generated k-ary Boolean formulas. We establish bounds on the noise level above which the results of computation by random formulas are not reliable. This bound is saturated by formulas constructed from a single majority-like gates. We show that these gates can be used to compute any Boolean function reliably below the noise bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.4851","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":""},"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":"1206.4851","created_at":"2026-05-18T02:33:25.721186+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.4851v2","created_at":"2026-05-18T02:33:25.721186+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.4851","created_at":"2026-05-18T02:33:25.721186+00:00"},{"alias_kind":"pith_short_12","alias_value":"6MQ7IBL2WUH3","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"6MQ7IBL2WUH3OROL","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"6MQ7IBL2","created_at":"2026-05-18T12:26:56.085431+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/6MQ7IBL2WUH3OROLOE4O4H7NTO","json":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO.json","graph_json":"https://pith.science/api/pith-number/6MQ7IBL2WUH3OROLOE4O4H7NTO/graph.json","events_json":"https://pith.science/api/pith-number/6MQ7IBL2WUH3OROLOE4O4H7NTO/events.json","paper":"https://pith.science/paper/6MQ7IBL2"},"agent_actions":{"view_html":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO","download_json":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO.json","view_paper":"https://pith.science/paper/6MQ7IBL2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.4851&json=true","fetch_graph":"https://pith.science/api/pith-number/6MQ7IBL2WUH3OROLOE4O4H7NTO/graph.json","fetch_events":"https://pith.science/api/pith-number/6MQ7IBL2WUH3OROLOE4O4H7NTO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO/action/storage_attestation","attest_author":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO/action/author_attestation","sign_citation":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO/action/citation_signature","submit_replication":"https://pith.science/pith/6MQ7IBL2WUH3OROLOE4O4H7NTO/action/replication_record"}},"created_at":"2026-05-18T02:33:25.721186+00:00","updated_at":"2026-05-18T02:33:25.721186+00:00"}