{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:ACMIDKJRFHXS2WQX4KVLTNAEMF","short_pith_number":"pith:ACMIDKJR","schema_version":"1.0","canonical_sha256":"009881a93129ef2d5a17e2aab9b404614165015a4ba6b2c03b2974717e3eb557","source":{"kind":"arxiv","id":"1111.3288","version":1},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1111.3288","created_at":"2026-05-18T04:08:22.620804+00:00"},{"alias_kind":"arxiv_version","alias_value":"1111.3288v1","created_at":"2026-05-18T04:08:22.620804+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3288","created_at":"2026-05-18T04:08:22.620804+00:00"},{"alias_kind":"pith_short_12","alias_value":"ACMIDKJRFHXS","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_16","alias_value":"ACMIDKJRFHXS2WQX","created_at":"2026-05-18T12:26:24.575870+00:00"},{"alias_kind":"pith_short_8","alias_value":"ACMIDKJR","created_at":"2026-05-18T12:26:24.575870+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/ACMIDKJRFHXS2WQX4KVLTNAEMF","json":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF.json","graph_json":"https://pith.science/api/pith-number/ACMIDKJRFHXS2WQX4KVLTNAEMF/graph.json","events_json":"https://pith.science/api/pith-number/ACMIDKJRFHXS2WQX4KVLTNAEMF/events.json","paper":"https://pith.science/paper/ACMIDKJR"},"agent_actions":{"view_html":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF","download_json":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF.json","view_paper":"https://pith.science/paper/ACMIDKJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1111.3288&json=true","fetch_graph":"https://pith.science/api/pith-number/ACMIDKJRFHXS2WQX4KVLTNAEMF/graph.json","fetch_events":"https://pith.science/api/pith-number/ACMIDKJRFHXS2WQX4KVLTNAEMF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/action/storage_attestation","attest_author":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/action/author_attestation","sign_citation":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/action/citation_signature","submit_replication":"https://pith.science/pith/ACMIDKJRFHXS2WQX4KVLTNAEMF/action/replication_record"}},"created_at":"2026-05-18T04:08:22.620804+00:00","updated_at":"2026-05-18T04:08:22.620804+00:00"}