{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:M2EK7HP4BTA47SVW2MDUNY2GZS","short_pith_number":"pith:M2EK7HP4","schema_version":"1.0","canonical_sha256":"6688af9dfc0cc1cfcab6d30746e346ccb512bf56949e427dd5f4c95afd09f453","source":{"kind":"arxiv","id":"1607.03292","version":1},"attestation_state":"computed","paper":{"title":"Quadboost: A Scalable Concurrent Quadtree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guangming Tan, Keren Zhou, Wei Zhou","submitted_at":"2016-07-12T10:05:56Z","abstract_excerpt":"Building concurrent spatial trees is more complicated than binary search trees since a space hierarchy should be preserved during modifications. We present a non-blocking quadtree-quadboost-that supports concurrent insert, remove, move, and contain operations. To increase its concurrency, we propose a decoupling approach that separates physical adjustment from logical removal within the remove operation. In addition, we design a continuous find mechanism to reduce its search cost. The move operation combines the searches for different keys together and modifies different positions with atomici"},"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":"1607.03292","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-07-12T10:05:56Z","cross_cats_sorted":[],"title_canon_sha256":"75cc2af276980917da619159deb6a1254a837f7657af23bc5cb7966610f57b0b","abstract_canon_sha256":"608c0aef3a5a0f85804af4106e3bfb416959b4d1fcc4828f57a99e557819172a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:09.319202Z","signature_b64":"2zQl078jw8oPjmCHvL39IOaKPK0lRzmBc1VulrvcANJmiUB6iR1G+e+vs3MXCBfKl9dojnN3uWF/gYNV1kDsDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6688af9dfc0cc1cfcab6d30746e346ccb512bf56949e427dd5f4c95afd09f453","last_reissued_at":"2026-05-18T01:11:09.318778Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:09.318778Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quadboost: A Scalable Concurrent Quadtree","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Guangming Tan, Keren Zhou, Wei Zhou","submitted_at":"2016-07-12T10:05:56Z","abstract_excerpt":"Building concurrent spatial trees is more complicated than binary search trees since a space hierarchy should be preserved during modifications. We present a non-blocking quadtree-quadboost-that supports concurrent insert, remove, move, and contain operations. To increase its concurrency, we propose a decoupling approach that separates physical adjustment from logical removal within the remove operation. In addition, we design a continuous find mechanism to reduce its search cost. The move operation combines the searches for different keys together and modifies different positions with atomici"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.03292","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":"1607.03292","created_at":"2026-05-18T01:11:09.318849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.03292v1","created_at":"2026-05-18T01:11:09.318849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.03292","created_at":"2026-05-18T01:11:09.318849+00:00"},{"alias_kind":"pith_short_12","alias_value":"M2EK7HP4BTA4","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_16","alias_value":"M2EK7HP4BTA47SVW","created_at":"2026-05-18T12:30:29.479603+00:00"},{"alias_kind":"pith_short_8","alias_value":"M2EK7HP4","created_at":"2026-05-18T12:30:29.479603+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/M2EK7HP4BTA47SVW2MDUNY2GZS","json":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS.json","graph_json":"https://pith.science/api/pith-number/M2EK7HP4BTA47SVW2MDUNY2GZS/graph.json","events_json":"https://pith.science/api/pith-number/M2EK7HP4BTA47SVW2MDUNY2GZS/events.json","paper":"https://pith.science/paper/M2EK7HP4"},"agent_actions":{"view_html":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS","download_json":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS.json","view_paper":"https://pith.science/paper/M2EK7HP4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.03292&json=true","fetch_graph":"https://pith.science/api/pith-number/M2EK7HP4BTA47SVW2MDUNY2GZS/graph.json","fetch_events":"https://pith.science/api/pith-number/M2EK7HP4BTA47SVW2MDUNY2GZS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS/action/storage_attestation","attest_author":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS/action/author_attestation","sign_citation":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS/action/citation_signature","submit_replication":"https://pith.science/pith/M2EK7HP4BTA47SVW2MDUNY2GZS/action/replication_record"}},"created_at":"2026-05-18T01:11:09.318849+00:00","updated_at":"2026-05-18T01:11:09.318849+00:00"}