{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:N23YAYGFL6KWO53EISDN6B3JQX","short_pith_number":"pith:N23YAYGF","canonical_record":{"source":{"id":"1603.01583","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-04T19:29:56Z","cross_cats_sorted":[],"title_canon_sha256":"fc9340ebe2d05f107353c22a3c6b6a5902aa9a7be2a706b3cb10af8d21350353","abstract_canon_sha256":"fd4d02f9ee9a9966e978ac36eff14cd9cd04348bbf6629a9672920fd73b5fd6c"},"schema_version":"1.0"},"canonical_sha256":"6eb78060c55f956777644486df076985f7d3a5303e39b3cc44c4ba2f0123259b","source":{"kind":"arxiv","id":"1603.01583","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01583","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01583v3","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01583","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"N23YAYGFL6KW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N23YAYGFL6KWO53E","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N23YAYGF","created_at":"2026-05-18T12:30:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:N23YAYGFL6KWO53EISDN6B3JQX","target":"record","payload":{"canonical_record":{"source":{"id":"1603.01583","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-04T19:29:56Z","cross_cats_sorted":[],"title_canon_sha256":"fc9340ebe2d05f107353c22a3c6b6a5902aa9a7be2a706b3cb10af8d21350353","abstract_canon_sha256":"fd4d02f9ee9a9966e978ac36eff14cd9cd04348bbf6629a9672920fd73b5fd6c"},"schema_version":"1.0"},"canonical_sha256":"6eb78060c55f956777644486df076985f7d3a5303e39b3cc44c4ba2f0123259b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:03.417613Z","signature_b64":"8+AGhO2ibhFk9dfD2MvztomAjepROyeSUCRQm0AT6a8HH4pae8Y3Fv9x+bkczFzAMGIGc4eeyTSDgtFEPi/iCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6eb78060c55f956777644486df076985f7d3a5303e39b3cc44c4ba2f0123259b","last_reissued_at":"2026-05-18T01:16:03.416930Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:03.416930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1603.01583","source_version":3,"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:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lErZqrgjOBtuvKB1/U0ZziZbb9Uoo6n2vAqY3/Pm10k6cMI/l+RHlfo6IBEwSgFsOtOzhrnoNNgALrP3qOH+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:05:11.673771Z"},"content_sha256":"9c48f0c4f05969ffd5b68dbc44132d9216cc6a0241284617d0cb50de244b0512","schema_version":"1.0","event_id":"sha256:9c48f0c4f05969ffd5b68dbc44132d9216cc6a0241284617d0cb50de244b0512"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:N23YAYGFL6KWO53EISDN6B3JQX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Randomized algorithms for finding a majority element","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jukka Suomela, Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","submitted_at":"2016-03-04T19:29:56Z","abstract_excerpt":"Given $n$ colored balls, we want to detect if more than $\\lfloor n/2\\rfloor$ of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to minimize the total number of such operations. A well-known exercise is to show how to find such a ball with only $2n$ comparisons while using only a logarithmic number of bits for bookkeeping. The resulting algorithm is called the Boyer--Moore majority vote algorithm. It is known that any deterministic method needs $\\lceil 3n/2\\rceil-2$ comparisons in the w"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01583","kind":"arxiv","version":3},"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:16:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fi8ys0p+qjHWCsp17jpM04GRuxjyZD1+ypmdx4Hhk8DVikPc1OT91Xj4AASs4sFIX9CT14KqLzTvDjPq6EnxCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T08:05:11.674541Z"},"content_sha256":"107ad61d925eb7c59f294f6dc56217bb3045a809bba9457a547fa06b42f1e14e","schema_version":"1.0","event_id":"sha256:107ad61d925eb7c59f294f6dc56217bb3045a809bba9457a547fa06b42f1e14e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N23YAYGFL6KWO53EISDN6B3JQX/bundle.json","state_url":"https://pith.science/pith/N23YAYGFL6KWO53EISDN6B3JQX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N23YAYGFL6KWO53EISDN6B3JQX/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-09T08:05:11Z","links":{"resolver":"https://pith.science/pith/N23YAYGFL6KWO53EISDN6B3JQX","bundle":"https://pith.science/pith/N23YAYGFL6KWO53EISDN6B3JQX/bundle.json","state":"https://pith.science/pith/N23YAYGFL6KWO53EISDN6B3JQX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N23YAYGFL6KWO53EISDN6B3JQX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:N23YAYGFL6KWO53EISDN6B3JQX","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":"fd4d02f9ee9a9966e978ac36eff14cd9cd04348bbf6629a9672920fd73b5fd6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-04T19:29:56Z","title_canon_sha256":"fc9340ebe2d05f107353c22a3c6b6a5902aa9a7be2a706b3cb10af8d21350353"},"schema_version":"1.0","source":{"id":"1603.01583","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1603.01583","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"arxiv_version","alias_value":"1603.01583v3","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1603.01583","created_at":"2026-05-18T01:16:03Z"},{"alias_kind":"pith_short_12","alias_value":"N23YAYGFL6KW","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_16","alias_value":"N23YAYGFL6KWO53E","created_at":"2026-05-18T12:30:32Z"},{"alias_kind":"pith_short_8","alias_value":"N23YAYGF","created_at":"2026-05-18T12:30:32Z"}],"graph_snapshots":[{"event_id":"sha256:107ad61d925eb7c59f294f6dc56217bb3045a809bba9457a547fa06b42f1e14e","target":"graph","created_at":"2026-05-18T01:16:03Z","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":"Given $n$ colored balls, we want to detect if more than $\\lfloor n/2\\rfloor$ of them have the same color, and if so find one ball with such majority color. We are only allowed to choose two balls and compare their colors, and the goal is to minimize the total number of such operations. A well-known exercise is to show how to find such a ball with only $2n$ comparisons while using only a logarithmic number of bits for bookkeeping. The resulting algorithm is called the Boyer--Moore majority vote algorithm. It is known that any deterministic method needs $\\lceil 3n/2\\rceil-2$ comparisons in the w","authors_text":"Jukka Suomela, Pawe{\\l} Gawrychowski, Przemys{\\l}aw Uzna\\'nski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-04T19:29:56Z","title":"Randomized algorithms for finding a majority element"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1603.01583","kind":"arxiv","version":3},"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:9c48f0c4f05969ffd5b68dbc44132d9216cc6a0241284617d0cb50de244b0512","target":"record","created_at":"2026-05-18T01:16:03Z","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":"fd4d02f9ee9a9966e978ac36eff14cd9cd04348bbf6629a9672920fd73b5fd6c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-03-04T19:29:56Z","title_canon_sha256":"fc9340ebe2d05f107353c22a3c6b6a5902aa9a7be2a706b3cb10af8d21350353"},"schema_version":"1.0","source":{"id":"1603.01583","kind":"arxiv","version":3}},"canonical_sha256":"6eb78060c55f956777644486df076985f7d3a5303e39b3cc44c4ba2f0123259b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6eb78060c55f956777644486df076985f7d3a5303e39b3cc44c4ba2f0123259b","first_computed_at":"2026-05-18T01:16:03.416930Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:16:03.416930Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8+AGhO2ibhFk9dfD2MvztomAjepROyeSUCRQm0AT6a8HH4pae8Y3Fv9x+bkczFzAMGIGc4eeyTSDgtFEPi/iCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:16:03.417613Z","signed_message":"canonical_sha256_bytes"},"source_id":"1603.01583","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9c48f0c4f05969ffd5b68dbc44132d9216cc6a0241284617d0cb50de244b0512","sha256:107ad61d925eb7c59f294f6dc56217bb3045a809bba9457a547fa06b42f1e14e"],"state_sha256":"5f2aa0bb5a051edb55117d94bfb468e409d2e94973ddd7c3a1bb98ff2e0c54c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nb52O+u8LW/MtJFeqIo+Tp6MK6EuJlc7d3jk/d9xPubWIP6zQRYBWifeoQApruevxXIiYRCmqGsuPj3O8JsOBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T08:05:11.678441Z","bundle_sha256":"0f00ce16b91413bfc87d626340008d5f74efd64858886d3c14e6042abfe5634f"}}