{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:N434DVINJ4E7Q57E23G45CB2VF","short_pith_number":"pith:N434DVIN","canonical_record":{"source":{"id":"1312.2063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-07T06:40:55Z","cross_cats_sorted":["cs.DB","cs.IR","math.IT"],"title_canon_sha256":"2d776cdc6fde988d30b6757839b567620d678cacf14f22f47cbda5d8c7141169","abstract_canon_sha256":"5769fadfdec2d732c6c506cfc03279fc2c7c822774da5fa60a928a75fdbb28d0"},"schema_version":"1.0"},"canonical_sha256":"6f37c1d50d4f09f877e4d6cdce883aa96dc7162827d2bab15686d3971b334021","source":{"kind":"arxiv","id":"1312.2063","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2063","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2063v1","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2063","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"N434DVINJ4E7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N434DVINJ4E7Q57E","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N434DVIN","created_at":"2026-05-18T12:27:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:N434DVINJ4E7Q57E23G45CB2VF","target":"record","payload":{"canonical_record":{"source":{"id":"1312.2063","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-07T06:40:55Z","cross_cats_sorted":["cs.DB","cs.IR","math.IT"],"title_canon_sha256":"2d776cdc6fde988d30b6757839b567620d678cacf14f22f47cbda5d8c7141169","abstract_canon_sha256":"5769fadfdec2d732c6c506cfc03279fc2c7c822774da5fa60a928a75fdbb28d0"},"schema_version":"1.0"},"canonical_sha256":"6f37c1d50d4f09f877e4d6cdce883aa96dc7162827d2bab15686d3971b334021","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:17.436004Z","signature_b64":"utnOVJlV2wpv5ZSYUqaiZWnY8CyWVYUO3237StI/NJfKVTlVn9ozNRQkARwZmKKcTQ4zyqgfgjNIKJQZWI4wCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f37c1d50d4f09f877e4d6cdce883aa96dc7162827d2bab15686d3971b334021","last_reissued_at":"2026-05-18T03:05:17.435514Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:17.435514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.2063","source_version":1,"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-18T03:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5n6niCSSOJrt2K8Ch2rROLPlP6GOiSZuM2ZMLxap83gUPmYSK5bm560B58L6nu1q3kd/tJP3LEC/3vB3r6JhDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:35:51.529521Z"},"content_sha256":"87174f8efd3aea65ec1ee59e118b1e2975cb7c200d03a91eb44307f07582bdf8","schema_version":"1.0","event_id":"sha256:87174f8efd3aea65ec1ee59e118b1e2975cb7c200d03a91eb44307f07582bdf8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:N434DVINJ4E7Q57E23G45CB2VF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The Minimal Compression Rate for Similarity Identification","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DB","cs.IR","math.IT"],"primary_cat":"cs.IT","authors_text":"Amir Ingber, Tsachy Weissman","submitted_at":"2013-12-07T06:40:55Z","abstract_excerpt":"Traditionally, data compression deals with the problem of concisely representing a data source, e.g. a sequence of letters, for the purpose of eventual reproduction (either exact or approximate). In this work we are interested in the case where the goal is to answer similarity queries about the compressed sequence, i.e. to identify whether or not the original sequence is similar to a given query sequence. We study the fundamental tradeoff between the compression rate and the reliability of the queries performed on compressed data. For i.i.d. sequences, we characterize the minimal compression r"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2063","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"},"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-18T03:05:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QS7SIKN/to/BhJaPXPtY0/8Q49xvSXrzcc/ip+xeanjM6MLY4Vz4AAHXgyQOfOdVVJ6wrN45WCVzwK/4sR4EBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T02:35:51.529987Z"},"content_sha256":"7626f67f12784e55c6f0a593ef6ecda46dd5cd223ba2567af74d6eab34064cea","schema_version":"1.0","event_id":"sha256:7626f67f12784e55c6f0a593ef6ecda46dd5cd223ba2567af74d6eab34064cea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N434DVINJ4E7Q57E23G45CB2VF/bundle.json","state_url":"https://pith.science/pith/N434DVINJ4E7Q57E23G45CB2VF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N434DVINJ4E7Q57E23G45CB2VF/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-06-06T02:35:51Z","links":{"resolver":"https://pith.science/pith/N434DVINJ4E7Q57E23G45CB2VF","bundle":"https://pith.science/pith/N434DVINJ4E7Q57E23G45CB2VF/bundle.json","state":"https://pith.science/pith/N434DVINJ4E7Q57E23G45CB2VF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N434DVINJ4E7Q57E23G45CB2VF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:N434DVINJ4E7Q57E23G45CB2VF","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":"5769fadfdec2d732c6c506cfc03279fc2c7c822774da5fa60a928a75fdbb28d0","cross_cats_sorted":["cs.DB","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-07T06:40:55Z","title_canon_sha256":"2d776cdc6fde988d30b6757839b567620d678cacf14f22f47cbda5d8c7141169"},"schema_version":"1.0","source":{"id":"1312.2063","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.2063","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"arxiv_version","alias_value":"1312.2063v1","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.2063","created_at":"2026-05-18T03:05:17Z"},{"alias_kind":"pith_short_12","alias_value":"N434DVINJ4E7","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_16","alias_value":"N434DVINJ4E7Q57E","created_at":"2026-05-18T12:27:52Z"},{"alias_kind":"pith_short_8","alias_value":"N434DVIN","created_at":"2026-05-18T12:27:52Z"}],"graph_snapshots":[{"event_id":"sha256:7626f67f12784e55c6f0a593ef6ecda46dd5cd223ba2567af74d6eab34064cea","target":"graph","created_at":"2026-05-18T03:05:17Z","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":"Traditionally, data compression deals with the problem of concisely representing a data source, e.g. a sequence of letters, for the purpose of eventual reproduction (either exact or approximate). In this work we are interested in the case where the goal is to answer similarity queries about the compressed sequence, i.e. to identify whether or not the original sequence is similar to a given query sequence. We study the fundamental tradeoff between the compression rate and the reliability of the queries performed on compressed data. For i.i.d. sequences, we characterize the minimal compression r","authors_text":"Amir Ingber, Tsachy Weissman","cross_cats":["cs.DB","cs.IR","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-07T06:40:55Z","title":"The Minimal Compression Rate for Similarity Identification"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.2063","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:87174f8efd3aea65ec1ee59e118b1e2975cb7c200d03a91eb44307f07582bdf8","target":"record","created_at":"2026-05-18T03:05:17Z","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":"5769fadfdec2d732c6c506cfc03279fc2c7c822774da5fa60a928a75fdbb28d0","cross_cats_sorted":["cs.DB","cs.IR","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-12-07T06:40:55Z","title_canon_sha256":"2d776cdc6fde988d30b6757839b567620d678cacf14f22f47cbda5d8c7141169"},"schema_version":"1.0","source":{"id":"1312.2063","kind":"arxiv","version":1}},"canonical_sha256":"6f37c1d50d4f09f877e4d6cdce883aa96dc7162827d2bab15686d3971b334021","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f37c1d50d4f09f877e4d6cdce883aa96dc7162827d2bab15686d3971b334021","first_computed_at":"2026-05-18T03:05:17.435514Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:17.435514Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"utnOVJlV2wpv5ZSYUqaiZWnY8CyWVYUO3237StI/NJfKVTlVn9ozNRQkARwZmKKcTQ4zyqgfgjNIKJQZWI4wCw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:17.436004Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.2063","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:87174f8efd3aea65ec1ee59e118b1e2975cb7c200d03a91eb44307f07582bdf8","sha256:7626f67f12784e55c6f0a593ef6ecda46dd5cd223ba2567af74d6eab34064cea"],"state_sha256":"d092f9a1cb40008ec4991180bb01270634111e9eb9f57d71c73d00177e34723f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KSLquunaRlB6dnz7zIrGekQTpKRvdjTm0zjs2pZ0lRx5UndU0IzQLIk/XJENT1X1fHweqOMicKkD6OBqVlqyBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T02:35:51.533333Z","bundle_sha256":"cfcb7158978e4e8baf14defea3f34314a89c8be2e2b7a3bf8e2f1ebe478c75af"}}