{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:X4P4GBWWOOZRSC65OT36LHRUW7","short_pith_number":"pith:X4P4GBWW","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"},"canonical_sha256":"bf1fc306d673b3190bdd74f7e59e34b7fb6410fa912917ed71ada55bffc8b438","source":{"kind":"arxiv","id":"2411.03037","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03037","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03037v1","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03037","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"X4P4GBWWOOZR","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"pith_short_16","alias_value":"X4P4GBWWOOZRSC65","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"pith_short_8","alias_value":"X4P4GBWW","created_at":"2026-07-05T09:31:23Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:X4P4GBWWOOZRSC65OT36LHRUW7","target":"record","payload":{"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"},"canonical_sha256":"bf1fc306d673b3190bdd74f7e59e34b7fb6410fa912917ed71ada55bffc8b438","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"},"source_kind":"arxiv","source_id":"2411.03037","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dA5nRf1OZFl30772Bo7ZHcIKxTdOXWGaXpf62gPx4FZejAeWyt41oDO81XwxKY80y95Vcd3peJGDUoZo2rADCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:05:59.731816Z"},"content_sha256":"59e40bc8b38a3cad342a943d1efb3377fb4c7c530727971db34a261e0d5e66db","schema_version":"1.0","event_id":"sha256:59e40bc8b38a3cad342a943d1efb3377fb4c7c530727971db34a261e0d5e66db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:X4P4GBWWOOZRSC65OT36LHRUW7","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T09:31:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bZG32+n37fWIZqgbbMz21WuKvexSoPfMcocByQ0RrvEG3HC1ZrOnP0IoS6wYOjYR+kmv+r00QnFZBZLYX1w9Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:05:59.732187Z"},"content_sha256":"7662fa4685ef42dd3dc4d13b0048397409b05ee7c1901f0b7ca34fb483d73146","schema_version":"1.0","event_id":"sha256:7662fa4685ef42dd3dc4d13b0048397409b05ee7c1901f0b7ca34fb483d73146"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/bundle.json","state_url":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/X4P4GBWWOOZRSC65OT36LHRUW7/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-07-07T13:05:59Z","links":{"resolver":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7","bundle":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/bundle.json","state":"https://pith.science/pith/X4P4GBWWOOZRSC65OT36LHRUW7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/X4P4GBWWOOZRSC65OT36LHRUW7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:X4P4GBWWOOZRSC65OT36LHRUW7","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"cc9fae549854d7c7344698287fa108be986563ea3ecd70afc447e15051df737b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T12:16:52Z","title_canon_sha256":"790877b137d211f3107f81d8fcc9af7d5947e3691f96365091226068af681ef0"},"schema_version":"1.0","source":{"id":"2411.03037","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.03037","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"arxiv_version","alias_value":"2411.03037v1","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.03037","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"pith_short_12","alias_value":"X4P4GBWWOOZR","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"pith_short_16","alias_value":"X4P4GBWWOOZRSC65","created_at":"2026-07-05T09:31:23Z"},{"alias_kind":"pith_short_8","alias_value":"X4P4GBWW","created_at":"2026-07-05T09:31:23Z"}],"graph_snapshots":[{"event_id":"sha256:7662fa4685ef42dd3dc4d13b0048397409b05ee7c1901f0b7ca34fb483d73146","target":"graph","created_at":"2026-07-05T09:31:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.03037/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Sanjeev Saxena, Waseem Akram","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T12:16:52Z","title":"Top-k Stabbing Interval Queries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.03037","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:59e40bc8b38a3cad342a943d1efb3377fb4c7c530727971db34a261e0d5e66db","target":"record","created_at":"2026-07-05T09:31:23Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"cc9fae549854d7c7344698287fa108be986563ea3ecd70afc447e15051df737b","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-11-05T12:16:52Z","title_canon_sha256":"790877b137d211f3107f81d8fcc9af7d5947e3691f96365091226068af681ef0"},"schema_version":"1.0","source":{"id":"2411.03037","kind":"arxiv","version":1}},"canonical_sha256":"bf1fc306d673b3190bdd74f7e59e34b7fb6410fa912917ed71ada55bffc8b438","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bf1fc306d673b3190bdd74f7e59e34b7fb6410fa912917ed71ada55bffc8b438","first_computed_at":"2026-07-05T09:31:23.977563Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:31:23.977563Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"k85p2wuXjc4y/6mZeWg5Wx218o+GbwZ2Oix9kkpknAMCoUf9+MaeOL6irzECl5bhCXDREiL87vCVZtZDtoD+Cw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:31:23.977991Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.03037","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:59e40bc8b38a3cad342a943d1efb3377fb4c7c530727971db34a261e0d5e66db","sha256:7662fa4685ef42dd3dc4d13b0048397409b05ee7c1901f0b7ca34fb483d73146"],"state_sha256":"503e385d9274089a0d608272db2be0bd4ecffe9103d0c033896154a46f6b4852"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VW1HnqgommM2MO8y0E1A/CC56SZOmmYhG+1PHJeh9rmnCDTAeDGWzi8172bmITUlN3zX5/Wj4HUmgRmNWO2wDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:05:59.734290Z","bundle_sha256":"fbaebef9c031ec3b7fee41cbb7f857d266353df38b7f85b4144f05b2c0d401ea"}}