{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VGT4CUZ3WHYK2PG67MS4BELS4F","short_pith_number":"pith:VGT4CUZ3","schema_version":"1.0","canonical_sha256":"a9a7c1533bb1f0ad3cdefb25c09172e16960a13bf3259039adfbd5bbb5d8a88f","source":{"kind":"arxiv","id":"1304.4327","version":1},"attestation_state":"computed","paper":{"title":"Tree-Independent Dual-Tree Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander G. Gray, Charles L. Isbell Jr, David V. Anderson, Parikshit Ram, Ryan R. Curtin, William B. March","submitted_at":"2013-04-16T04:04:42Z","abstract_excerpt":"Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split: the tree, the traversal, the point-to-point base case, and the pruning rule. We provide a meta-algorithm which allows development of dual-tree algorithms in a tree-independent manner and easy extension to entirely new types of trees. Representations are provided for five common algorithms; for k-nearest neighbor search, this leads to a novel, tighter pruning "},"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":"1304.4327","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T04:04:42Z","cross_cats_sorted":[],"title_canon_sha256":"80eb4bbabbbafdfb793380dd41c48bf611063a4a87b9fa630d10b8369737ecd4","abstract_canon_sha256":"6823d8031909a648729183ee496c14a4ce859535784f411ed07366d4f4fdf8e8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:53.428711Z","signature_b64":"cmr/dr1tM8LmRBMMCsQUQuabK13TCaGxYzeG+hZblHsWqbL0dBOE/p+wr6o5uCf06s/YEg7UZecFw/CGDiKiAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a9a7c1533bb1f0ad3cdefb25c09172e16960a13bf3259039adfbd5bbb5d8a88f","last_reissued_at":"2026-05-18T03:27:53.428070Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:53.428070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tree-Independent Dual-Tree Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Alexander G. Gray, Charles L. Isbell Jr, David V. Anderson, Parikshit Ram, Ryan R. Curtin, William B. March","submitted_at":"2013-04-16T04:04:42Z","abstract_excerpt":"Dual-tree algorithms are a widely used class of branch-and-bound algorithms. Unfortunately, developing dual-tree algorithms for use with different trees and problems is often complex and burdensome. We introduce a four-part logical split: the tree, the traversal, the point-to-point base case, and the pruning rule. We provide a meta-algorithm which allows development of dual-tree algorithms in a tree-independent manner and easy extension to entirely new types of trees. Representations are provided for five common algorithms; for k-nearest neighbor search, this leads to a novel, tighter pruning "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4327","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":"1304.4327","created_at":"2026-05-18T03:27:53.428175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4327v1","created_at":"2026-05-18T03:27:53.428175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4327","created_at":"2026-05-18T03:27:53.428175+00:00"},{"alias_kind":"pith_short_12","alias_value":"VGT4CUZ3WHYK","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VGT4CUZ3WHYK2PG6","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VGT4CUZ3","created_at":"2026-05-18T12:28:04.890932+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/VGT4CUZ3WHYK2PG67MS4BELS4F","json":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F.json","graph_json":"https://pith.science/api/pith-number/VGT4CUZ3WHYK2PG67MS4BELS4F/graph.json","events_json":"https://pith.science/api/pith-number/VGT4CUZ3WHYK2PG67MS4BELS4F/events.json","paper":"https://pith.science/paper/VGT4CUZ3"},"agent_actions":{"view_html":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F","download_json":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F.json","view_paper":"https://pith.science/paper/VGT4CUZ3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4327&json=true","fetch_graph":"https://pith.science/api/pith-number/VGT4CUZ3WHYK2PG67MS4BELS4F/graph.json","fetch_events":"https://pith.science/api/pith-number/VGT4CUZ3WHYK2PG67MS4BELS4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F/action/storage_attestation","attest_author":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F/action/author_attestation","sign_citation":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F/action/citation_signature","submit_replication":"https://pith.science/pith/VGT4CUZ3WHYK2PG67MS4BELS4F/action/replication_record"}},"created_at":"2026-05-18T03:27:53.428175+00:00","updated_at":"2026-05-18T03:27:53.428175+00:00"}