{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:PCSHKQVHUMJGZVWDKYS4ND2PDQ","short_pith_number":"pith:PCSHKQVH","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"},"canonical_sha256":"78a47542a7a3126cd6c35625c68f4f1c37ac245a96cc9a2304b7af943bead78e","source":{"kind":"arxiv","id":"1610.02686","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02686","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02686v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02686","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"PCSHKQVHUMJG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCSHKQVHUMJGZVWD","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCSHKQVH","created_at":"2026-05-18T12:30:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:PCSHKQVHUMJGZVWDKYS4ND2PDQ","target":"record","payload":{"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"},"canonical_sha256":"78a47542a7a3126cd6c35625c68f4f1c37ac245a96cc9a2304b7af943bead78e","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"},"source_kind":"arxiv","source_id":"1610.02686","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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+FaFvBPmw/8uZxxpOHI997CB9pDsoMEVF0u0TQKT2OwhOxYA1ssKZuhcl1pID6bu5bUmStOzy7bjX9sg3kNdBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:39:31.279866Z"},"content_sha256":"007849c3513a7eef4fa2d8ce898929742a5d6efe3c634305e4f5ed1090611af2","schema_version":"1.0","event_id":"sha256:007849c3513a7eef4fa2d8ce898929742a5d6efe3c634305e4f5ed1090611af2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:PCSHKQVHUMJGZVWDKYS4ND2PDQ","target":"graph","payload":{"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"},"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-18T01:02:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"q64H95Gi4i18bE7bgxQpvGo1wRNCAKL/ixllAPFN8GR1xyNM/LgfKnoA7zER2ajbx0bU+wPsJ4H3peMZk6lLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:39:31.280214Z"},"content_sha256":"81c9cf0e3f2b2717583c8a809f28e4d3cb2fc01301ea6b6f85260acd550e4534","schema_version":"1.0","event_id":"sha256:81c9cf0e3f2b2717583c8a809f28e4d3cb2fc01301ea6b6f85260acd550e4534"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/bundle.json","state_url":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/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-06-03T02:39:31Z","links":{"resolver":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ","bundle":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/bundle.json","state":"https://pith.science/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PCSHKQVHUMJGZVWDKYS4ND2PDQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:PCSHKQVHUMJGZVWDKYS4ND2PDQ","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":"284402e02208aaa9f55883091c8a57dd541d5f255d2ffae1c7ad961b1c2c6e7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T15:37:17Z","title_canon_sha256":"6db6b2e0c666bdf0c84e83464009e093b68f1cbb943d3eed9dcb50d0fed4b593"},"schema_version":"1.0","source":{"id":"1610.02686","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1610.02686","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"arxiv_version","alias_value":"1610.02686v1","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02686","created_at":"2026-05-18T01:02:50Z"},{"alias_kind":"pith_short_12","alias_value":"PCSHKQVHUMJG","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_16","alias_value":"PCSHKQVHUMJGZVWD","created_at":"2026-05-18T12:30:39Z"},{"alias_kind":"pith_short_8","alias_value":"PCSHKQVH","created_at":"2026-05-18T12:30:39Z"}],"graph_snapshots":[{"event_id":"sha256:81c9cf0e3f2b2717583c8a809f28e4d3cb2fc01301ea6b6f85260acd550e4534","target":"graph","created_at":"2026-05-18T01:02: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":"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 ","authors_text":"Alexander S. Kulikov, Vladimir V. Podolskii","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T15:37:17Z","title":"Computing Majority by Constant Depth Majority Circuits with Low Fan-in Gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02686","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:007849c3513a7eef4fa2d8ce898929742a5d6efe3c634305e4f5ed1090611af2","target":"record","created_at":"2026-05-18T01:02: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":"284402e02208aaa9f55883091c8a57dd541d5f255d2ffae1c7ad961b1c2c6e7d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2016-10-09T15:37:17Z","title_canon_sha256":"6db6b2e0c666bdf0c84e83464009e093b68f1cbb943d3eed9dcb50d0fed4b593"},"schema_version":"1.0","source":{"id":"1610.02686","kind":"arxiv","version":1}},"canonical_sha256":"78a47542a7a3126cd6c35625c68f4f1c37ac245a96cc9a2304b7af943bead78e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"78a47542a7a3126cd6c35625c68f4f1c37ac245a96cc9a2304b7af943bead78e","first_computed_at":"2026-05-18T01:02:50.941786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:02:50.941786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/FC6hOfczuRSf8Cg4Rc52tbNVuZZcKV0g8IMxMOllRc9Btigv04QvbXOFy1GMVyoj2OgqvxhlW2588e6VUulAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:02:50.942129Z","signed_message":"canonical_sha256_bytes"},"source_id":"1610.02686","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:007849c3513a7eef4fa2d8ce898929742a5d6efe3c634305e4f5ed1090611af2","sha256:81c9cf0e3f2b2717583c8a809f28e4d3cb2fc01301ea6b6f85260acd550e4534"],"state_sha256":"adc1c6b1ca5eb1d8541e09aaa801e6a8b16533aa12b88d4f9d57ec764613ac5a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"53nVzMlfD4VJTconaHVxGCQRSy0ICp9SzkzrtK54XA4xRgx+XAn2CSC2iZKasdcI1Fb0SEMcbxTYHZTHOITnCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:39:31.282208Z","bundle_sha256":"3e9835a90a5496ce468b922005c46bd7251a345a6afc151333669ae7eee4df34"}}