{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:PCSHKQVHUMJGZVWDKYS4ND2PDQ","short_pith_number":"pith:PCSHKQVH","schema_version":"1.0","canonical_sha256":"78a47542a7a3126cd6c35625c68f4f1c37ac245a96cc9a2304b7af943bead78e","source":{"kind":"arxiv","id":"1610.02686","version":1},"attestation_state":"computed","paper":{"title":"Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander S. Kulikov, Vladimir V. Podolskii","submitted_at":"2016-10-09T15:37:17Z","abstract_excerpt":"We study the following computational problem: for which values of $k$, the majority of $n$ bits $\\text{MAJ}_n$ can be computed with a depth two formula whose each gate computes a majority function of at most $k$ bits? The corresponding computational model is denoted by $\\text{MAJ}_k \\circ \\text{MAJ}_k$. We observe that the minimum value of $k$ for which there exists a $\\text{MAJ}_k \\circ \\text{MAJ}_k$ circuit that has high correlation with the majority of $n$ bits is equal to $\\Theta(n^{1/2})$. We then show that for a randomized $\\text{MAJ}_k \\circ \\text{MAJ}_k$ circuit computing the majority "},"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":"1610.02686","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T15:37:17Z","cross_cats_sorted":[],"title_canon_sha256":"6db6b2e0c666bdf0c84e83464009e093b68f1cbb943d3eed9dcb50d0fed4b593","abstract_canon_sha256":"284402e02208aaa9f55883091c8a57dd541d5f255d2ffae1c7ad961b1c2c6e7d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:50.942129Z","signature_b64":"/FC6hOfczuRSf8Cg4Rc52tbNVuZZcKV0g8IMxMOllRc9Btigv04QvbXOFy1GMVyoj2OgqvxhlW2588e6VUulAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78a47542a7a3126cd6c35625c68f4f1c37ac245a96cc9a2304b7af943bead78e","last_reissued_at":"2026-05-18T01:02:50.941786Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:50.941786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Alexander S. Kulikov, Vladimir V. Podolskii","submitted_at":"2016-10-09T15:37:17Z","abstract_excerpt":"We study the following computational problem: for which values of $k$, the majority of $n$ bits $\\text{MAJ}_n$ can be computed with a depth two formula whose each gate computes a majority function of at most $k$ bits? The corresponding computational model is denoted by $\\text{MAJ}_k \\circ \\text{MAJ}_k$. We observe that the minimum value of $k$ for which there exists a $\\text{MAJ}_k \\circ \\text{MAJ}_k$ circuit that has high correlation with the majority of $n$ bits is equal to $\\Theta(n^{1/2})$. We then show that for a randomized $\\text{MAJ}_k \\circ \\text{MAJ}_k$ circuit computing the majority "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02686","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":"1610.02686","created_at":"2026-05-18T01:02:50.941841+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02686v1","created_at":"2026-05-18T01:02:50.941841+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02686","created_at":"2026-05-18T01:02:50.941841+00:00"},{"alias_kind":"pith_short_12","alias_value":"PCSHKQVHUMJG","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"PCSHKQVHUMJGZVWD","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"PCSHKQVH","created_at":"2026-05-18T12:30:39.010887+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/PCSHKQVHUMJGZVWDKYS4ND2PDQ","json":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ.json","graph_json":"https://pith.science/api/pith-number/PCSHKQVHUMJGZVWDKYS4ND2PDQ/graph.json","events_json":"https://pith.science/api/pith-number/PCSHKQVHUMJGZVWDKYS4ND2PDQ/events.json","paper":"https://pith.science/paper/PCSHKQVH"},"agent_actions":{"view_html":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ","download_json":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ.json","view_paper":"https://pith.science/paper/PCSHKQVH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02686&json=true","fetch_graph":"https://pith.science/api/pith-number/PCSHKQVHUMJGZVWDKYS4ND2PDQ/graph.json","fetch_events":"https://pith.science/api/pith-number/PCSHKQVHUMJGZVWDKYS4ND2PDQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/action/storage_attestation","attest_author":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/action/author_attestation","sign_citation":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/action/citation_signature","submit_replication":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/action/replication_record"}},"created_at":"2026-05-18T01:02:50.941841+00:00","updated_at":"2026-05-18T01:02:50.941841+00:00"}