{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GV4ZLEO7DJRHCLL2YIHY4SPVMW","short_pith_number":"pith:GV4ZLEO7","schema_version":"1.0","canonical_sha256":"35799591df1a62712d7ac20f8e49f5659530fa6d9bcdecd9730587d94d836e70","source":{"kind":"arxiv","id":"1205.0837","version":1},"attestation_state":"computed","paper":{"title":"Indexing Reverse Top-k Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DB","authors_text":"Alex Thomo, Sean Chester, Sue Whitesides, S. Venkatesh","submitted_at":"2012-05-04T00:03:18Z","abstract_excerpt":"We consider the recently introduced monochromatic reverse top-k queries which ask for, given a new tuple q and a dataset D, all possible top-k queries on D union {q} for which q is in the result. Towards this problem, we focus on designing indexes in two dimensions for repeated (or batch) querying, a novel but practical consideration. We present the insight that by representing the dataset as an arrangement of lines, a critical k-polygon can be identified and used exclusively to respond to reverse top-k queries. We construct an index based on this observation which has guaranteed worst-case qu"},"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":"1205.0837","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DB","submitted_at":"2012-05-04T00:03:18Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"5a16de5256c5616edd8c999d814ede92d3de7d5d02e0d812aa0b6125ddeee1da","abstract_canon_sha256":"89e2fad40ab038a38e0b011474b52ade3ad25b75b5f6397e3790bca139bdc468"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:56:23.814907Z","signature_b64":"oxvNgFN+sfenlK43CXvr/7pbtZoW/Oq7vioS7lVicz/YJnBSOfQNnVnJeMcIHDAMQ3GvR2QgIMn4TTXy/UJMCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35799591df1a62712d7ac20f8e49f5659530fa6d9bcdecd9730587d94d836e70","last_reissued_at":"2026-05-18T03:56:23.814407Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:56:23.814407Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Indexing Reverse Top-k Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DB","authors_text":"Alex Thomo, Sean Chester, Sue Whitesides, S. Venkatesh","submitted_at":"2012-05-04T00:03:18Z","abstract_excerpt":"We consider the recently introduced monochromatic reverse top-k queries which ask for, given a new tuple q and a dataset D, all possible top-k queries on D union {q} for which q is in the result. Towards this problem, we focus on designing indexes in two dimensions for repeated (or batch) querying, a novel but practical consideration. We present the insight that by representing the dataset as an arrangement of lines, a critical k-polygon can be identified and used exclusively to respond to reverse top-k queries. We construct an index based on this observation which has guaranteed worst-case qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1205.0837","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":"1205.0837","created_at":"2026-05-18T03:56:23.814463+00:00"},{"alias_kind":"arxiv_version","alias_value":"1205.0837v1","created_at":"2026-05-18T03:56:23.814463+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1205.0837","created_at":"2026-05-18T03:56:23.814463+00:00"},{"alias_kind":"pith_short_12","alias_value":"GV4ZLEO7DJRH","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GV4ZLEO7DJRHCLL2","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GV4ZLEO7","created_at":"2026-05-18T12:27:06.952714+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/GV4ZLEO7DJRHCLL2YIHY4SPVMW","json":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW.json","graph_json":"https://pith.science/api/pith-number/GV4ZLEO7DJRHCLL2YIHY4SPVMW/graph.json","events_json":"https://pith.science/api/pith-number/GV4ZLEO7DJRHCLL2YIHY4SPVMW/events.json","paper":"https://pith.science/paper/GV4ZLEO7"},"agent_actions":{"view_html":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW","download_json":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW.json","view_paper":"https://pith.science/paper/GV4ZLEO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1205.0837&json=true","fetch_graph":"https://pith.science/api/pith-number/GV4ZLEO7DJRHCLL2YIHY4SPVMW/graph.json","fetch_events":"https://pith.science/api/pith-number/GV4ZLEO7DJRHCLL2YIHY4SPVMW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW/action/storage_attestation","attest_author":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW/action/author_attestation","sign_citation":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW/action/citation_signature","submit_replication":"https://pith.science/pith/GV4ZLEO7DJRHCLL2YIHY4SPVMW/action/replication_record"}},"created_at":"2026-05-18T03:56:23.814463+00:00","updated_at":"2026-05-18T03:56:23.814463+00:00"}