{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:APGYLLPT7TNN3RFEKQ2N45D7BH","short_pith_number":"pith:APGYLLPT","schema_version":"1.0","canonical_sha256":"03cd85adf3fcdaddc4a45434de747f09f74deacd0eae924252e0c45fef379873","source":{"kind":"arxiv","id":"1501.05222","version":1},"attestation_state":"computed","paper":{"title":"Plug-and-play dual-tree algorithm runtime analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Dongryeol Lee, Parikshit Ram, Ryan R. Curtin, William B. March","submitted_at":"2015-01-21T16:39:43Z","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 "},"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":"1501.05222","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-01-21T16:39:43Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"747c1d9326a00dcba80fed2a189efea19e374938cc417d1baf3e5e975e665fd1","abstract_canon_sha256":"6f877fb29512d7d7ac91a3feccdd63eaa16c197bb5a36a635b4ec07c368ac4f9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:28:55.728189Z","signature_b64":"jZTsXkPZLBur5j4XWNHgND82aWxE9JerkrFXCIt/QeWiBPXdTccHAmOcz1T1k/0ATwNnBYyk8f7jTomsnHElAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"03cd85adf3fcdaddc4a45434de747f09f74deacd0eae924252e0c45fef379873","last_reissued_at":"2026-05-18T02:28:55.727810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:28:55.727810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Plug-and-play dual-tree algorithm runtime analysis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Dongryeol Lee, Parikshit Ram, Ryan R. Curtin, William B. March","submitted_at":"2015-01-21T16:39:43Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1501.05222","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":"1501.05222","created_at":"2026-05-18T02:28:55.727866+00:00"},{"alias_kind":"arxiv_version","alias_value":"1501.05222v1","created_at":"2026-05-18T02:28:55.727866+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1501.05222","created_at":"2026-05-18T02:28:55.727866+00:00"},{"alias_kind":"pith_short_12","alias_value":"APGYLLPT7TNN","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"APGYLLPT7TNN3RFE","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"APGYLLPT","created_at":"2026-05-18T12:29:10.953037+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/APGYLLPT7TNN3RFEKQ2N45D7BH","json":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH.json","graph_json":"https://pith.science/api/pith-number/APGYLLPT7TNN3RFEKQ2N45D7BH/graph.json","events_json":"https://pith.science/api/pith-number/APGYLLPT7TNN3RFEKQ2N45D7BH/events.json","paper":"https://pith.science/paper/APGYLLPT"},"agent_actions":{"view_html":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH","download_json":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH.json","view_paper":"https://pith.science/paper/APGYLLPT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1501.05222&json=true","fetch_graph":"https://pith.science/api/pith-number/APGYLLPT7TNN3RFEKQ2N45D7BH/graph.json","fetch_events":"https://pith.science/api/pith-number/APGYLLPT7TNN3RFEKQ2N45D7BH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH/action/storage_attestation","attest_author":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH/action/author_attestation","sign_citation":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH/action/citation_signature","submit_replication":"https://pith.science/pith/APGYLLPT7TNN3RFEKQ2N45D7BH/action/replication_record"}},"created_at":"2026-05-18T02:28:55.727866+00:00","updated_at":"2026-05-18T02:28:55.727866+00:00"}