{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X4P4GBWWOOZRSC65OT36LHRUW7","short_pith_number":"pith:X4P4GBWW","schema_version":"1.0","canonical_sha256":"bf1fc306d673b3190bdd74f7e59e34b7fb6410fa912917ed71ada55bffc8b438","source":{"kind":"arxiv","id":"2411.03037","version":1},"attestation_state":"computed","paper":{"title":"Top-k Stabbing Interval Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Sanjeev Saxena, Waseem Akram","submitted_at":"2024-11-05T12:16:52Z","abstract_excerpt":"We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set $\\mathcal{I}$ of weighted intervals such that, for a query point $q$ and an integer $k>0$, we can report the $k$ intervals with largest weights among those stabbed by $q$. In this paper, we present a linear space solution with $O(\\log n + k)$ query time. Moreover, we also present another trade-off for the problem."},"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":"2411.03037","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T12:16:52Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"790877b137d211f3107f81d8fcc9af7d5947e3691f96365091226068af681ef0","abstract_canon_sha256":"cc9fae549854d7c7344698287fa108be986563ea3ecd70afc447e15051df737b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:31:23.977991Z","signature_b64":"k85p2wuXjc4y/6mZeWg5Wx218o+GbwZ2Oix9kkpknAMCoUf9+MaeOL6irzECl5bhCXDREiL87vCVZtZDtoD+Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf1fc306d673b3190bdd74f7e59e34b7fb6410fa912917ed71ada55bffc8b438","last_reissued_at":"2026-07-05T09:31:23.977563Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:31:23.977563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Top-k Stabbing Interval Queries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Sanjeev Saxena, Waseem Akram","submitted_at":"2024-11-05T12:16:52Z","abstract_excerpt":"We investigate a weighted variant of the interval stabbing problem, where the goal is to design an efficient data structure for a given set $\\mathcal{I}$ of weighted intervals such that, for a query point $q$ and an integer $k>0$, we can report the $k$ intervals with largest weights among those stabbed by $q$. In this paper, we present a linear space solution with $O(\\log n + k)$ query time. Moreover, we also present another trade-off for the problem."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03037","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.03037/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2411.03037","created_at":"2026-07-05T09:31:23.977634+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.03037v1","created_at":"2026-07-05T09:31:23.977634+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03037","created_at":"2026-07-05T09:31:23.977634+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4P4GBWWOOZR","created_at":"2026-07-05T09:31:23.977634+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4P4GBWWOOZRSC65","created_at":"2026-07-05T09:31:23.977634+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4P4GBWW","created_at":"2026-07-05T09:31:23.977634+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/X4P4GBWWOOZRSC65OT36LHRUW7","json":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7.json","graph_json":"https://pith.science/api/pith-number/X4P4GBWWOOZRSC65OT36LHRUW7/graph.json","events_json":"https://pith.science/api/pith-number/X4P4GBWWOOZRSC65OT36LHRUW7/events.json","paper":"https://pith.science/paper/X4P4GBWW"},"agent_actions":{"view_html":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7","download_json":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7.json","view_paper":"https://pith.science/paper/X4P4GBWW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.03037&json=true","fetch_graph":"https://pith.science/api/pith-number/X4P4GBWWOOZRSC65OT36LHRUW7/graph.json","fetch_events":"https://pith.science/api/pith-number/X4P4GBWWOOZRSC65OT36LHRUW7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/action/storage_attestation","attest_author":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/action/author_attestation","sign_citation":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/action/citation_signature","submit_replication":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/action/replication_record"}},"created_at":"2026-07-05T09:31:23.977634+00:00","updated_at":"2026-07-05T09:31:23.977634+00:00"}