{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:MAMYYK2UOIUNJE7VE5HPGGYHXG","short_pith_number":"pith:MAMYYK2U","schema_version":"1.0","canonical_sha256":"60198c2b547228d493f5274ef31b07b9ae5e57cb3fa4ff0403ec8216b9a99bf2","source":{"kind":"arxiv","id":"1405.5873","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.5873","created_at":"2026-05-18T02:51:14.544004+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5873v1","created_at":"2026-05-18T02:51:14.544004+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5873","created_at":"2026-05-18T02:51:14.544004+00:00"},{"alias_kind":"pith_short_12","alias_value":"MAMYYK2UOIUN","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_16","alias_value":"MAMYYK2UOIUNJE7V","created_at":"2026-05-18T12:28:38.356838+00:00"},{"alias_kind":"pith_short_8","alias_value":"MAMYYK2U","created_at":"2026-05-18T12:28:38.356838+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/MAMYYK2UOIUNJE7VE5HPGGYHXG","json":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG.json","graph_json":"https://pith.science/api/pith-number/MAMYYK2UOIUNJE7VE5HPGGYHXG/graph.json","events_json":"https://pith.science/api/pith-number/MAMYYK2UOIUNJE7VE5HPGGYHXG/events.json","paper":"https://pith.science/paper/MAMYYK2U"},"agent_actions":{"view_html":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG","download_json":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG.json","view_paper":"https://pith.science/paper/MAMYYK2U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5873&json=true","fetch_graph":"https://pith.science/api/pith-number/MAMYYK2UOIUNJE7VE5HPGGYHXG/graph.json","fetch_events":"https://pith.science/api/pith-number/MAMYYK2UOIUNJE7VE5HPGGYHXG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/action/storage_attestation","attest_author":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/action/author_attestation","sign_citation":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/action/citation_signature","submit_replication":"https://pith.science/pith/MAMYYK2UOIUNJE7VE5HPGGYHXG/action/replication_record"}},"created_at":"2026-05-18T02:51:14.544004+00:00","updated_at":"2026-05-18T02:51:14.544004+00:00"}