{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:IACKJAF6HIIJOEVS2SNWHCHDFP","short_pith_number":"pith:IACKJAF6","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"},"canonical_sha256":"4004a480be3a109712b2d49b6388e32bc0b13e8d3cb97f451e76feb8e89bcb40","source":{"kind":"arxiv","id":"1210.0758","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0758","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0758v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0758","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"IACKJAF6HIIJ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IACKJAF6HIIJOEVS","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IACKJAF6","created_at":"2026-05-18T12:27:09Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:IACKJAF6HIIJOEVS2SNWHCHDFP","target":"record","payload":{"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"},"canonical_sha256":"4004a480be3a109712b2d49b6388e32bc0b13e8d3cb97f451e76feb8e89bcb40","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"},"source_kind":"arxiv","source_id":"1210.0758","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:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ozqudL+RmDqZBSSbIH6ZYLXlirszXrdrBR0phUidMzx85P1GpWUtxSeQnbfNJUH08WFxyLKhK6hrhahmymq1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:20:58.720536Z"},"content_sha256":"48f950be6be84c32cdd55ef4e74b2ad2e42df0e96afb37d49d357a6c0b8d7870","schema_version":"1.0","event_id":"sha256:48f950be6be84c32cdd55ef4e74b2ad2e42df0e96afb37d49d357a6c0b8d7870"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:IACKJAF6HIIJOEVS2SNWHCHDFP","target":"graph","payload":{"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"},"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:44:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cbSopfGPt0GEZP4FTqO7VvNDvkFnDzUvvBwyp+JpXFX4c1mQPfP2uiaCKlL7o87FzYhzhnnyXcKU+x/BHtrgCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T20:20:58.721101Z"},"content_sha256":"17f3e77475acec61f67201b5f30942684fd92e74c3f4dfddd38fb5b79147ab02","schema_version":"1.0","event_id":"sha256:17f3e77475acec61f67201b5f30942684fd92e74c3f4dfddd38fb5b79147ab02"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/bundle.json","state_url":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/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-25T20:20:58Z","links":{"resolver":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP","bundle":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/bundle.json","state":"https://pith.science/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IACKJAF6HIIJOEVS2SNWHCHDFP/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:IACKJAF6HIIJOEVS2SNWHCHDFP","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":"089e50aa30eb7ef5fca2673a4b7c7bc92e5ee91e865c8945fd1086abc0082a3f","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T13:04:49Z","title_canon_sha256":"e015ae7b500922676259c9d9792d137196f7157d3fa01a9d0b24009a7eec76cc"},"schema_version":"1.0","source":{"id":"1210.0758","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0758","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0758v1","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0758","created_at":"2026-05-18T03:44:14Z"},{"alias_kind":"pith_short_12","alias_value":"IACKJAF6HIIJ","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_16","alias_value":"IACKJAF6HIIJOEVS","created_at":"2026-05-18T12:27:09Z"},{"alias_kind":"pith_short_8","alias_value":"IACKJAF6","created_at":"2026-05-18T12:27:09Z"}],"graph_snapshots":[{"event_id":"sha256:17f3e77475acec61f67201b5f30942684fd92e74c3f4dfddd38fb5b79147ab02","target":"graph","created_at":"2026-05-18T03:44: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":"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","authors_text":"Daniele Cerra, Mihai Datcu","cross_cats":["cs.IR","cs.LG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T13:04:49Z","title":"A fast compression-based similarity measure with applications to content-based image retrieval"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0758","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:48f950be6be84c32cdd55ef4e74b2ad2e42df0e96afb37d49d357a6c0b8d7870","target":"record","created_at":"2026-05-18T03:44: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":"089e50aa30eb7ef5fca2673a4b7c7bc92e5ee91e865c8945fd1086abc0082a3f","cross_cats_sorted":["cs.IR","cs.LG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2012-10-02T13:04:49Z","title_canon_sha256":"e015ae7b500922676259c9d9792d137196f7157d3fa01a9d0b24009a7eec76cc"},"schema_version":"1.0","source":{"id":"1210.0758","kind":"arxiv","version":1}},"canonical_sha256":"4004a480be3a109712b2d49b6388e32bc0b13e8d3cb97f451e76feb8e89bcb40","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4004a480be3a109712b2d49b6388e32bc0b13e8d3cb97f451e76feb8e89bcb40","first_computed_at":"2026-05-18T03:44:14.315714Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:44:14.315714Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bkWG1B9Y7+lGosn6XYAnKx+VitM6Dt2I2axTl57cE6Ek2b5UMVJ482n+KfM85hN4KqspRZ+tr0itLJZ0NKbgBA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:44:14.316415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0758","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:48f950be6be84c32cdd55ef4e74b2ad2e42df0e96afb37d49d357a6c0b8d7870","sha256:17f3e77475acec61f67201b5f30942684fd92e74c3f4dfddd38fb5b79147ab02"],"state_sha256":"ec6333daf52a1a6020e263e7dd87bff34cf8610f6e68856e5b7423aa90907e9e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KNDfd5nLeEIbdR5+2TbPq7zpyZt0iQM+8xGp4w82lT1w+FuZAJfh2Sfa1KwtaulnpCj68qRkemLfOnGB/GFmBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T20:20:58.723727Z","bundle_sha256":"010cdbf7c5fc38508ff66b6026c5e226f1808203668da1f83e880ad25c4c363f"}}