{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:APGYLLPT7TNN3RFEKQ2N45D7BH","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":"6f877fb29512d7d7ac91a3feccdd63eaa16c197bb5a36a635b4ec07c368ac4f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T16:39:43Z","title_canon_sha256":"747c1d9326a00dcba80fed2a189efea19e374938cc417d1baf3e5e975e665fd1"},"schema_version":"1.0","source":{"id":"1501.05222","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1501.05222","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"arxiv_version","alias_value":"1501.05222v1","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05222","created_at":"2026-05-18T02:28:55Z"},{"alias_kind":"pith_short_12","alias_value":"APGYLLPT7TNN","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"APGYLLPT7TNN3RFE","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"APGYLLPT","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:c7b3deaba7e3e4b3f2900f082ce2aaa33000f9380b7284de130523da8553670f","target":"graph","created_at":"2026-05-18T02:28:55Z","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":"Numerous machine learning algorithms contain pairwise statistical problems at their core---that is, tasks that require computations over all pairs of input points if implemented naively. Often, tree structures are used to solve these problems efficiently. Dual-tree algorithms can efficiently solve or approximate many of these problems. Using cover trees, rigorous worst-case runtime guarantees have been proven for some of these algorithms. In this paper, we present a problem-independent runtime guarantee for any dual-tree algorithm using the cover tree, separating out the problem-dependent and ","authors_text":"Dongryeol Lee, Parikshit Ram, Ryan R. Curtin, William B. March","cross_cats":["cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T16:39:43Z","title":"Plug-and-play dual-tree algorithm runtime analysis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05222","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:c1ed379151dc9f18bc0c30412fb3631497278f794ceefba65a394127d45d7e7e","target":"record","created_at":"2026-05-18T02:28:55Z","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":"6f877fb29512d7d7ac91a3feccdd63eaa16c197bb5a36a635b4ec07c368ac4f9","cross_cats_sorted":["cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T16:39:43Z","title_canon_sha256":"747c1d9326a00dcba80fed2a189efea19e374938cc417d1baf3e5e975e665fd1"},"schema_version":"1.0","source":{"id":"1501.05222","kind":"arxiv","version":1}},"canonical_sha256":"03cd85adf3fcdaddc4a45434de747f09f74deacd0eae924252e0c45fef379873","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"03cd85adf3fcdaddc4a45434de747f09f74deacd0eae924252e0c45fef379873","first_computed_at":"2026-05-18T02:28:55.727810Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:28:55.727810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jZTsXkPZLBur5j4XWNHgND82aWxE9JerkrFXCIt/QeWiBPXdTccHAmOcz1T1k/0ATwNnBYyk8f7jTomsnHElAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:28:55.728189Z","signed_message":"canonical_sha256_bytes"},"source_id":"1501.05222","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c1ed379151dc9f18bc0c30412fb3631497278f794ceefba65a394127d45d7e7e","sha256:c7b3deaba7e3e4b3f2900f082ce2aaa33000f9380b7284de130523da8553670f"],"state_sha256":"74e808e7c510a85f1c7ddaf63249263a378bd63c315a6436743eb28bb6d3de2b"}