{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:M7IMIGSQLX2O5DNYG46FISMERX","short_pith_number":"pith:M7IMIGSQ","schema_version":"1.0","canonical_sha256":"67d0c41a505df4ee8db8373c5449848dc7173d75b594429ca4085a43d61b8837","source":{"kind":"arxiv","id":"1206.5336","version":3},"attestation_state":"computed","paper":{"title":"Near-Optimal Online Multiselection in Internal and External Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankur Gupta, J\\'er\\'emy Barbay, Jonathan Sorenson, S. Srinivasa Rao","submitted_at":"2012-06-22T22:53:21Z","abstract_excerpt":"We introduce an online version of the multiselection problem, in which q selection queries are requested on an unsorted array of n elements. We provide the first online algorithm that is 1-competitive with Kaligosi et al. [ICALP 2005] in terms of comparison complexity. Our algorithm also supports online search queries efficiently.\n  We then extend our algorithm to the dynamic setting, while retaining online functionality, by supporting arbitrary insertions and deletions on the array. Assuming that the insertion of an element is immediately preceded by a search for that element, we show that ou"},"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":"1206.5336","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-06-22T22:53:21Z","cross_cats_sorted":[],"title_canon_sha256":"89ce59d96fef8c74999f9304a92d1e5b290d7868526ffb55c8ce379756011e05","abstract_canon_sha256":"144cb4b4fc098434b46f4f4ff36be449288d4f11edc3941fe749538e7255c1d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:41.707166Z","signature_b64":"HUrQUDNu1lyFU8IdHUHCMLp4q2QXXJsC1FGnDnpvgiFTs9rVq6L+EazvGPgsat/qPHKBA8TezVKVXmdrR+heCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"67d0c41a505df4ee8db8373c5449848dc7173d75b594429ca4085a43d61b8837","last_reissued_at":"2026-05-18T00:00:41.706706Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:41.706706Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Online Multiselection in Internal and External Memory","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankur Gupta, J\\'er\\'emy Barbay, Jonathan Sorenson, S. Srinivasa Rao","submitted_at":"2012-06-22T22:53:21Z","abstract_excerpt":"We introduce an online version of the multiselection problem, in which q selection queries are requested on an unsorted array of n elements. We provide the first online algorithm that is 1-competitive with Kaligosi et al. [ICALP 2005] in terms of comparison complexity. Our algorithm also supports online search queries efficiently.\n  We then extend our algorithm to the dynamic setting, while retaining online functionality, by supporting arbitrary insertions and deletions on the array. Assuming that the insertion of an element is immediately preceded by a search for that element, we show that ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1206.5336","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1206.5336","created_at":"2026-05-18T00:00:41.706773+00:00"},{"alias_kind":"arxiv_version","alias_value":"1206.5336v3","created_at":"2026-05-18T00:00:41.706773+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1206.5336","created_at":"2026-05-18T00:00:41.706773+00:00"},{"alias_kind":"pith_short_12","alias_value":"M7IMIGSQLX2O","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_16","alias_value":"M7IMIGSQLX2O5DNY","created_at":"2026-05-18T12:27:14.488303+00:00"},{"alias_kind":"pith_short_8","alias_value":"M7IMIGSQ","created_at":"2026-05-18T12:27:14.488303+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/M7IMIGSQLX2O5DNYG46FISMERX","json":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX.json","graph_json":"https://pith.science/api/pith-number/M7IMIGSQLX2O5DNYG46FISMERX/graph.json","events_json":"https://pith.science/api/pith-number/M7IMIGSQLX2O5DNYG46FISMERX/events.json","paper":"https://pith.science/paper/M7IMIGSQ"},"agent_actions":{"view_html":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX","download_json":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX.json","view_paper":"https://pith.science/paper/M7IMIGSQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1206.5336&json=true","fetch_graph":"https://pith.science/api/pith-number/M7IMIGSQLX2O5DNYG46FISMERX/graph.json","fetch_events":"https://pith.science/api/pith-number/M7IMIGSQLX2O5DNYG46FISMERX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX/action/storage_attestation","attest_author":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX/action/author_attestation","sign_citation":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX/action/citation_signature","submit_replication":"https://pith.science/pith/M7IMIGSQLX2O5DNYG46FISMERX/action/replication_record"}},"created_at":"2026-05-18T00:00:41.706773+00:00","updated_at":"2026-05-18T00:00:41.706773+00:00"}