{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:O2WCQXUXPVEZ4YCBIBJ75VLHLH","short_pith_number":"pith:O2WCQXUX","schema_version":"1.0","canonical_sha256":"76ac285e977d499e60414053fed56759e0e8e3d24221b3f552b8fb5455054756","source":{"kind":"arxiv","id":"1406.4822","version":1},"attestation_state":"computed","paper":{"title":"Local Doubling Dimension of Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.CG","authors_text":"Aruni Choudhary, Michael Kerber","submitted_at":"2014-06-18T18:15:16Z","abstract_excerpt":"We introduce the notion of t-restricted doubling dimension of a point set in Euclidean space as the local intrinsic dimension up to scale t. In many applications information is only relevant for a fixed range of scales. We present an algorithm to construct a hierarchical net-tree up to scale t which we denote as the net-forest. We present a method based on Locality Sensitive Hashing to compute all near neighbours of points within a certain distance. Our construction of the net-forest is probabilistic, and we guarantee that with high probability, the net-forest is supplemented with the correct "},"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":"1406.4822","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CG","submitted_at":"2014-06-18T18:15:16Z","cross_cats_sorted":["math.AT"],"title_canon_sha256":"0e0a7904ecea5cbf1c6c097988d38bd8ddffc5bcca11222533d2d9c12924a0f2","abstract_canon_sha256":"baa0c169b263e3f97863530654b2c07863e125659bfbbc56db6b9db3472fa7ed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:49:30.249838Z","signature_b64":"Y5oGYY63Z/dt61GAIYsnt964J3dDWyaNOEHLcX9Rwx5unNBWKeRKoAiXPXzqM+u8A+OTMhobSOXSXnHcbbJ7Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"76ac285e977d499e60414053fed56759e0e8e3d24221b3f552b8fb5455054756","last_reissued_at":"2026-05-18T02:49:30.249386Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:49:30.249386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Local Doubling Dimension of Point Sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AT"],"primary_cat":"cs.CG","authors_text":"Aruni Choudhary, Michael Kerber","submitted_at":"2014-06-18T18:15:16Z","abstract_excerpt":"We introduce the notion of t-restricted doubling dimension of a point set in Euclidean space as the local intrinsic dimension up to scale t. In many applications information is only relevant for a fixed range of scales. We present an algorithm to construct a hierarchical net-tree up to scale t which we denote as the net-forest. We present a method based on Locality Sensitive Hashing to compute all near neighbours of points within a certain distance. Our construction of the net-forest is probabilistic, and we guarantee that with high probability, the net-forest is supplemented with the correct "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.4822","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":"1406.4822","created_at":"2026-05-18T02:49:30.249451+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.4822v1","created_at":"2026-05-18T02:49:30.249451+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.4822","created_at":"2026-05-18T02:49:30.249451+00:00"},{"alias_kind":"pith_short_12","alias_value":"O2WCQXUXPVEZ","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_16","alias_value":"O2WCQXUXPVEZ4YCB","created_at":"2026-05-18T12:28:41.024544+00:00"},{"alias_kind":"pith_short_8","alias_value":"O2WCQXUX","created_at":"2026-05-18T12:28:41.024544+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/O2WCQXUXPVEZ4YCBIBJ75VLHLH","json":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH.json","graph_json":"https://pith.science/api/pith-number/O2WCQXUXPVEZ4YCBIBJ75VLHLH/graph.json","events_json":"https://pith.science/api/pith-number/O2WCQXUXPVEZ4YCBIBJ75VLHLH/events.json","paper":"https://pith.science/paper/O2WCQXUX"},"agent_actions":{"view_html":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH","download_json":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH.json","view_paper":"https://pith.science/paper/O2WCQXUX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.4822&json=true","fetch_graph":"https://pith.science/api/pith-number/O2WCQXUXPVEZ4YCBIBJ75VLHLH/graph.json","fetch_events":"https://pith.science/api/pith-number/O2WCQXUXPVEZ4YCBIBJ75VLHLH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH/action/storage_attestation","attest_author":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH/action/author_attestation","sign_citation":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH/action/citation_signature","submit_replication":"https://pith.science/pith/O2WCQXUXPVEZ4YCBIBJ75VLHLH/action/replication_record"}},"created_at":"2026-05-18T02:49:30.249451+00:00","updated_at":"2026-05-18T02:49:30.249451+00:00"}