{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:Y2XORU66XRZGRTQSEHRA5PVTND","short_pith_number":"pith:Y2XORU66","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"},"canonical_sha256":"c6aee8d3debc7268ce1221e20ebeb368cf61dad7bf837ced60812f04f6d821e8","source":{"kind":"arxiv","id":"1509.08276","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08276","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08276v2","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08276","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"Y2XORU66XRZG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y2XORU66XRZGRTQS","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y2XORU66","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:Y2XORU66XRZGRTQSEHRA5PVTND","target":"record","payload":{"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"},"canonical_sha256":"c6aee8d3debc7268ce1221e20ebeb368cf61dad7bf837ced60812f04f6d821e8","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"},"source_kind":"arxiv","source_id":"1509.08276","source_version":2,"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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kj5YZMUD6NNsBwDpIUMrnEiWDVT967U3GaSN2Fs/HitT9aMRVwRtyJeg2dPd73k++oClDAKG4jr5tfutABmZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:34:10.525724Z"},"content_sha256":"b0dc243c1d2dfba4b20c78d8adc49ed5eff0b919d955ee029112b40900cb6e1e","schema_version":"1.0","event_id":"sha256:b0dc243c1d2dfba4b20c78d8adc49ed5eff0b919d955ee029112b40900cb6e1e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:Y2XORU66XRZGRTQSEHRA5PVTND","target":"graph","payload":{"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"},"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:03:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NKBT5GU/gY1Uz5p9RN82I5WXT21cGCRXKOOSg9Agl0gfm6hhn8zER16miV5hJaIlQRiQ8BeCpyp3KJLTIi++DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:34:10.526438Z"},"content_sha256":"441198b10badabf66573c1f5ff9be458d61179c71bcb599dc3bb78b2c7759003","schema_version":"1.0","event_id":"sha256:441198b10badabf66573c1f5ff9be458d61179c71bcb599dc3bb78b2c7759003"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/bundle.json","state_url":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Y2XORU66XRZGRTQSEHRA5PVTND/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-05-25T16:34:10Z","links":{"resolver":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND","bundle":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/bundle.json","state":"https://pith.science/pith/Y2XORU66XRZGRTQSEHRA5PVTND/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Y2XORU66XRZGRTQSEHRA5PVTND/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:Y2XORU66XRZGRTQSEHRA5PVTND","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":"d569e7a49c3686a4b03887c33da74c643bf80651bdbd975531d1749ffc2e41b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-28T11:22:54Z","title_canon_sha256":"628603d325c426fead9f8fad9a92445e60478659d0fddd1b3acae77954301ddd"},"schema_version":"1.0","source":{"id":"1509.08276","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.08276","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"arxiv_version","alias_value":"1509.08276v2","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.08276","created_at":"2026-05-18T01:03:44Z"},{"alias_kind":"pith_short_12","alias_value":"Y2XORU66XRZG","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"Y2XORU66XRZGRTQS","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"Y2XORU66","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:441198b10badabf66573c1f5ff9be458d61179c71bcb599dc3bb78b2c7759003","target":"graph","created_at":"2026-05-18T01:03:44Z","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":"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 $\\","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","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-28T11:22:54Z","title":"Finding a non-minority ball with majority answers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.08276","kind":"arxiv","version":2},"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:b0dc243c1d2dfba4b20c78d8adc49ed5eff0b919d955ee029112b40900cb6e1e","target":"record","created_at":"2026-05-18T01:03:44Z","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":"d569e7a49c3686a4b03887c33da74c643bf80651bdbd975531d1749ffc2e41b6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-09-28T11:22:54Z","title_canon_sha256":"628603d325c426fead9f8fad9a92445e60478659d0fddd1b3acae77954301ddd"},"schema_version":"1.0","source":{"id":"1509.08276","kind":"arxiv","version":2}},"canonical_sha256":"c6aee8d3debc7268ce1221e20ebeb368cf61dad7bf837ced60812f04f6d821e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6aee8d3debc7268ce1221e20ebeb368cf61dad7bf837ced60812f04f6d821e8","first_computed_at":"2026-05-18T01:03:44.337728Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:03:44.337728Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cwh0ZNl+szi4PcoPrfDaFVY/vTNDbyCtD0O8AXPXikqlnMja6B+uFg61UpDnxkIA3945hvE+SHDw3uQwxKuJCw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:03:44.338159Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.08276","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0dc243c1d2dfba4b20c78d8adc49ed5eff0b919d955ee029112b40900cb6e1e","sha256:441198b10badabf66573c1f5ff9be458d61179c71bcb599dc3bb78b2c7759003"],"state_sha256":"dc0753a8269dd3698ac29692fd4a9f4d08131a61769d2baff92ac0df574bb237"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qBr59BGSGp/D/UKsu7WVLblPJx9F9iigCIMx5MZ637tGN1SENZkkiiXzZ3GDeFRDd9qll7He6gK4p7C9wjlLAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:34:10.530277Z","bundle_sha256":"80ea4fe4c9c6e4b18788a2bf1c109317168e3b43c6e2b9d88fac2597273538fa"}}