{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VRRG7TAOLM3W3ITLAVULVAAWEK","short_pith_number":"pith:VRRG7TAO","schema_version":"1.0","canonical_sha256":"ac626fcc0e5b376da26b0568ba801622a616c0a56a0523e1dd6ef594aa773707","source":{"kind":"arxiv","id":"1302.3917","version":1},"attestation_state":"computed","paper":{"title":"k-d Darts: Sampling by k-Dimensional Flat Searches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Andrew A. Davidson, Anjul Patney, John D. Owens, Keith R. Dalbey, Mohamed S. Ebeida, Scott A. Mitchell","submitted_at":"2013-02-16T01:14:33Z","abstract_excerpt":"We formalize the notion of sampling a function using k-d darts. A k-d dart is a set of independent, mutually orthogonal, k-dimensional subspaces called k-d flats. Each dart has d choose k flats, aligned with the coordinate axes for efficiency. We show that k-d darts are useful for exploring a function's properties, such as estimating its integral, or finding an exemplar above a threshold. We describe a recipe for converting an algorithm from point sampling to k-d dart sampling, assuming the function can be evaluated along a k-d flat.\n  We demonstrate that k-d darts are more efficient than poin"},"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":"1302.3917","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GR","submitted_at":"2013-02-16T01:14:33Z","cross_cats_sorted":[],"title_canon_sha256":"ca5ff1e75e6ae2138559c8bbb47276f30d3af1d0d72ba489372fa16218b994e8","abstract_canon_sha256":"3debd86cf5c83d740596c228556adb9e3205e963e8630c38693bc642c7a44b87"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:59:30.636888Z","signature_b64":"SLVjehgLeOA/tBU8n9d7VQYsd3ZUhBEhxZE1QbBfDQN8TRPNBmRjvZ59TAKIjWbW0upAaJlW+V4XRJW/i4PTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ac626fcc0e5b376da26b0568ba801622a616c0a56a0523e1dd6ef594aa773707","last_reissued_at":"2026-05-18T02:59:30.636094Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:59:30.636094Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"k-d Darts: Sampling by k-Dimensional Flat Searches","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GR","authors_text":"Andrew A. Davidson, Anjul Patney, John D. Owens, Keith R. Dalbey, Mohamed S. Ebeida, Scott A. Mitchell","submitted_at":"2013-02-16T01:14:33Z","abstract_excerpt":"We formalize the notion of sampling a function using k-d darts. A k-d dart is a set of independent, mutually orthogonal, k-dimensional subspaces called k-d flats. Each dart has d choose k flats, aligned with the coordinate axes for efficiency. We show that k-d darts are useful for exploring a function's properties, such as estimating its integral, or finding an exemplar above a threshold. We describe a recipe for converting an algorithm from point sampling to k-d dart sampling, assuming the function can be evaluated along a k-d flat.\n  We demonstrate that k-d darts are more efficient than poin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.3917","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":"1302.3917","created_at":"2026-05-18T02:59:30.636229+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.3917v1","created_at":"2026-05-18T02:59:30.636229+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.3917","created_at":"2026-05-18T02:59:30.636229+00:00"},{"alias_kind":"pith_short_12","alias_value":"VRRG7TAOLM3W","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VRRG7TAOLM3W3ITL","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VRRG7TAO","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/VRRG7TAOLM3W3ITLAVULVAAWEK","json":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK.json","graph_json":"https://pith.science/api/pith-number/VRRG7TAOLM3W3ITLAVULVAAWEK/graph.json","events_json":"https://pith.science/api/pith-number/VRRG7TAOLM3W3ITLAVULVAAWEK/events.json","paper":"https://pith.science/paper/VRRG7TAO"},"agent_actions":{"view_html":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK","download_json":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK.json","view_paper":"https://pith.science/paper/VRRG7TAO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.3917&json=true","fetch_graph":"https://pith.science/api/pith-number/VRRG7TAOLM3W3ITLAVULVAAWEK/graph.json","fetch_events":"https://pith.science/api/pith-number/VRRG7TAOLM3W3ITLAVULVAAWEK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK/action/storage_attestation","attest_author":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK/action/author_attestation","sign_citation":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK/action/citation_signature","submit_replication":"https://pith.science/pith/VRRG7TAOLM3W3ITLAVULVAAWEK/action/replication_record"}},"created_at":"2026-05-18T02:59:30.636229+00:00","updated_at":"2026-05-18T02:59:30.636229+00:00"}