{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:ACMIDKJRFHXS2WQX4KVLTNAEMF","short_pith_number":"pith:ACMIDKJR","canonical_record":{"source":{"id":"1111.3288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-14T17:17:42Z","cross_cats_sorted":[],"title_canon_sha256":"6660e8f5588fa57c687198417b25d306a7e7b8487c24ecbd80095a0194711e70","abstract_canon_sha256":"a039285379ed82f6d4477b43b80ad01c67fa28dccb673ab6a395ef1b490ee0e6"},"schema_version":"1.0"},"canonical_sha256":"009881a93129ef2d5a17e2aab9b404614165015a4ba6b2c03b2974717e3eb557","source":{"kind":"arxiv","id":"1111.3288","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3288","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3288v1","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3288","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"ACMIDKJRFHXS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ACMIDKJRFHXS2WQX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ACMIDKJR","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:ACMIDKJRFHXS2WQX4KVLTNAEMF","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3288","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-14T17:17:42Z","cross_cats_sorted":[],"title_canon_sha256":"6660e8f5588fa57c687198417b25d306a7e7b8487c24ecbd80095a0194711e70","abstract_canon_sha256":"a039285379ed82f6d4477b43b80ad01c67fa28dccb673ab6a395ef1b490ee0e6"},"schema_version":"1.0"},"canonical_sha256":"009881a93129ef2d5a17e2aab9b404614165015a4ba6b2c03b2974717e3eb557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:08:22.621192Z","signature_b64":"K6/TwMlfnbsnivvhtBSiZEuNpkovReOwLCRBGEaYL5AGsHiIqBS0v2msZnkFO9elv5R4psFqkBzmpx1tW+7UBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"009881a93129ef2d5a17e2aab9b404614165015a4ba6b2c03b2974717e3eb557","last_reissued_at":"2026-05-18T04:08:22.620739Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:08:22.620739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3288","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-18T04:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8vMC6wyqslnMcKGujEpyk64fxFFC8rtaCvfiGN4xKm/IxWnbgKbO5moA7QvpiNpLP1PD2NvVhTMRyT5vK/HKCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:28:04.993294Z"},"content_sha256":"66642173a67e2be2cb08eee15b4e281e188f02c460e5d3f96ce2794047dcde4b","schema_version":"1.0","event_id":"sha256:66642173a67e2be2cb08eee15b4e281e188f02c460e5d3f96ce2794047dcde4b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:ACMIDKJRFHXS2WQX4KVLTNAEMF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower bounds for finding the maximum and minimum elements with k lies","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","submitted_at":"2011-11-14T17:17:42Z","abstract_excerpt":"In this paper we deal with the problem of finding the smallest and the largest elements of a totally ordered set of size $n$ using pairwise comparisons if $k$ of the comparisons might be erroneous where $k$ is a fixed constant. We prove that at least $(k+1.5)n+\\Theta(k)$ comparisons are needed in the worst case thus disproving the conjecture that $(k+1+\\epsilon)n$ comparisons are enough."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3288","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-18T04:08:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7sGfP+2GeLnv3pCDHt9P7pK0encDqu9nFogp/pCV0FqaLzvHjtL0TyJ0bdQStFu++SUbXs3OFKn5/gza9EOcDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T22:28:04.994127Z"},"content_sha256":"a4365400288490a3bcf316ac02830e4efaa5fa9585292a1a92e5fe39ed70713e","schema_version":"1.0","event_id":"sha256:a4365400288490a3bcf316ac02830e4efaa5fa9585292a1a92e5fe39ed70713e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/bundle.json","state_url":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/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-31T22:28:04Z","links":{"resolver":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF","bundle":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/bundle.json","state":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:ACMIDKJRFHXS2WQX4KVLTNAEMF","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":"a039285379ed82f6d4477b43b80ad01c67fa28dccb673ab6a395ef1b490ee0e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-14T17:17:42Z","title_canon_sha256":"6660e8f5588fa57c687198417b25d306a7e7b8487c24ecbd80095a0194711e70"},"schema_version":"1.0","source":{"id":"1111.3288","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3288","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3288v1","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3288","created_at":"2026-05-18T04:08:22Z"},{"alias_kind":"pith_short_12","alias_value":"ACMIDKJRFHXS","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"ACMIDKJRFHXS2WQX","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"ACMIDKJR","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:a4365400288490a3bcf316ac02830e4efaa5fa9585292a1a92e5fe39ed70713e","target":"graph","created_at":"2026-05-18T04:08:22Z","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 deal with the problem of finding the smallest and the largest elements of a totally ordered set of size $n$ using pairwise comparisons if $k$ of the comparisons might be erroneous where $k$ is a fixed constant. We prove that at least $(k+1.5)n+\\Theta(k)$ comparisons are needed in the worst case thus disproving the conjecture that $(k+1+\\epsilon)n$ comparisons are enough.","authors_text":"D\\\"om\\\"ot\\\"or P\\'alv\\\"olgyi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-14T17:17:42Z","title":"Lower bounds for finding the maximum and minimum elements with k lies"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3288","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:66642173a67e2be2cb08eee15b4e281e188f02c460e5d3f96ce2794047dcde4b","target":"record","created_at":"2026-05-18T04:08:22Z","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":"a039285379ed82f6d4477b43b80ad01c67fa28dccb673ab6a395ef1b490ee0e6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2011-11-14T17:17:42Z","title_canon_sha256":"6660e8f5588fa57c687198417b25d306a7e7b8487c24ecbd80095a0194711e70"},"schema_version":"1.0","source":{"id":"1111.3288","kind":"arxiv","version":1}},"canonical_sha256":"009881a93129ef2d5a17e2aab9b404614165015a4ba6b2c03b2974717e3eb557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"009881a93129ef2d5a17e2aab9b404614165015a4ba6b2c03b2974717e3eb557","first_computed_at":"2026-05-18T04:08:22.620739Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:08:22.620739Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K6/TwMlfnbsnivvhtBSiZEuNpkovReOwLCRBGEaYL5AGsHiIqBS0v2msZnkFO9elv5R4psFqkBzmpx1tW+7UBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:08:22.621192Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3288","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:66642173a67e2be2cb08eee15b4e281e188f02c460e5d3f96ce2794047dcde4b","sha256:a4365400288490a3bcf316ac02830e4efaa5fa9585292a1a92e5fe39ed70713e"],"state_sha256":"805fa77bad3581d4daff71cb4e8365ede3fc5e4fe09ff0aa51aa97f7426e5523"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hhn347B+QW3AHsiWfPUBmeite+Yo25z88AJaoC2DWXtE9XgbnX0X3nSSCiDHNtt7t23olFTMqcvrzp0gwBtSCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T22:28:04.998875Z","bundle_sha256":"7b66d9261b2bef8c2560f6cca86151b1de22bb6826b80bcb96596ce7fde680ab"}}