{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:IACKJAF6HIIJOEVS2SNWHCHDFP","short_pith_number":"pith:IACKJAF6","schema_version":"1.0","canonical_sha256":"4004a480be3a109712b2d49b6388e32bc0b13e8d3cb97f451e76feb8e89bcb40","source":{"kind":"arxiv","id":"1210.0758","version":1},"attestation_state":"computed","paper":{"title":"A fast compression-based similarity measure with applications to content-based image retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniele Cerra, Mihai Datcu","submitted_at":"2012-10-02T13:04:49Z","abstract_excerpt":"Compression-based similarity measures are effectively employed in applications on diverse data types with a basically parameter-free approach. Nevertheless, there are problems in applying these techniques to medium-to-large datasets which have been seldom addressed. This paper proposes a similarity measure based on compression with dictionaries, the Fast Compression Distance (FCD), which reduces the complexity of these methods, without degradations in performance. On its basis a content-based color image retrieval system is defined, which can be compared to state-of-the-art methods based on in"},"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":"1210.0758","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T13:04:49Z","cross_cats_sorted":["cs.IR","cs.LG"],"title_canon_sha256":"e015ae7b500922676259c9d9792d137196f7157d3fa01a9d0b24009a7eec76cc","abstract_canon_sha256":"089e50aa30eb7ef5fca2673a4b7c7bc92e5ee91e865c8945fd1086abc0082a3f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:44:14.316415Z","signature_b64":"bkWG1B9Y7+lGosn6XYAnKx+VitM6Dt2I2axTl57cE6Ek2b5UMVJ482n+KfM85hN4KqspRZ+tr0itLJZ0NKbgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4004a480be3a109712b2d49b6388e32bc0b13e8d3cb97f451e76feb8e89bcb40","last_reissued_at":"2026-05-18T03:44:14.315714Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:44:14.315714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A fast compression-based similarity measure with applications to content-based image retrieval","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IR","cs.LG"],"primary_cat":"stat.ML","authors_text":"Daniele Cerra, Mihai Datcu","submitted_at":"2012-10-02T13:04:49Z","abstract_excerpt":"Compression-based similarity measures are effectively employed in applications on diverse data types with a basically parameter-free approach. Nevertheless, there are problems in applying these techniques to medium-to-large datasets which have been seldom addressed. This paper proposes a similarity measure based on compression with dictionaries, the Fast Compression Distance (FCD), which reduces the complexity of these methods, without degradations in performance. On its basis a content-based color image retrieval system is defined, which can be compared to state-of-the-art methods based on in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0758","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":"1210.0758","created_at":"2026-05-18T03:44:14.315834+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0758v1","created_at":"2026-05-18T03:44:14.315834+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0758","created_at":"2026-05-18T03:44:14.315834+00:00"},{"alias_kind":"pith_short_12","alias_value":"IACKJAF6HIIJ","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_16","alias_value":"IACKJAF6HIIJOEVS","created_at":"2026-05-18T12:27:09.501522+00:00"},{"alias_kind":"pith_short_8","alias_value":"IACKJAF6","created_at":"2026-05-18T12:27:09.501522+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/IACKJAF6HIIJOEVS2SNWHCHDFP","json":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP.json","graph_json":"https://pith.science/api/pith-number/IACKJAF6HIIJOEVS2SNWHCHDFP/graph.json","events_json":"https://pith.science/api/pith-number/IACKJAF6HIIJOEVS2SNWHCHDFP/events.json","paper":"https://pith.science/paper/IACKJAF6"},"agent_actions":{"view_html":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP","download_json":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP.json","view_paper":"https://pith.science/paper/IACKJAF6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0758&json=true","fetch_graph":"https://pith.science/api/pith-number/IACKJAF6HIIJOEVS2SNWHCHDFP/graph.json","fetch_events":"https://pith.science/api/pith-number/IACKJAF6HIIJOEVS2SNWHCHDFP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/action/storage_attestation","attest_author":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/action/author_attestation","sign_citation":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/action/citation_signature","submit_replication":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/action/replication_record"}},"created_at":"2026-05-18T03:44:14.315834+00:00","updated_at":"2026-05-18T03:44:14.315834+00:00"}