{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:WB6WTXIKVEMUPYLD7BCBWP572G","short_pith_number":"pith:WB6WTXIK","canonical_record":{"source":{"id":"2011.09473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-18T18:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"07aa299fde386fd981e2fb17ff16bcd6ed9d27244ac695cce54fb9c23873fbec","abstract_canon_sha256":"e4bb8fade935668f0b12f8210259028ebac4aecba2bf49fcc76d9cf1c7ba12b5"},"schema_version":"1.0"},"canonical_sha256":"b07d69dd0aa91947e163f8441b3fbfd1a7c346d04bbfb765ea08acc2d93980e3","source":{"kind":"arxiv","id":"2011.09473","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09473","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09473v1","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09473","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"WB6WTXIKVEMU","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"pith_short_16","alias_value":"WB6WTXIKVEMUPYLD","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"pith_short_8","alias_value":"WB6WTXIK","created_at":"2026-07-05T01:52:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:WB6WTXIKVEMUPYLD7BCBWP572G","target":"record","payload":{"canonical_record":{"source":{"id":"2011.09473","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-18T18:59:02Z","cross_cats_sorted":[],"title_canon_sha256":"07aa299fde386fd981e2fb17ff16bcd6ed9d27244ac695cce54fb9c23873fbec","abstract_canon_sha256":"e4bb8fade935668f0b12f8210259028ebac4aecba2bf49fcc76d9cf1c7ba12b5"},"schema_version":"1.0"},"canonical_sha256":"b07d69dd0aa91947e163f8441b3fbfd1a7c346d04bbfb765ea08acc2d93980e3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:52:44.217054Z","signature_b64":"DzuX2oKn7De6Khl8CmrAt64KZ6DxSadLiWTw06qAIcsem/BQQlM7HmlfBG/0HNwPOybdyzBXP8q8rOQIabW0Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b07d69dd0aa91947e163f8441b3fbfd1a7c346d04bbfb765ea08acc2d93980e3","last_reissued_at":"2026-07-05T01:52:44.216671Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:52:44.216671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2011.09473","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-07-05T01:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"E1imRrc4bvimOGPHyurRW39n5lgJaSRVar9aOuRkzAHBv4eQ8dwc26l6vE7AJfVRCONLfv8ETgOjxqnF4IOQAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:54:41.437700Z"},"content_sha256":"27bca7359e66e1d2e6f13b36d5bd19bc652eae780f8733621c67fb3659017ce8","schema_version":"1.0","event_id":"sha256:27bca7359e66e1d2e6f13b36d5bd19bc652eae780f8733621c67fb3659017ce8"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:WB6WTXIKVEMUPYLD7BCBWP572G","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial collision attacks on image hashing functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CV","authors_text":"Brian Dolhansky, Cristian Canton Ferrer","submitted_at":"2020-11-18T18:59:02Z","abstract_excerpt":"Hashing images with a perceptual algorithm is a common approach to solving duplicate image detection problems. However, perceptual image hashing algorithms are differentiable, and are thus vulnerable to gradient-based adversarial attacks. We demonstrate that not only is it possible to modify an image to produce an unrelated hash, but an exact image hash collision between a source and target image can be produced via minuscule adversarial perturbations. In a white box setting, these collisions can be replicated across nearly every image pair and hash type (including both deep and non-learned ha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09473","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.09473/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T01:52:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JgksU9K1u9Y8VZuH7WhnW75+7rXCupNkkehWsZZLDpa8zq0hpF305yWvKXWyxDpDzf/STwWcm7A3K3GtSch1AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T18:54:41.438203Z"},"content_sha256":"f95906800e0b6a9b772dcb41f48efa2aadd16029276228ede21da63035f3de5a","schema_version":"1.0","event_id":"sha256:f95906800e0b6a9b772dcb41f48efa2aadd16029276228ede21da63035f3de5a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WB6WTXIKVEMUPYLD7BCBWP572G/bundle.json","state_url":"https://pith.science/pith/WB6WTXIKVEMUPYLD7BCBWP572G/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WB6WTXIKVEMUPYLD7BCBWP572G/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-08-16T18:54:41Z","links":{"resolver":"https://pith.science/pith/WB6WTXIKVEMUPYLD7BCBWP572G","bundle":"https://pith.science/pith/WB6WTXIKVEMUPYLD7BCBWP572G/bundle.json","state":"https://pith.science/pith/WB6WTXIKVEMUPYLD7BCBWP572G/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WB6WTXIKVEMUPYLD7BCBWP572G/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:WB6WTXIKVEMUPYLD7BCBWP572G","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":"e4bb8fade935668f0b12f8210259028ebac4aecba2bf49fcc76d9cf1c7ba12b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-18T18:59:02Z","title_canon_sha256":"07aa299fde386fd981e2fb17ff16bcd6ed9d27244ac695cce54fb9c23873fbec"},"schema_version":"1.0","source":{"id":"2011.09473","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2011.09473","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"arxiv_version","alias_value":"2011.09473v1","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.09473","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"pith_short_12","alias_value":"WB6WTXIKVEMU","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"pith_short_16","alias_value":"WB6WTXIKVEMUPYLD","created_at":"2026-07-05T01:52:44Z"},{"alias_kind":"pith_short_8","alias_value":"WB6WTXIK","created_at":"2026-07-05T01:52:44Z"}],"graph_snapshots":[{"event_id":"sha256:f95906800e0b6a9b772dcb41f48efa2aadd16029276228ede21da63035f3de5a","target":"graph","created_at":"2026-07-05T01:52:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2011.09473/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Hashing images with a perceptual algorithm is a common approach to solving duplicate image detection problems. However, perceptual image hashing algorithms are differentiable, and are thus vulnerable to gradient-based adversarial attacks. We demonstrate that not only is it possible to modify an image to produce an unrelated hash, but an exact image hash collision between a source and target image can be produced via minuscule adversarial perturbations. In a white box setting, these collisions can be replicated across nearly every image pair and hash type (including both deep and non-learned ha","authors_text":"Brian Dolhansky, Cristian Canton Ferrer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-18T18:59:02Z","title":"Adversarial collision attacks on image hashing functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.09473","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:27bca7359e66e1d2e6f13b36d5bd19bc652eae780f8733621c67fb3659017ce8","target":"record","created_at":"2026-07-05T01:52:44Z","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":"e4bb8fade935668f0b12f8210259028ebac4aecba2bf49fcc76d9cf1c7ba12b5","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CV","submitted_at":"2020-11-18T18:59:02Z","title_canon_sha256":"07aa299fde386fd981e2fb17ff16bcd6ed9d27244ac695cce54fb9c23873fbec"},"schema_version":"1.0","source":{"id":"2011.09473","kind":"arxiv","version":1}},"canonical_sha256":"b07d69dd0aa91947e163f8441b3fbfd1a7c346d04bbfb765ea08acc2d93980e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b07d69dd0aa91947e163f8441b3fbfd1a7c346d04bbfb765ea08acc2d93980e3","first_computed_at":"2026-07-05T01:52:44.216671Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:52:44.216671Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"DzuX2oKn7De6Khl8CmrAt64KZ6DxSadLiWTw06qAIcsem/BQQlM7HmlfBG/0HNwPOybdyzBXP8q8rOQIabW0Ag==","signature_status":"signed_v1","signed_at":"2026-07-05T01:52:44.217054Z","signed_message":"canonical_sha256_bytes"},"source_id":"2011.09473","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27bca7359e66e1d2e6f13b36d5bd19bc652eae780f8733621c67fb3659017ce8","sha256:f95906800e0b6a9b772dcb41f48efa2aadd16029276228ede21da63035f3de5a"],"state_sha256":"b8cfc9f05d9f17436a2521e225770a8da0f38abaa25b02f112ba60b763742ce6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3hB6MVmM5YJoheqXG8H1ms6kwD4t9ON8glId6jwYvj6RAJ5gjsIT9iKIydiHTEKwsPmv/6sAYw98llx+0FkUAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T18:54:41.443123Z","bundle_sha256":"a559d1c4e6047a8802fc6518e93b86c544c8d8867a8097705f2beaacbd432489"}}