{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:MAMYYK2UOIUNJE7VE5HPGGYHXG","short_pith_number":"pith:MAMYYK2U","canonical_record":{"source":{"id":"1405.5873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-22T15:01:07Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"a8f0062f7396199af37db70aebd7d48050f1499ad0d94156e8e66d44f70a5f75","abstract_canon_sha256":"546c92f9a5cfe32fd6ba9057b77e834c7cccfc5f828058e49f8621934d3115ba"},"schema_version":"1.0"},"canonical_sha256":"60198c2b547228d493f5274ef31b07b9ae5e57cb3fa4ff0403ec8216b9a99bf2","source":{"kind":"arxiv","id":"1405.5873","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5873","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5873v1","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5873","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"MAMYYK2UOIUN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MAMYYK2UOIUNJE7V","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MAMYYK2U","created_at":"2026-05-18T12:28:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:MAMYYK2UOIUNJE7VE5HPGGYHXG","target":"record","payload":{"canonical_record":{"source":{"id":"1405.5873","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-22T15:01:07Z","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"title_canon_sha256":"a8f0062f7396199af37db70aebd7d48050f1499ad0d94156e8e66d44f70a5f75","abstract_canon_sha256":"546c92f9a5cfe32fd6ba9057b77e834c7cccfc5f828058e49f8621934d3115ba"},"schema_version":"1.0"},"canonical_sha256":"60198c2b547228d493f5274ef31b07b9ae5e57cb3fa4ff0403ec8216b9a99bf2","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:14.544511Z","signature_b64":"2cfARZ/pn/4dk+fND1oGM8+0Et2SliQ2Gm9BvmHJguQBxDQvl5TGp2ONmdSlqIxrPMLPYEJu10EpmKMcfRACBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60198c2b547228d493f5274ef31b07b9ae5e57cb3fa4ff0403ec8216b9a99bf2","last_reissued_at":"2026-05-18T02:51:14.543918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:14.543918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1405.5873","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-18T02:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ABRY38RgyeNinQNSHjm5EZPLsJxEDCdfukS2qPtX8Arh4/rV5TZf6RxqxF2TkMxlxB2cR0f8d9fluWQ0Zck0Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:30:09.025462Z"},"content_sha256":"ced9c709c93051190b0de2fcd691a09103718b91aa7282153d43d82b1266dfc4","schema_version":"1.0","event_id":"sha256:ced9c709c93051190b0de2fcd691a09103718b91aa7282153d43d82b1266dfc4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:MAMYYK2UOIUNJE7VE5HPGGYHXG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Compressive Mining: Fast and Optimal Data Mining in the Compressed Domain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.IT","math.IT"],"primary_cat":"stat.ML","authors_text":"Anastasios Kyrillidis, Michail Vlachos, Nikolaos Freris","submitted_at":"2014-05-22T15:01:07Z","abstract_excerpt":"Real-world data typically contain repeated and periodic patterns. This suggests that they can be effectively represented and compressed using only a few coefficients of an appropriate basis (e.g., Fourier, Wavelets, etc.). However, distance estimation when the data are represented using different sets of coefficients is still a largely unexplored area. This work studies the optimization problems related to obtaining the \\emph{tightest} lower/upper bound on Euclidean distances when each data object is potentially compressed using a different set of orthonormal coefficients. Our technique leads "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5873","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-18T02:51:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9VzF1efHllRWQywlyEYseesGq2ANLdrhp/N61lat1pMsiFFqkKiEez7X67hdBLGZsS/xNPVWd20bOsN97ceAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T20:30:09.026256Z"},"content_sha256":"41173ed94be3d39418708c6e6705ead79f93c36393dce51b3b606c6bf6f8d657","schema_version":"1.0","event_id":"sha256:41173ed94be3d39418708c6e6705ead79f93c36393dce51b3b606c6bf6f8d657"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/bundle.json","state_url":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/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-08T20:30:09Z","links":{"resolver":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG","bundle":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/bundle.json","state":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:MAMYYK2UOIUNJE7VE5HPGGYHXG","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":"546c92f9a5cfe32fd6ba9057b77e834c7cccfc5f828058e49f8621934d3115ba","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-22T15:01:07Z","title_canon_sha256":"a8f0062f7396199af37db70aebd7d48050f1499ad0d94156e8e66d44f70a5f75"},"schema_version":"1.0","source":{"id":"1405.5873","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1405.5873","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"arxiv_version","alias_value":"1405.5873v1","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5873","created_at":"2026-05-18T02:51:14Z"},{"alias_kind":"pith_short_12","alias_value":"MAMYYK2UOIUN","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_16","alias_value":"MAMYYK2UOIUNJE7V","created_at":"2026-05-18T12:28:38Z"},{"alias_kind":"pith_short_8","alias_value":"MAMYYK2U","created_at":"2026-05-18T12:28:38Z"}],"graph_snapshots":[{"event_id":"sha256:41173ed94be3d39418708c6e6705ead79f93c36393dce51b3b606c6bf6f8d657","target":"graph","created_at":"2026-05-18T02:51:14Z","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":"Real-world data typically contain repeated and periodic patterns. This suggests that they can be effectively represented and compressed using only a few coefficients of an appropriate basis (e.g., Fourier, Wavelets, etc.). However, distance estimation when the data are represented using different sets of coefficients is still a largely unexplored area. This work studies the optimization problems related to obtaining the \\emph{tightest} lower/upper bound on Euclidean distances when each data object is potentially compressed using a different set of orthonormal coefficients. Our technique leads ","authors_text":"Anastasios Kyrillidis, Michail Vlachos, Nikolaos Freris","cross_cats":["cs.DS","cs.IT","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-22T15:01:07Z","title":"Compressive Mining: Fast and Optimal Data Mining in the Compressed Domain"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5873","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:ced9c709c93051190b0de2fcd691a09103718b91aa7282153d43d82b1266dfc4","target":"record","created_at":"2026-05-18T02:51:14Z","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":"546c92f9a5cfe32fd6ba9057b77e834c7cccfc5f828058e49f8621934d3115ba","cross_cats_sorted":["cs.DS","cs.IT","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2014-05-22T15:01:07Z","title_canon_sha256":"a8f0062f7396199af37db70aebd7d48050f1499ad0d94156e8e66d44f70a5f75"},"schema_version":"1.0","source":{"id":"1405.5873","kind":"arxiv","version":1}},"canonical_sha256":"60198c2b547228d493f5274ef31b07b9ae5e57cb3fa4ff0403ec8216b9a99bf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60198c2b547228d493f5274ef31b07b9ae5e57cb3fa4ff0403ec8216b9a99bf2","first_computed_at":"2026-05-18T02:51:14.543918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:51:14.543918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2cfARZ/pn/4dk+fND1oGM8+0Et2SliQ2Gm9BvmHJguQBxDQvl5TGp2ONmdSlqIxrPMLPYEJu10EpmKMcfRACBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:51:14.544511Z","signed_message":"canonical_sha256_bytes"},"source_id":"1405.5873","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ced9c709c93051190b0de2fcd691a09103718b91aa7282153d43d82b1266dfc4","sha256:41173ed94be3d39418708c6e6705ead79f93c36393dce51b3b606c6bf6f8d657"],"state_sha256":"410728b32998d4ad54244772ed97fce5d0eb983224d458a441ccc72b31772cce"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SBMQGG3X2mupR3zkk24MaEyJn+qYtdudFLIJl5Tqx53ThNrgv545coKQHLS1TEKbIMHCEtBUseLi6VWC4kTfDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T20:30:09.030249Z","bundle_sha256":"e0ce89fbba1522cb4debf22abf42834394f439f310a8a2ecfaa13708fa58c356"}}