{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:RHM7CAB4NJTLAPGA743CK6OECT","short_pith_number":"pith:RHM7CAB4","schema_version":"1.0","canonical_sha256":"89d9f1003c6a66b03cc0ff362579c414c465b1d7c3bab1fcce3c4882ec714332","source":{"kind":"arxiv","id":"1007.1361","version":2},"attestation_state":"computed","paper":{"title":"Top-K Color Queries for Document Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Marek Karpinski, Yakov Nekrich","submitted_at":"2010-07-08T12:51:03Z","abstract_excerpt":"In this paper we describe a new efficient (in fact optimal) data structure for the {\\em top-$K$ color problem}. Each element of an array $A$ is assigned a color $c$ with priority $p(c)$. For a query range $[a,b]$ and a value $K$, we have to report $K$ colors with the highest priorities among all colors that occur in $A[a..b]$, sorted in reverse order by their priorities. We show that such queries can be answered in $O(K)$ time using an $O(N\\log \\sigma)$ bits data structure, where $N$ is the number of elements in the array and $\\sigma$ is the number of colors. Thus our data structure is asympto"},"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":"1007.1361","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-07-08T12:51:03Z","cross_cats_sorted":["cs.IR"],"title_canon_sha256":"44f88b7d5929b9b92af9f9182822691764572286024f69b8185cf64faccc0ee7","abstract_canon_sha256":"27ce8affb4ab7e699fd7b4c7a841ab8fa34bda3a09e97d00404d7377ae515aa9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:39:09.926224Z","signature_b64":"53mUhYVQBUNml1K8Po9yv/ja6dEn2EM2gFLPkAxGEL8Ye9Zux/Lxcah7P01xY1KfAxzyQj2P9EmxBu/45CxiCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"89d9f1003c6a66b03cc0ff362579c414c465b1d7c3bab1fcce3c4882ec714332","last_reissued_at":"2026-05-18T04:39:09.925781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:39:09.925781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-K Color Queries for Document Retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR"],"primary_cat":"cs.DS","authors_text":"Marek Karpinski, Yakov Nekrich","submitted_at":"2010-07-08T12:51:03Z","abstract_excerpt":"In this paper we describe a new efficient (in fact optimal) data structure for the {\\em top-$K$ color problem}. Each element of an array $A$ is assigned a color $c$ with priority $p(c)$. For a query range $[a,b]$ and a value $K$, we have to report $K$ colors with the highest priorities among all colors that occur in $A[a..b]$, sorted in reverse order by their priorities. We show that such queries can be answered in $O(K)$ time using an $O(N\\log \\sigma)$ bits data structure, where $N$ is the number of elements in the array and $\\sigma$ is the number of colors. Thus our data structure is asympto"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.1361","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1007.1361","created_at":"2026-05-18T04:39:09.925843+00:00"},{"alias_kind":"arxiv_version","alias_value":"1007.1361v2","created_at":"2026-05-18T04:39:09.925843+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.1361","created_at":"2026-05-18T04:39:09.925843+00:00"},{"alias_kind":"pith_short_12","alias_value":"RHM7CAB4NJTL","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_16","alias_value":"RHM7CAB4NJTLAPGA","created_at":"2026-05-18T12:26:13.927090+00:00"},{"alias_kind":"pith_short_8","alias_value":"RHM7CAB4","created_at":"2026-05-18T12:26:13.927090+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/RHM7CAB4NJTLAPGA743CK6OECT","json":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT.json","graph_json":"https://pith.science/api/pith-number/RHM7CAB4NJTLAPGA743CK6OECT/graph.json","events_json":"https://pith.science/api/pith-number/RHM7CAB4NJTLAPGA743CK6OECT/events.json","paper":"https://pith.science/paper/RHM7CAB4"},"agent_actions":{"view_html":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT","download_json":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT.json","view_paper":"https://pith.science/paper/RHM7CAB4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1007.1361&json=true","fetch_graph":"https://pith.science/api/pith-number/RHM7CAB4NJTLAPGA743CK6OECT/graph.json","fetch_events":"https://pith.science/api/pith-number/RHM7CAB4NJTLAPGA743CK6OECT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT/action/storage_attestation","attest_author":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT/action/author_attestation","sign_citation":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT/action/citation_signature","submit_replication":"https://pith.science/pith/RHM7CAB4NJTLAPGA743CK6OECT/action/replication_record"}},"created_at":"2026-05-18T04:39:09.925843+00:00","updated_at":"2026-05-18T04:39:09.925843+00:00"}