{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:Y2XORU66XRZGRTQSEHRA5PVTND","short_pith_number":"pith:Y2XORU66","schema_version":"1.0","canonical_sha256":"c6aee8d3debc7268ce1221e20ebeb368cf61dad7bf837ced60812f04f6d821e8","source":{"kind":"arxiv","id":"1509.08276","version":2},"attestation_state":"computed","paper":{"title":"Finding a non-minority ball with majority answers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, G\\'abor Wiener, M\\'at\\'e Vizer","submitted_at":"2015-09-28T11:22:54Z","abstract_excerpt":"Suppose we are given a set of $n$ balls $\\{b_1,\\ldots,b_n\\}$ each colored either red or blue in some way unknown to us. To find out some information about the colors, we can query any triple of balls $\\{b_{i_1},b_{i_2},b_{i_3}\\}$. As an answer to such a query we obtain (the index of) a {\\em majority ball}, that is, a ball whose color is the same as the color of another ball from the triple. Our goal is to find a {\\em non-minority ball}, that is, a ball whose color occurs at least $\\frac n2$ times among the $n$ balls. We show that the minimum number of queries needed to solve this problem is $\\"},"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":"1509.08276","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-28T11:22:54Z","cross_cats_sorted":[],"title_canon_sha256":"628603d325c426fead9f8fad9a92445e60478659d0fddd1b3acae77954301ddd","abstract_canon_sha256":"d569e7a49c3686a4b03887c33da74c643bf80651bdbd975531d1749ffc2e41b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:03:44.338159Z","signature_b64":"cwh0ZNl+szi4PcoPrfDaFVY/vTNDbyCtD0O8AXPXikqlnMja6B+uFg61UpDnxkIA3945hvE+SHDw3uQwxKuJCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6aee8d3debc7268ce1221e20ebeb368cf61dad7bf837ced60812f04f6d821e8","last_reissued_at":"2026-05-18T01:03:44.337728Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:03:44.337728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding a non-minority ball with majority answers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bal\\'azs Keszegh, Bal\\'azs Patk\\'os, D\\'aniel Gerbner, D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi, G\\'abor Wiener, M\\'at\\'e Vizer","submitted_at":"2015-09-28T11:22:54Z","abstract_excerpt":"Suppose we are given a set of $n$ balls $\\{b_1,\\ldots,b_n\\}$ each colored either red or blue in some way unknown to us. To find out some information about the colors, we can query any triple of balls $\\{b_{i_1},b_{i_2},b_{i_3}\\}$. As an answer to such a query we obtain (the index of) a {\\em majority ball}, that is, a ball whose color is the same as the color of another ball from the triple. Our goal is to find a {\\em non-minority ball}, that is, a ball whose color occurs at least $\\frac n2$ times among the $n$ balls. We show that the minimum number of queries needed to solve this problem is $\\"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08276","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":"1509.08276","created_at":"2026-05-18T01:03:44.337803+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.08276v2","created_at":"2026-05-18T01:03:44.337803+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08276","created_at":"2026-05-18T01:03:44.337803+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y2XORU66XRZG","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y2XORU66XRZGRTQS","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y2XORU66","created_at":"2026-05-18T12:29:50.041715+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/Y2XORU66XRZGRTQSEHRA5PVTND","json":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND.json","graph_json":"https://pith.science/api/pith-number/Y2XORU66XRZGRTQSEHRA5PVTND/graph.json","events_json":"https://pith.science/api/pith-number/Y2XORU66XRZGRTQSEHRA5PVTND/events.json","paper":"https://pith.science/paper/Y2XORU66"},"agent_actions":{"view_html":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND","download_json":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND.json","view_paper":"https://pith.science/paper/Y2XORU66","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.08276&json=true","fetch_graph":"https://pith.science/api/pith-number/Y2XORU66XRZGRTQSEHRA5PVTND/graph.json","fetch_events":"https://pith.science/api/pith-number/Y2XORU66XRZGRTQSEHRA5PVTND/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/action/storage_attestation","attest_author":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/action/author_attestation","sign_citation":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/action/citation_signature","submit_replication":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/action/replication_record"}},"created_at":"2026-05-18T01:03:44.337803+00:00","updated_at":"2026-05-18T01:03:44.337803+00:00"}