{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:E5AEMJFC33MZI6E5M7LYBWMMLC","short_pith_number":"pith:E5AEMJFC","canonical_record":{"source":{"id":"2605.16796","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T03:57:37Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"72bfd26f947136cc241a909ab3fa2610a49d33c7b13a7e542748fda8b9375693","abstract_canon_sha256":"84d3deab44523b9517a30db0b3de5414ff801bd540daf3769c7f2d7b7f92ae72"},"schema_version":"1.0"},"canonical_sha256":"27404624a2ded994789d67d780d98c58aaf2d326673a15b760734a44714d476b","source":{"kind":"arxiv","id":"2605.16796","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16796","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16796v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16796","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"E5AEMJFC33MZ","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"E5AEMJFC33MZI6E5","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"E5AEMJFC","created_at":"2026-05-20T00:03:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:E5AEMJFC33MZI6E5M7LYBWMMLC","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16796","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T03:57:37Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"72bfd26f947136cc241a909ab3fa2610a49d33c7b13a7e542748fda8b9375693","abstract_canon_sha256":"84d3deab44523b9517a30db0b3de5414ff801bd540daf3769c7f2d7b7f92ae72"},"schema_version":"1.0"},"canonical_sha256":"27404624a2ded994789d67d780d98c58aaf2d326673a15b760734a44714d476b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:22.542817Z","signature_b64":"bQ0O3rZU7TRX9lSOh25uwKSm0cm0HmPDDDy+wvI5duOMyA14SYA7U/4j/8QuGVqMWADlJUP4n8/PgnPThhw2DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"27404624a2ded994789d67d780d98c58aaf2d326673a15b760734a44714d476b","last_reissued_at":"2026-05-20T00:03:22.541875Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:22.541875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16796","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-20T00:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4XTf9gQqdQKNxzPYz0yZQ1DMlVlQ+Xli9qGQO4QWiu7mCPKmeOn6CD52hW8GxBSgLf1THj0XV3tAL/9j4FLQDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:00:18.268467Z"},"content_sha256":"9832f8a197698a48a21942341e1889f2baae96d86a0a7ff997dfecdc0add7d7f","schema_version":"1.0","event_id":"sha256:9832f8a197698a48a21942341e1889f2baae96d86a0a7ff997dfecdc0add7d7f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:E5AEMJFC33MZI6E5M7LYBWMMLC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Watermarks Attack Watermarks: Re-Watermarking as a Generic Removal Strategy","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Re-watermarking an already watermarked image reliably suppresses the original signal.","cross_cats":["cs.CV"],"primary_cat":"cs.CR","authors_text":"Benjamin I. P. Rubinstein, Maria Bulychev, Neil G. Marchant","submitted_at":"2026-05-16T03:57:37Z","abstract_excerpt":"Watermarking combines an imperceptible change to an input image that will trigger a detector, to assert provenance and protect intellectual property. The literature has shown great interest in attacks on watermarking schemes: attackers are clearly motivated to steal copyrighted material or circumvent legislated deepfake protections. In this work, we make a simple-yet-powerful observation: that such attacks on watermarking-like watermarks themselves-seek an imperceptible change to an input image (now already watermarked) that will trigger a detector. This analogy comparing watermark attacks to "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"simply re-watermarking an already watermarked image reliably suppresses the original signal, without requiring gradients, surrogate models, or detection keys","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The core analogy holds that any imperceptible change intended to trigger a detector (including a new watermark) will interfere with an existing watermark's detection, independent of the specific schemes used.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Re-watermarking reliably removes existing watermarks across 96 dataset-victim-attack combinations and pairs with a classifier achieving 0.878-0.953 accuracy, cutting bit accuracy by 25-48%.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Re-watermarking an already watermarked image reliably suppresses the original signal.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"0fd627de0ad6fc6305b216506ec9190fe9c3f4d1404800e2e31bc34ee3bd60a5"},"source":{"id":"2605.16796","kind":"arxiv","version":1},"verdict":{"id":"a60b814e-72e4-40d0-bd2d-8b90bd355547","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T21:17:01.144463Z","strongest_claim":"simply re-watermarking an already watermarked image reliably suppresses the original signal, without requiring gradients, surrogate models, or detection keys","one_line_summary":"Re-watermarking reliably removes existing watermarks across 96 dataset-victim-attack combinations and pairs with a classifier achieving 0.878-0.953 accuracy, cutting bit accuracy by 25-48%.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The core analogy holds that any imperceptible change intended to trigger a detector (including a new watermark) will interfere with an existing watermark's detection, independent of the specific schemes used.","pith_extraction_headline":"Re-watermarking an already watermarked image reliably suppresses the original signal."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16796/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.309845Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T21:31:00.400796Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.290911Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.427065Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"7cdb3d8a5e3b6d77019fb8087bdea43242fcb1996077f700749581d77f515119"},"references":{"count":55,"sample":[{"doi":"","year":2024,"title":"B. An, M. Ding, T. Rabbani, A. Agrawal, Y . Xu, C. Deng, S. Zhu, A. Mohamed, Y . Wen, T. Goldstein, and F. Huang. W A VES: Benchmarking the robustness of image watermarks. InForty-first International ","work_id":"e9e8125a-322d-4087-89f3-77606733c9a5","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"J. Ballé, D. Minnen, S. Singh, S. J. Hwang, and N. Johnston. Variational image compression with a scale hyperprior. InInternational Conference on Learning Representations, 2018","work_id":"89675e3d-e4a4-4364-b33a-64aa796801b0","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Flux.2: Next generation image generation","work_id":"cc531e14-6531-4795-9adf-233a243770e2","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"T. Bui, S. Agarwal, and J. Collomosse. TrustMark: Robust watermarking and watermark removal for arbitrary resolution images. InProceedings of the IEEE/CVF International Conference on Computer Vision (","work_id":"dcb563d2-6d1b-4bee-8496-2a94bb3151bb","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"T. Bui, S. Agarwal, N. Yu, and J. Collomosse. RoSteALS: Robust steganography using autoencoder latent space. In2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), pa","work_id":"f1e171d1-6f22-411a-b183-607793eb93ed","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":55,"snapshot_sha256":"1c3fda3fd983c7bb06bed46aaa2e6164cc3b0723c807286a0524be1967c00b36","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"79c742162cdb7608d48d31c287c7241a79641d89970ac9ad1a767dee740947d6"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a60b814e-72e4-40d0-bd2d-8b90bd355547"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:03:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OmjEuK9G0xblkmdTG4RGwzptGR6tFEQjRaZgqSnDSWxlrq+zdWXTLIAys9jxZCaQdXVkuOK30uhe1/hypkhzAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T23:00:18.269845Z"},"content_sha256":"97a993c6c1beae4b592cb6c34f3851eb8b0cca50dfac2c8ae8f4202e6da70a85","schema_version":"1.0","event_id":"sha256:97a993c6c1beae4b592cb6c34f3851eb8b0cca50dfac2c8ae8f4202e6da70a85"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E5AEMJFC33MZI6E5M7LYBWMMLC/bundle.json","state_url":"https://pith.science/pith/E5AEMJFC33MZI6E5M7LYBWMMLC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E5AEMJFC33MZI6E5M7LYBWMMLC/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-05T23:00:18Z","links":{"resolver":"https://pith.science/pith/E5AEMJFC33MZI6E5M7LYBWMMLC","bundle":"https://pith.science/pith/E5AEMJFC33MZI6E5M7LYBWMMLC/bundle.json","state":"https://pith.science/pith/E5AEMJFC33MZI6E5M7LYBWMMLC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E5AEMJFC33MZI6E5M7LYBWMMLC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:E5AEMJFC33MZI6E5M7LYBWMMLC","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":"84d3deab44523b9517a30db0b3de5414ff801bd540daf3769c7f2d7b7f92ae72","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T03:57:37Z","title_canon_sha256":"72bfd26f947136cc241a909ab3fa2610a49d33c7b13a7e542748fda8b9375693"},"schema_version":"1.0","source":{"id":"2605.16796","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16796","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16796v1","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16796","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_12","alias_value":"E5AEMJFC33MZ","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_16","alias_value":"E5AEMJFC33MZI6E5","created_at":"2026-05-20T00:03:22Z"},{"alias_kind":"pith_short_8","alias_value":"E5AEMJFC","created_at":"2026-05-20T00:03:22Z"}],"graph_snapshots":[{"event_id":"sha256:97a993c6c1beae4b592cb6c34f3851eb8b0cca50dfac2c8ae8f4202e6da70a85","target":"graph","created_at":"2026-05-20T00:03:22Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"simply re-watermarking an already watermarked image reliably suppresses the original signal, without requiring gradients, surrogate models, or detection keys"},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The core analogy holds that any imperceptible change intended to trigger a detector (including a new watermark) will interfere with an existing watermark's detection, independent of the specific schemes used."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Re-watermarking reliably removes existing watermarks across 96 dataset-victim-attack combinations and pairs with a classifier achieving 0.878-0.953 accuracy, cutting bit accuracy by 25-48%."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Re-watermarking an already watermarked image reliably suppresses the original signal."}],"snapshot_sha256":"0fd627de0ad6fc6305b216506ec9190fe9c3f4d1404800e2e31bc34ee3bd60a5"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"79c742162cdb7608d48d31c287c7241a79641d89970ac9ad1a767dee740947d6"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:31:19.309845Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:31:00.400796Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.290911Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.427065Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16796/integrity.json","findings":[],"snapshot_sha256":"7cdb3d8a5e3b6d77019fb8087bdea43242fcb1996077f700749581d77f515119","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Watermarking combines an imperceptible change to an input image that will trigger a detector, to assert provenance and protect intellectual property. The literature has shown great interest in attacks on watermarking schemes: attackers are clearly motivated to steal copyrighted material or circumvent legislated deepfake protections. In this work, we make a simple-yet-powerful observation: that such attacks on watermarking-like watermarks themselves-seek an imperceptible change to an input image (now already watermarked) that will trigger a detector. This analogy comparing watermark attacks to ","authors_text":"Benjamin I. P. Rubinstein, Maria Bulychev, Neil G. Marchant","cross_cats":["cs.CV"],"headline":"Re-watermarking an already watermarked image reliably suppresses the original signal.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T03:57:37Z","title":"Watermarks Attack Watermarks: Re-Watermarking as a Generic Removal Strategy"},"references":{"count":55,"internal_anchors":0,"resolved_work":55,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"B. An, M. Ding, T. Rabbani, A. Agrawal, Y . Xu, C. Deng, S. Zhu, A. Mohamed, Y . Wen, T. Goldstein, and F. Huang. W A VES: Benchmarking the robustness of image watermarks. InForty-first International ","work_id":"e9e8125a-322d-4087-89f3-77606733c9a5","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"J. Ballé, D. Minnen, S. Singh, S. J. Hwang, and N. Johnston. Variational image compression with a scale hyperprior. InInternational Conference on Learning Representations, 2018","work_id":"89675e3d-e4a4-4364-b33a-64aa796801b0","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Flux.2: Next generation image generation","work_id":"cc531e14-6531-4795-9adf-233a243770e2","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"T. Bui, S. Agarwal, and J. Collomosse. TrustMark: Robust watermarking and watermark removal for arbitrary resolution images. InProceedings of the IEEE/CVF International Conference on Computer Vision (","work_id":"dcb563d2-6d1b-4bee-8496-2a94bb3151bb","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"T. Bui, S. Agarwal, N. Yu, and J. Collomosse. RoSteALS: Robust steganography using autoencoder latent space. In2023 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops (CVPRW), pa","work_id":"f1e171d1-6f22-411a-b183-607793eb93ed","year":2023}],"snapshot_sha256":"1c3fda3fd983c7bb06bed46aaa2e6164cc3b0723c807286a0524be1967c00b36"},"source":{"id":"2605.16796","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T21:17:01.144463Z","id":"a60b814e-72e4-40d0-bd2d-8b90bd355547","model_set":{"reader":"grok-4.3"},"one_line_summary":"Re-watermarking reliably removes existing watermarks across 96 dataset-victim-attack combinations and pairs with a classifier achieving 0.878-0.953 accuracy, cutting bit accuracy by 25-48%.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Re-watermarking an already watermarked image reliably suppresses the original signal.","strongest_claim":"simply re-watermarking an already watermarked image reliably suppresses the original signal, without requiring gradients, surrogate models, or detection keys","weakest_assumption":"The core analogy holds that any imperceptible change intended to trigger a detector (including a new watermark) will interfere with an existing watermark's detection, independent of the specific schemes used."}},"verdict_id":"a60b814e-72e4-40d0-bd2d-8b90bd355547"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9832f8a197698a48a21942341e1889f2baae96d86a0a7ff997dfecdc0add7d7f","target":"record","created_at":"2026-05-20T00:03:22Z","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":"84d3deab44523b9517a30db0b3de5414ff801bd540daf3769c7f2d7b7f92ae72","cross_cats_sorted":["cs.CV"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2026-05-16T03:57:37Z","title_canon_sha256":"72bfd26f947136cc241a909ab3fa2610a49d33c7b13a7e542748fda8b9375693"},"schema_version":"1.0","source":{"id":"2605.16796","kind":"arxiv","version":1}},"canonical_sha256":"27404624a2ded994789d67d780d98c58aaf2d326673a15b760734a44714d476b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"27404624a2ded994789d67d780d98c58aaf2d326673a15b760734a44714d476b","first_computed_at":"2026-05-20T00:03:22.541875Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:22.541875Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bQ0O3rZU7TRX9lSOh25uwKSm0cm0HmPDDDy+wvI5duOMyA14SYA7U/4j/8QuGVqMWADlJUP4n8/PgnPThhw2DQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:22.542817Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16796","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9832f8a197698a48a21942341e1889f2baae96d86a0a7ff997dfecdc0add7d7f","sha256:97a993c6c1beae4b592cb6c34f3851eb8b0cca50dfac2c8ae8f4202e6da70a85"],"state_sha256":"a6d1926f7845e076167194fd3d824a73b5f4426d2b725ea751c6df6e824ee655"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJayymy+gV4iga+6K2lMllvQWTLUclEGipZ1rGoSvelwzotS0PY6lbed/mEgzuBqmymHT9Bwwin1YciYOhLjBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T23:00:18.275288Z","bundle_sha256":"7279f75b0406110d610ca704a8ba09364f750b8153e5ecd434475f97bbf58fbe"}}