{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:GZUSVMTJFAUDSTZJWQFRES3E2B","short_pith_number":"pith:GZUSVMTJ","schema_version":"1.0","canonical_sha256":"36692ab2692828394f29b40b124b64d066d936916218c3da8f039c2d1712ff7c","source":{"kind":"arxiv","id":"1308.3326","version":1},"attestation_state":"computed","paper":{"title":"Sorted Range Reporting Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gelin Zhou","submitted_at":"2013-08-15T07:38:16Z","abstract_excerpt":"We consider the two-dimensional sorted range reporting problem. Our data structure requires O(n lglg n) words of space and O(lglg n + k lglg n) query time, where k is the number of points in the query range. This data structure improves a recent result of Nekrich and Navarro [8] by a factor of O(lglg n) in query time, and matches the state of the art for unsorted range reporting [1]."},"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":"1308.3326","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-08-15T07:38:16Z","cross_cats_sorted":[],"title_canon_sha256":"76cbd1a802902fd35c33e2aa06f13838301c2ab9b7f3fda32c92dd7a8a78a3a6","abstract_canon_sha256":"4c5b224d02f38c364ab397c9cf9a3c165f72d21cd042f045c40a4a0d302803b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:55.010517Z","signature_b64":"fAso2vqncTBHb5gYHclXuKo9y/xMtU6LOx4FhpAZ5VmuLtZ7ZEQBV49tQdBk+tLdWc4uzCHw+14Iwpt1nn8sAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"36692ab2692828394f29b40b124b64d066d936916218c3da8f039c2d1712ff7c","last_reissued_at":"2026-05-18T03:15:55.009682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:55.009682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Sorted Range Reporting Revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gelin Zhou","submitted_at":"2013-08-15T07:38:16Z","abstract_excerpt":"We consider the two-dimensional sorted range reporting problem. Our data structure requires O(n lglg n) words of space and O(lglg n + k lglg n) query time, where k is the number of points in the query range. This data structure improves a recent result of Nekrich and Navarro [8] by a factor of O(lglg n) in query time, and matches the state of the art for unsorted range reporting [1]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.3326","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":"1308.3326","created_at":"2026-05-18T03:15:55.009802+00:00"},{"alias_kind":"arxiv_version","alias_value":"1308.3326v1","created_at":"2026-05-18T03:15:55.009802+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.3326","created_at":"2026-05-18T03:15:55.009802+00:00"},{"alias_kind":"pith_short_12","alias_value":"GZUSVMTJFAUD","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"GZUSVMTJFAUDSTZJ","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"GZUSVMTJ","created_at":"2026-05-18T12:27:46.883200+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/GZUSVMTJFAUDSTZJWQFRES3E2B","json":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B.json","graph_json":"https://pith.science/api/pith-number/GZUSVMTJFAUDSTZJWQFRES3E2B/graph.json","events_json":"https://pith.science/api/pith-number/GZUSVMTJFAUDSTZJWQFRES3E2B/events.json","paper":"https://pith.science/paper/GZUSVMTJ"},"agent_actions":{"view_html":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B","download_json":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B.json","view_paper":"https://pith.science/paper/GZUSVMTJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1308.3326&json=true","fetch_graph":"https://pith.science/api/pith-number/GZUSVMTJFAUDSTZJWQFRES3E2B/graph.json","fetch_events":"https://pith.science/api/pith-number/GZUSVMTJFAUDSTZJWQFRES3E2B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B/action/storage_attestation","attest_author":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B/action/author_attestation","sign_citation":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B/action/citation_signature","submit_replication":"https://pith.science/pith/GZUSVMTJFAUDSTZJWQFRES3E2B/action/replication_record"}},"created_at":"2026-05-18T03:15:55.009802+00:00","updated_at":"2026-05-18T03:15:55.009802+00:00"}