{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:VGT4CUZ3WHYK2PG67MS4BELS4F","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6823d8031909a648729183ee496c14a4ce859535784f411ed07366d4f4fdf8e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T04:04:42Z","title_canon_sha256":"80eb4bbabbbafdfb793380dd41c48bf611063a4a87b9fa630d10b8369737ecd4"},"schema_version":"1.0","source":{"id":"1304.4327","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.4327","created_at":"2026-05-18T03:27:53Z"},{"alias_kind":"arxiv_version","alias_value":"1304.4327v1","created_at":"2026-05-18T03:27:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4327","created_at":"2026-05-18T03:27:53Z"},{"alias_kind":"pith_short_12","alias_value":"VGT4CUZ3WHYK","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_16","alias_value":"VGT4CUZ3WHYK2PG6","created_at":"2026-05-18T12:28:04Z"},{"alias_kind":"pith_short_8","alias_value":"VGT4CUZ3","created_at":"2026-05-18T12:28:04Z"}],"graph_snapshots":[{"event_id":"sha256:32f987cedeb46f941d3161d804c5195cb1d77f430ed16d8a89afda85e5374e88","target":"graph","created_at":"2026-05-18T03:27:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Alexander G. Gray, Charles L. Isbell Jr, David V. Anderson, Parikshit Ram, Ryan R. Curtin, William B. March","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T04:04:42Z","title":"Tree-Independent Dual-Tree Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4327","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dce4f9dc29b9ae44110bc1690800dcda316634d04abcb609c197e9ad8016da02","target":"record","created_at":"2026-05-18T03:27:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6823d8031909a648729183ee496c14a4ce859535784f411ed07366d4f4fdf8e8","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-16T04:04:42Z","title_canon_sha256":"80eb4bbabbbafdfb793380dd41c48bf611063a4a87b9fa630d10b8369737ecd4"},"schema_version":"1.0","source":{"id":"1304.4327","kind":"arxiv","version":1}},"canonical_sha256":"a9a7c1533bb1f0ad3cdefb25c09172e16960a13bf3259039adfbd5bbb5d8a88f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a9a7c1533bb1f0ad3cdefb25c09172e16960a13bf3259039adfbd5bbb5d8a88f","first_computed_at":"2026-05-18T03:27:53.428070Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:27:53.428070Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"cmr/dr1tM8LmRBMMCsQUQuabK13TCaGxYzeG+hZblHsWqbL0dBOE/p+wr6o5uCf06s/YEg7UZecFw/CGDiKiAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:27:53.428711Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.4327","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dce4f9dc29b9ae44110bc1690800dcda316634d04abcb609c197e9ad8016da02","sha256:32f987cedeb46f941d3161d804c5195cb1d77f430ed16d8a89afda85e5374e88"],"state_sha256":"3bfc7fd4a5c4fa235c0fd7ec377624caff81981a70cce3f85955087bc72193e7"}