{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:YDEAELQB5QNQON2CLUGLH2EBRB","short_pith_number":"pith:YDEAELQB","canonical_record":{"source":{"id":"1503.05638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T02:54:21Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"9fbcbd6aa42fb59a1508c2f38cbc6e4c39922785091b3e8433e13b7ad4aacf86","abstract_canon_sha256":"06efa77df1e6ab80fb50807ce324712a17e0b5b4c8b756fa47910b9a3894db8f"},"schema_version":"1.0"},"canonical_sha256":"c0c8022e01ec1b0737425d0cb3e881884cebff57c16cc4b40fd9e388dd4e7eef","source":{"kind":"arxiv","id":"1503.05638","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05638","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05638v2","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05638","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"YDEAELQB5QNQ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YDEAELQB5QNQON2C","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YDEAELQB","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:YDEAELQB5QNQON2CLUGLH2EBRB","target":"record","payload":{"canonical_record":{"source":{"id":"1503.05638","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T02:54:21Z","cross_cats_sorted":["q-bio.GN"],"title_canon_sha256":"9fbcbd6aa42fb59a1508c2f38cbc6e4c39922785091b3e8433e13b7ad4aacf86","abstract_canon_sha256":"06efa77df1e6ab80fb50807ce324712a17e0b5b4c8b756fa47910b9a3894db8f"},"schema_version":"1.0"},"canonical_sha256":"c0c8022e01ec1b0737425d0cb3e881884cebff57c16cc4b40fd9e388dd4e7eef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:37.296614Z","signature_b64":"PFroIcVaZhoAf1gE7NPqvT/hTKEZ5vi371cG8MIX0vEx9cdimgeXbD6tvM/nhqwV+zwK7zNxm5R2k+4aReIPCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c0c8022e01ec1b0737425d0cb3e881884cebff57c16cc4b40fd9e388dd4e7eef","last_reissued_at":"2026-05-18T01:32:37.295931Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:37.295931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.05638","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"B80L4R/1x/8MTGrpl7ATOAfUEN1oykrrmA/TY1RqMPQJhC908o4sx9/HMJG4wpaU42hUdPEz7y8GKobEsOOPBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:48:29.427836Z"},"content_sha256":"cb1995cdf7005820a9c2fdb25a9205134026a83c6aea7a8f1b2e3353309636f0","schema_version":"1.0","event_id":"sha256:cb1995cdf7005820a9c2fdb25a9205134026a83c6aea7a8f1b2e3353309636f0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:YDEAELQB5QNQON2CLUGLH2EBRB","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Entropy-scaling search of massive biological data","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["q-bio.GN"],"primary_cat":"cs.DS","authors_text":"Bonnie Berger, David Christian Danko, Noah M. Daniels, Y. William Yu","submitted_at":"2015-03-19T02:54:21Z","abstract_excerpt":"Many datasets exhibit a well-defined structure that can be exploited to design faster search tools, but it is not always clear when such acceleration is possible. Here, we introduce a framework for similarity search based on characterizing a dataset's entropy and fractal dimension. We prove that searching scales in time with metric entropy (number of covering hyperspheres), if the fractal dimension of the dataset is low, and scales in space with the sum of metric entropy and information-theoretic entropy (randomness of the data). Using these ideas, we present accelerated versions of standard t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05638","kind":"arxiv","version":2},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T01:32:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z7BzuJZlFgiBbpe+AdDbbjMPSTApkfasHp5kKL5ndg61G5nWgUsx/XM+5KoE6s6Tk09edmVmlq1JTYNl3LbUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:48:29.428390Z"},"content_sha256":"e8ed7e981ed9407ee05f5e94260f35268aec3f128ed9baefaafa5287b5a7adee","schema_version":"1.0","event_id":"sha256:e8ed7e981ed9407ee05f5e94260f35268aec3f128ed9baefaafa5287b5a7adee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YDEAELQB5QNQON2CLUGLH2EBRB/bundle.json","state_url":"https://pith.science/pith/YDEAELQB5QNQON2CLUGLH2EBRB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YDEAELQB5QNQON2CLUGLH2EBRB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T17:48:29Z","links":{"resolver":"https://pith.science/pith/YDEAELQB5QNQON2CLUGLH2EBRB","bundle":"https://pith.science/pith/YDEAELQB5QNQON2CLUGLH2EBRB/bundle.json","state":"https://pith.science/pith/YDEAELQB5QNQON2CLUGLH2EBRB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YDEAELQB5QNQON2CLUGLH2EBRB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:YDEAELQB5QNQON2CLUGLH2EBRB","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":"06efa77df1e6ab80fb50807ce324712a17e0b5b4c8b756fa47910b9a3894db8f","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T02:54:21Z","title_canon_sha256":"9fbcbd6aa42fb59a1508c2f38cbc6e4c39922785091b3e8433e13b7ad4aacf86"},"schema_version":"1.0","source":{"id":"1503.05638","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.05638","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"arxiv_version","alias_value":"1503.05638v2","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.05638","created_at":"2026-05-18T01:32:37Z"},{"alias_kind":"pith_short_12","alias_value":"YDEAELQB5QNQ","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"YDEAELQB5QNQON2C","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"YDEAELQB","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:e8ed7e981ed9407ee05f5e94260f35268aec3f128ed9baefaafa5287b5a7adee","target":"graph","created_at":"2026-05-18T01:32:37Z","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":"Many datasets exhibit a well-defined structure that can be exploited to design faster search tools, but it is not always clear when such acceleration is possible. Here, we introduce a framework for similarity search based on characterizing a dataset's entropy and fractal dimension. We prove that searching scales in time with metric entropy (number of covering hyperspheres), if the fractal dimension of the dataset is low, and scales in space with the sum of metric entropy and information-theoretic entropy (randomness of the data). Using these ideas, we present accelerated versions of standard t","authors_text":"Bonnie Berger, David Christian Danko, Noah M. Daniels, Y. William Yu","cross_cats":["q-bio.GN"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T02:54:21Z","title":"Entropy-scaling search of massive biological data"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.05638","kind":"arxiv","version":2},"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:cb1995cdf7005820a9c2fdb25a9205134026a83c6aea7a8f1b2e3353309636f0","target":"record","created_at":"2026-05-18T01:32:37Z","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":"06efa77df1e6ab80fb50807ce324712a17e0b5b4c8b756fa47910b9a3894db8f","cross_cats_sorted":["q-bio.GN"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-03-19T02:54:21Z","title_canon_sha256":"9fbcbd6aa42fb59a1508c2f38cbc6e4c39922785091b3e8433e13b7ad4aacf86"},"schema_version":"1.0","source":{"id":"1503.05638","kind":"arxiv","version":2}},"canonical_sha256":"c0c8022e01ec1b0737425d0cb3e881884cebff57c16cc4b40fd9e388dd4e7eef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c0c8022e01ec1b0737425d0cb3e881884cebff57c16cc4b40fd9e388dd4e7eef","first_computed_at":"2026-05-18T01:32:37.295931Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:37.295931Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PFroIcVaZhoAf1gE7NPqvT/hTKEZ5vi371cG8MIX0vEx9cdimgeXbD6tvM/nhqwV+zwK7zNxm5R2k+4aReIPCg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:37.296614Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.05638","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cb1995cdf7005820a9c2fdb25a9205134026a83c6aea7a8f1b2e3353309636f0","sha256:e8ed7e981ed9407ee05f5e94260f35268aec3f128ed9baefaafa5287b5a7adee"],"state_sha256":"88d5c770cef22a0c482cd2d40d39756b317dfbb2c37cb0b50f6952ccbc13a7f5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SOIUl5tjP2kKwUEEKsuKaalhmzyO0kILhmMo2Xr+B8QZXvg8VPYhcQwx3uXOTxT8her47EtI6rIg5DQopWIqCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:48:29.432230Z","bundle_sha256":"c3d916207d19307b6ccf5c0011111e401c555c269d5d77a52776acd8937b9a50"}}