{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:VXBVOYOJG4PDGMEFHA5HLDAOUH","short_pith_number":"pith:VXBVOYOJ","canonical_record":{"source":{"id":"1711.10176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T08:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"be2331aaac4a16cf57fca154ddc86a6cbcec4a8b0f084e4f2cae8022ec604535","abstract_canon_sha256":"c5d1b99cf8709c6bffeabaf1460b61bc42402ff7d154d54f8ea7ad752fc960ec"},"schema_version":"1.0"},"canonical_sha256":"adc35761c9371e333085383a758c0ea1ecd52def7df9bfa8389b66a2315938eb","source":{"kind":"arxiv","id":"1711.10176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10176","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10176v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10176","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"VXBVOYOJG4PD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VXBVOYOJG4PDGMEF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VXBVOYOJ","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:VXBVOYOJG4PDGMEFHA5HLDAOUH","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10176","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T08:38:54Z","cross_cats_sorted":[],"title_canon_sha256":"be2331aaac4a16cf57fca154ddc86a6cbcec4a8b0f084e4f2cae8022ec604535","abstract_canon_sha256":"c5d1b99cf8709c6bffeabaf1460b61bc42402ff7d154d54f8ea7ad752fc960ec"},"schema_version":"1.0"},"canonical_sha256":"adc35761c9371e333085383a758c0ea1ecd52def7df9bfa8389b66a2315938eb","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:23.103355Z","signature_b64":"uCa3pg1cNNYAVO5cNI09kNaAZl15pqAqKCiG/xJxAokZExVJzvBMmL658qv+iQYi49uEJnVM0hT+fmiUSg/uDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"adc35761c9371e333085383a758c0ea1ecd52def7df9bfa8389b66a2315938eb","last_reissued_at":"2026-05-18T00:29:23.102683Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:23.102683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10176","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-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3MORiIYrEuQEpdqYSX1G1WDKTb3g0MQIgB6l010Dkuo9gYue9pPB+7lYr2kt8Bn4JeTmoliUHNpLYTKSLdJdAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T02:35:20.198464Z"},"content_sha256":"c412a7ee55d09d5cc4d4ee798ade3aed3b068de9ed52f81485c9e8dfd6e15de7","schema_version":"1.0","event_id":"sha256:c412a7ee55d09d5cc4d4ee798ade3aed3b068de9ed52f81485c9e8dfd6e15de7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:VXBVOYOJG4PDGMEFHA5HLDAOUH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Computing majority with low-fan-in majority queries","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.CC","authors_text":"Gleb Posobin","submitted_at":"2017-11-28T08:38:54Z","abstract_excerpt":"In this paper we examine the problem of computing majority function $\\mathrm{MAJ}_n$ on $n$ bits by depth-two formula, where each gate is a majority function on at most $k$ inputs. We present such formula that gives the first nontrivial upper bound for this problem, with $k = \\frac{2}{3} n + 4$. This answers an open question in [Kulikov, Podolskii, 2017].\n  We also look at this problem in adaptive setting - when we are allowed to query for value of $\\mathrm{MAJ}_k$ on any subset, and wish to minimize the number of such queries. We give a simple lower bound for this setting with $\\lceil n/k \\rc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10176","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-18T00:29:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hALR+rRtdQLMWocMoH2iyNiv76bufyJs94M2qhFTbSrUqXcyZRVdGMsu8rY1JOYbxgSbpmL6Jz16R9cu4zwhAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T02:35:20.198804Z"},"content_sha256":"f685d2c303359c8af7fdd194733536f5ce3f6fa75b56db7a1b67c730370a2220","schema_version":"1.0","event_id":"sha256:f685d2c303359c8af7fdd194733536f5ce3f6fa75b56db7a1b67c730370a2220"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/VXBVOYOJG4PDGMEFHA5HLDAOUH/bundle.json","state_url":"https://pith.science/pith/VXBVOYOJG4PDGMEFHA5HLDAOUH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/VXBVOYOJG4PDGMEFHA5HLDAOUH/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-07-03T02:35:20Z","links":{"resolver":"https://pith.science/pith/VXBVOYOJG4PDGMEFHA5HLDAOUH","bundle":"https://pith.science/pith/VXBVOYOJG4PDGMEFHA5HLDAOUH/bundle.json","state":"https://pith.science/pith/VXBVOYOJG4PDGMEFHA5HLDAOUH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/VXBVOYOJG4PDGMEFHA5HLDAOUH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:VXBVOYOJG4PDGMEFHA5HLDAOUH","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":"c5d1b99cf8709c6bffeabaf1460b61bc42402ff7d154d54f8ea7ad752fc960ec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T08:38:54Z","title_canon_sha256":"be2331aaac4a16cf57fca154ddc86a6cbcec4a8b0f084e4f2cae8022ec604535"},"schema_version":"1.0","source":{"id":"1711.10176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10176","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10176v1","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10176","created_at":"2026-05-18T00:29:23Z"},{"alias_kind":"pith_short_12","alias_value":"VXBVOYOJG4PD","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"VXBVOYOJG4PDGMEF","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"VXBVOYOJ","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:f685d2c303359c8af7fdd194733536f5ce3f6fa75b56db7a1b67c730370a2220","target":"graph","created_at":"2026-05-18T00:29:23Z","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":"In this paper we examine the problem of computing majority function $\\mathrm{MAJ}_n$ on $n$ bits by depth-two formula, where each gate is a majority function on at most $k$ inputs. We present such formula that gives the first nontrivial upper bound for this problem, with $k = \\frac{2}{3} n + 4$. This answers an open question in [Kulikov, Podolskii, 2017].\n  We also look at this problem in adaptive setting - when we are allowed to query for value of $\\mathrm{MAJ}_k$ on any subset, and wish to minimize the number of such queries. We give a simple lower bound for this setting with $\\lceil n/k \\rc","authors_text":"Gleb Posobin","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T08:38:54Z","title":"Computing majority with low-fan-in majority queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10176","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:c412a7ee55d09d5cc4d4ee798ade3aed3b068de9ed52f81485c9e8dfd6e15de7","target":"record","created_at":"2026-05-18T00:29:23Z","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":"c5d1b99cf8709c6bffeabaf1460b61bc42402ff7d154d54f8ea7ad752fc960ec","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CC","submitted_at":"2017-11-28T08:38:54Z","title_canon_sha256":"be2331aaac4a16cf57fca154ddc86a6cbcec4a8b0f084e4f2cae8022ec604535"},"schema_version":"1.0","source":{"id":"1711.10176","kind":"arxiv","version":1}},"canonical_sha256":"adc35761c9371e333085383a758c0ea1ecd52def7df9bfa8389b66a2315938eb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"adc35761c9371e333085383a758c0ea1ecd52def7df9bfa8389b66a2315938eb","first_computed_at":"2026-05-18T00:29:23.102683Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:23.102683Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"uCa3pg1cNNYAVO5cNI09kNaAZl15pqAqKCiG/xJxAokZExVJzvBMmL658qv+iQYi49uEJnVM0hT+fmiUSg/uDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:23.103355Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c412a7ee55d09d5cc4d4ee798ade3aed3b068de9ed52f81485c9e8dfd6e15de7","sha256:f685d2c303359c8af7fdd194733536f5ce3f6fa75b56db7a1b67c730370a2220"],"state_sha256":"35e103a8ade27e94e906103a57e5d38560e1def0ff265d27bad321b149e590b4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vi2CnJm7uRFGONEK6L4m0FUEfPpSSKtRWSF5uvJWaaOmyyirsUhpwZ6Dlvp/6cBjcrrX/2e16vA63prCNOs4DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T02:35:20.200559Z","bundle_sha256":"4aef9a36114792a67efc29f6d787b96cbc9514b6942695a9a3a081d1f202c916"}}