{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:QOTRPI3K7YRFDDQVKEBUMENWRA","short_pith_number":"pith:QOTRPI3K","schema_version":"1.0","canonical_sha256":"83a717a36afe22518e1551034611b68832046642b9792a449eeaff5e114da7e9","source":{"kind":"arxiv","id":"1905.02322","version":1},"attestation_state":"computed","paper":{"title":"Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michiel Smid, Timothy M. Chan, Yakov Nekrich","submitted_at":"2019-05-07T02:08:05Z","abstract_excerpt":"In this paper we study two geometric data structure problems in the special case when input objects or queries are fat rectangles. We show that in this case a significant improvement compared to the general case can be achieved.\n  We describe data structures that answer two- and three-dimensional orthogonal range reporting queries in the case when the query range is a \\emph{fat} rectangle. Our two-dimensional data structure uses $O(n)$ words and supports queries in $O(\\log\\log U +k)$ time, where $n$ is the number of points in the data structure, $U$ is the size of the universe and $k$ is the n"},"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":"1905.02322","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-07T02:08:05Z","cross_cats_sorted":[],"title_canon_sha256":"3fa64bd945e094560907b01bc87dfef97bf57928a07d53b56276850bb7f74614","abstract_canon_sha256":"8c12bf6c0043a1cd5a7a5d28516f6b2dc3fb2d9a1894f7085a27bc2af4cf2bdb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:51.760307Z","signature_b64":"//qAVQRyBjMnNdxeimXvLmKsGd926eFES7tqT9Qrl369JgRyDjNRZtZUouaE3u3W7BFeUqtReEfQ49PpjZ82DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83a717a36afe22518e1551034611b68832046642b9792a449eeaff5e114da7e9","last_reissued_at":"2026-05-17T23:46:51.759642Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:51.759642Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Michiel Smid, Timothy M. Chan, Yakov Nekrich","submitted_at":"2019-05-07T02:08:05Z","abstract_excerpt":"In this paper we study two geometric data structure problems in the special case when input objects or queries are fat rectangles. We show that in this case a significant improvement compared to the general case can be achieved.\n  We describe data structures that answer two- and three-dimensional orthogonal range reporting queries in the case when the query range is a \\emph{fat} rectangle. Our two-dimensional data structure uses $O(n)$ words and supports queries in $O(\\log\\log U +k)$ time, where $n$ is the number of points in the data structure, $U$ is the size of the universe and $k$ is the n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.02322","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":"1905.02322","created_at":"2026-05-17T23:46:51.759747+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.02322v1","created_at":"2026-05-17T23:46:51.759747+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.02322","created_at":"2026-05-17T23:46:51.759747+00:00"},{"alias_kind":"pith_short_12","alias_value":"QOTRPI3K7YRF","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_16","alias_value":"QOTRPI3K7YRFDDQV","created_at":"2026-05-18T12:33:27.125529+00:00"},{"alias_kind":"pith_short_8","alias_value":"QOTRPI3K","created_at":"2026-05-18T12:33:27.125529+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/QOTRPI3K7YRFDDQVKEBUMENWRA","json":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA.json","graph_json":"https://pith.science/api/pith-number/QOTRPI3K7YRFDDQVKEBUMENWRA/graph.json","events_json":"https://pith.science/api/pith-number/QOTRPI3K7YRFDDQVKEBUMENWRA/events.json","paper":"https://pith.science/paper/QOTRPI3K"},"agent_actions":{"view_html":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA","download_json":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA.json","view_paper":"https://pith.science/paper/QOTRPI3K","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.02322&json=true","fetch_graph":"https://pith.science/api/pith-number/QOTRPI3K7YRFDDQVKEBUMENWRA/graph.json","fetch_events":"https://pith.science/api/pith-number/QOTRPI3K7YRFDDQVKEBUMENWRA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA/action/storage_attestation","attest_author":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA/action/author_attestation","sign_citation":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA/action/citation_signature","submit_replication":"https://pith.science/pith/QOTRPI3K7YRFDDQVKEBUMENWRA/action/replication_record"}},"created_at":"2026-05-17T23:46:51.759747+00:00","updated_at":"2026-05-17T23:46:51.759747+00:00"}