{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4TIMFTNQEUP2YF6WQMCTXWANK2","short_pith_number":"pith:4TIMFTNQ","schema_version":"1.0","canonical_sha256":"e4d0c2cdb0251fac17d683053bd80d56ad134cc31ad931b34baf1cc37c20d289","source":{"kind":"arxiv","id":"1801.07362","version":1},"attestation_state":"computed","paper":{"title":"Finding Pairwise Intersections of Rectangles in a Query Rectangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn","submitted_at":"2018-01-23T00:55:35Z","abstract_excerpt":"We consider the following problem: Preprocess a set $\\mathcal{S}$ of $n$ axis-parallel boxes in $\\mathbb{R}^d$ so that given a query of an axis-parallel box in $\\mathbb{R}^d$, the pairs of boxes of $\\mathcal{S}$ whose intersection intersects the query box can be reported efficiently. For the case that $d=2$, we present a data structure of size $O(n\\log n)$ supporting $O(\\log n+k)$ query time, where $k$ is the size of the output. This improves the previously best known result by de Berg et al. which requires $O(\\log n+ k\\log n)$ query time using $O(n\\log n)$ space. There has been no result know"},"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":"1801.07362","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2018-01-23T00:55:35Z","cross_cats_sorted":[],"title_canon_sha256":"d6e126a04c6a045c4309c07e1e079604e03f3fd1507b628abee27a72c9ab1ca2","abstract_canon_sha256":"56ea6e5f76e83cb25a232951d0446d43d64d6c884ee0b55901abaea062dc0b30"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:13.024864Z","signature_b64":"Q65dUs7qTM+iWYpYsyIT4n0uhG9PNAqONZErxyhqJpmdMMrjKAz6bT6MmrVxr/xF0aZA7LWYE4xNDaLabG/kCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4d0c2cdb0251fac17d683053bd80d56ad134cc31ad931b34baf1cc37c20d289","last_reissued_at":"2026-05-18T00:25:13.024404Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:13.024404Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Pairwise Intersections of Rectangles in a Query Rectangle","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CG","authors_text":"Eunjin Oh, Hee-Kap Ahn","submitted_at":"2018-01-23T00:55:35Z","abstract_excerpt":"We consider the following problem: Preprocess a set $\\mathcal{S}$ of $n$ axis-parallel boxes in $\\mathbb{R}^d$ so that given a query of an axis-parallel box in $\\mathbb{R}^d$, the pairs of boxes of $\\mathcal{S}$ whose intersection intersects the query box can be reported efficiently. For the case that $d=2$, we present a data structure of size $O(n\\log n)$ supporting $O(\\log n+k)$ query time, where $k$ is the size of the output. This improves the previously best known result by de Berg et al. which requires $O(\\log n+ k\\log n)$ query time using $O(n\\log n)$ space. There has been no result know"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07362","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":"1801.07362","created_at":"2026-05-18T00:25:13.024477+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07362v1","created_at":"2026-05-18T00:25:13.024477+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07362","created_at":"2026-05-18T00:25:13.024477+00:00"},{"alias_kind":"pith_short_12","alias_value":"4TIMFTNQEUP2","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4TIMFTNQEUP2YF6W","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4TIMFTNQ","created_at":"2026-05-18T12:32:05.422762+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/4TIMFTNQEUP2YF6WQMCTXWANK2","json":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2.json","graph_json":"https://pith.science/api/pith-number/4TIMFTNQEUP2YF6WQMCTXWANK2/graph.json","events_json":"https://pith.science/api/pith-number/4TIMFTNQEUP2YF6WQMCTXWANK2/events.json","paper":"https://pith.science/paper/4TIMFTNQ"},"agent_actions":{"view_html":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2","download_json":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2.json","view_paper":"https://pith.science/paper/4TIMFTNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07362&json=true","fetch_graph":"https://pith.science/api/pith-number/4TIMFTNQEUP2YF6WQMCTXWANK2/graph.json","fetch_events":"https://pith.science/api/pith-number/4TIMFTNQEUP2YF6WQMCTXWANK2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2/action/storage_attestation","attest_author":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2/action/author_attestation","sign_citation":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2/action/citation_signature","submit_replication":"https://pith.science/pith/4TIMFTNQEUP2YF6WQMCTXWANK2/action/replication_record"}},"created_at":"2026-05-18T00:25:13.024477+00:00","updated_at":"2026-05-18T00:25:13.024477+00:00"}