{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7MT2BXGV5R6VWDNYW5C33GNYNL","short_pith_number":"pith:7MT2BXGV","canonical_record":{"source":{"id":"2605.14495","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MM","submitted_at":"2026-05-14T07:34:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4506b6d2d3eaf0b6aef4eae05be27d610c488e9a5cef78ae13349bfb9092b31e","abstract_canon_sha256":"06d1312ebdbba9e779fe17acaa5c9452091b7068e3a2456323d3e5ab69707a62"},"schema_version":"1.0"},"canonical_sha256":"fb27a0dcd5ec7d5b0db8b745bd99b86ae8846b30b794d1a790c82bb2f7b71aef","source":{"kind":"arxiv","id":"2605.14495","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14495","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14495v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14495","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"7MT2BXGV5R6V","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7MT2BXGV5R6VWDNY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7MT2BXGV","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7MT2BXGV5R6VWDNYW5C33GNYNL","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14495","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MM","submitted_at":"2026-05-14T07:34:18Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"4506b6d2d3eaf0b6aef4eae05be27d610c488e9a5cef78ae13349bfb9092b31e","abstract_canon_sha256":"06d1312ebdbba9e779fe17acaa5c9452091b7068e3a2456323d3e5ab69707a62"},"schema_version":"1.0"},"canonical_sha256":"fb27a0dcd5ec7d5b0db8b745bd99b86ae8846b30b794d1a790c82bb2f7b71aef","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:06.385572Z","signature_b64":"mSDFwR0aHAPfg1FPdlpaoK4MLiNmm+QDsJoCJNpdNqXH/+kcoHqyyh2iEErkfNzy5XYAGZxof65UCUrTzccsDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fb27a0dcd5ec7d5b0db8b745bd99b86ae8846b30b794d1a790c82bb2f7b71aef","last_reissued_at":"2026-05-17T23:39:06.384896Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:06.384896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14495","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-17T23:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3gKPocwkG6wtMevxIx+YXj+wNSiucEjex83GG1FQ/jONXUph9qkRT4/B8nCYTHtZhBoNOPzCYrZXDUI9EIF+DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:43:06.398254Z"},"content_sha256":"d510dd1f0ac0619d92778d6dda9e10b7e1f806acae7356b0ff41cef5a8d31b26","schema_version":"1.0","event_id":"sha256:d510dd1f0ac0619d92778d6dda9e10b7e1f806acae7356b0ff41cef5a8d31b26"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7MT2BXGV5R6VWDNYW5C33GNYNL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Contestable Multi-Agent Debate with Arena-based Argumentative Computation for Multimedia Verification","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"A multi-agent system turns retrieved evidence into scored support and attack arguments that resolve in local graphs to produce transparent editable verification reports for multimedia claims.","cross_cats":["cs.AI"],"primary_cat":"cs.MM","authors_text":"Hoang-Loc Cao, Hung Cao, Phuc Ho, Truong Thanh Hung Nguyen, Van Pham, Vo Thanh Khang Nguyen","submitted_at":"2026-05-14T07:34:18Z","abstract_excerpt":"Multimedia verification requires not only accurate conclusions but also transparent and contestable reasoning. We propose a contestable multi-agent framework that integrates multimodal large language models, external verification tools, and arena-based quantitative bipolar argumentation (A-QBAF) as a submission to the ICMR 2026 Grand Challenge on Multimedia Verification. Our method decomposes each case into claim-centered sections, retrieves targeted evidence, and converts evidence into structured support and attack arguments with provenance and strength scores. These arguments are resolved th"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our method decomposes each case into claim-centered sections, retrieves targeted evidence, and converts evidence into structured support and attack arguments with provenance and strength scores. These arguments are resolved through small local argument graphs with selective clash resolution and uncertainty-aware escalation. The resulting system generates section-wise verification reports that are transparent, editable, and computationally practical for real-world multimedia verification.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That multimodal large language models combined with arena-based quantitative bipolar argumentation can reliably convert retrieved evidence into accurate support and attack arguments whose resolution produces correct verification outcomes without introducing systematic bias or error.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A contestable multi-agent debate system using arena-based quantitative bipolar argumentation generates transparent, editable verification reports for multimedia content.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A multi-agent system turns retrieved evidence into scored support and attack arguments that resolve in local graphs to produce transparent editable verification reports for multimedia claims.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"04b271b2ab04ee130246859ab34e19bf9850d1c46fa2779d9427c5b50f4a148c"},"source":{"id":"2605.14495","kind":"arxiv","version":1},"verdict":{"id":"bf624a4d-1b6c-4465-b1c4-fe1d9a140130","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:21:25.048535Z","strongest_claim":"Our method decomposes each case into claim-centered sections, retrieves targeted evidence, and converts evidence into structured support and attack arguments with provenance and strength scores. These arguments are resolved through small local argument graphs with selective clash resolution and uncertainty-aware escalation. The resulting system generates section-wise verification reports that are transparent, editable, and computationally practical for real-world multimedia verification.","one_line_summary":"A contestable multi-agent debate system using arena-based quantitative bipolar argumentation generates transparent, editable verification reports for multimedia content.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That multimodal large language models combined with arena-based quantitative bipolar argumentation can reliably convert retrieved evidence into accurate support and attack arguments whose resolution produces correct verification outcomes without introducing systematic bias or error.","pith_extraction_headline":"A multi-agent system turns retrieved evidence into scored support and attack arguments that resolve in local graphs to produce transparent editable verification reports for multimedia claims."},"references":{"count":30,"sample":[{"doi":"","year":2023,"title":"Kars Alfrink et al. 2023. Contestable AI by design: Towards a framework.Minds and Machines33, 4 (2023), 613–639","work_id":"3bc5cd27-dc9e-47ea-a3f9-e28e8d6d91c3","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Shivangi Aneja, Cise Midoglu, Duc-Tien Dang-Nguyen, Sohail Ahmed Khan, Michael Riegler, Pål Halvorsen, Chris Bregler, and Balu Adsumilli. 2022. Acm mul- timedia grand challenge on detecting cheapfakes","work_id":"553f22e7-bc68-493c-8856-b8ca1525a996","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"Hoang-Loc Cao, Phuc Ho, Truong Thanh Hung Nguyen, Phuc Truong Loc Nguyen, Dinh Thien Loc Nguyen, and Hung Cao. 2026. Adaptive Collaboration of Arena-Based Argumentative LLMs for Explainable and Contes","work_id":"edee9f09-8309-41c4-aadd-d3af64ac8fc3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2024,"title":"Duc-Tien Dang-Nguyen, Sohail Ahmed Khan, Michael Riegler, Pål Halvorsen, Anh-Duy Tran, Minh-Son Dao, and Minh-Triet Tran. 2024. Overview of the grand challenge on detecting cheapfakes at acm icmr 2024","work_id":"6198fb74-3f7e-42b1-b17c-4d7a5f40b1fa","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Duc-Tien Dang-Nguyen, Morten Langfeldt Dahlback, Henrik Vold, Silje Førsund, Minh-Son Dao, Kha-Luan Pham, Sohail Ahmed Khan, Marc Gallofré Ocaña, Minh-Triet Tran, and Anh-Duy Tran. 2025. The 2025 Gran","work_id":"53028117-46df-46c7-9e1b-035280e6446b","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":30,"snapshot_sha256":"8f480c0451124bd76126781b5b9ee14f3df1883fbd4225fb51119a8c970a0218","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":"bf624a4d-1b6c-4465-b1c4-fe1d9a140130"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tMxGN75tmjt9S8mHcbvIC0a87MpM7YNhs4q90ZSsg/Z0BXwYLpCx/YBvQ3DGbgacBa0anpGXXL6OCFxh3Y7vBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T19:43:06.399004Z"},"content_sha256":"53ca75e13486f81df9cd653f6742c7a7d5cb2812f94c48544ed1d19658faa5c5","schema_version":"1.0","event_id":"sha256:53ca75e13486f81df9cd653f6742c7a7d5cb2812f94c48544ed1d19658faa5c5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7MT2BXGV5R6VWDNYW5C33GNYNL/bundle.json","state_url":"https://pith.science/pith/7MT2BXGV5R6VWDNYW5C33GNYNL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7MT2BXGV5R6VWDNYW5C33GNYNL/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-06T19:43:06Z","links":{"resolver":"https://pith.science/pith/7MT2BXGV5R6VWDNYW5C33GNYNL","bundle":"https://pith.science/pith/7MT2BXGV5R6VWDNYW5C33GNYNL/bundle.json","state":"https://pith.science/pith/7MT2BXGV5R6VWDNYW5C33GNYNL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7MT2BXGV5R6VWDNYW5C33GNYNL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7MT2BXGV5R6VWDNYW5C33GNYNL","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":"06d1312ebdbba9e779fe17acaa5c9452091b7068e3a2456323d3e5ab69707a62","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MM","submitted_at":"2026-05-14T07:34:18Z","title_canon_sha256":"4506b6d2d3eaf0b6aef4eae05be27d610c488e9a5cef78ae13349bfb9092b31e"},"schema_version":"1.0","source":{"id":"2605.14495","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14495","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14495v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14495","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"7MT2BXGV5R6V","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"7MT2BXGV5R6VWDNY","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"7MT2BXGV","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:53ca75e13486f81df9cd653f6742c7a7d5cb2812f94c48544ed1d19658faa5c5","target":"graph","created_at":"2026-05-17T23:39:06Z","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":"Our method decomposes each case into claim-centered sections, retrieves targeted evidence, and converts evidence into structured support and attack arguments with provenance and strength scores. These arguments are resolved through small local argument graphs with selective clash resolution and uncertainty-aware escalation. The resulting system generates section-wise verification reports that are transparent, editable, and computationally practical for real-world multimedia verification."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That multimodal large language models combined with arena-based quantitative bipolar argumentation can reliably convert retrieved evidence into accurate support and attack arguments whose resolution produces correct verification outcomes without introducing systematic bias or error."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"A contestable multi-agent debate system using arena-based quantitative bipolar argumentation generates transparent, editable verification reports for multimedia content."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A multi-agent system turns retrieved evidence into scored support and attack arguments that resolve in local graphs to produce transparent editable verification reports for multimedia claims."}],"snapshot_sha256":"04b271b2ab04ee130246859ab34e19bf9850d1c46fa2779d9427c5b50f4a148c"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Multimedia verification requires not only accurate conclusions but also transparent and contestable reasoning. We propose a contestable multi-agent framework that integrates multimodal large language models, external verification tools, and arena-based quantitative bipolar argumentation (A-QBAF) as a submission to the ICMR 2026 Grand Challenge on Multimedia Verification. Our method decomposes each case into claim-centered sections, retrieves targeted evidence, and converts evidence into structured support and attack arguments with provenance and strength scores. These arguments are resolved th","authors_text":"Hoang-Loc Cao, Hung Cao, Phuc Ho, Truong Thanh Hung Nguyen, Van Pham, Vo Thanh Khang Nguyen","cross_cats":["cs.AI"],"headline":"A multi-agent system turns retrieved evidence into scored support and attack arguments that resolve in local graphs to produce transparent editable verification reports for multimedia claims.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MM","submitted_at":"2026-05-14T07:34:18Z","title":"Contestable Multi-Agent Debate with Arena-based Argumentative Computation for Multimedia Verification"},"references":{"count":30,"internal_anchors":0,"resolved_work":30,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Kars Alfrink et al. 2023. Contestable AI by design: Towards a framework.Minds and Machines33, 4 (2023), 613–639","work_id":"3bc5cd27-dc9e-47ea-a3f9-e28e8d6d91c3","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Shivangi Aneja, Cise Midoglu, Duc-Tien Dang-Nguyen, Sohail Ahmed Khan, Michael Riegler, Pål Halvorsen, Chris Bregler, and Balu Adsumilli. 2022. Acm mul- timedia grand challenge on detecting cheapfakes","work_id":"553f22e7-bc68-493c-8856-b8ca1525a996","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Hoang-Loc Cao, Phuc Ho, Truong Thanh Hung Nguyen, Phuc Truong Loc Nguyen, Dinh Thien Loc Nguyen, and Hung Cao. 2026. Adaptive Collaboration of Arena-Based Argumentative LLMs for Explainable and Contes","work_id":"edee9f09-8309-41c4-aadd-d3af64ac8fc3","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Duc-Tien Dang-Nguyen, Sohail Ahmed Khan, Michael Riegler, Pål Halvorsen, Anh-Duy Tran, Minh-Son Dao, and Minh-Triet Tran. 2024. Overview of the grand challenge on detecting cheapfakes at acm icmr 2024","work_id":"6198fb74-3f7e-42b1-b17c-4d7a5f40b1fa","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Duc-Tien Dang-Nguyen, Morten Langfeldt Dahlback, Henrik Vold, Silje Førsund, Minh-Son Dao, Kha-Luan Pham, Sohail Ahmed Khan, Marc Gallofré Ocaña, Minh-Triet Tran, and Anh-Duy Tran. 2025. The 2025 Gran","work_id":"53028117-46df-46c7-9e1b-035280e6446b","year":2025}],"snapshot_sha256":"8f480c0451124bd76126781b5b9ee14f3df1883fbd4225fb51119a8c970a0218"},"source":{"id":"2605.14495","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:21:25.048535Z","id":"bf624a4d-1b6c-4465-b1c4-fe1d9a140130","model_set":{"reader":"grok-4.3"},"one_line_summary":"A contestable multi-agent debate system using arena-based quantitative bipolar argumentation generates transparent, editable verification reports for multimedia content.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A multi-agent system turns retrieved evidence into scored support and attack arguments that resolve in local graphs to produce transparent editable verification reports for multimedia claims.","strongest_claim":"Our method decomposes each case into claim-centered sections, retrieves targeted evidence, and converts evidence into structured support and attack arguments with provenance and strength scores. These arguments are resolved through small local argument graphs with selective clash resolution and uncertainty-aware escalation. The resulting system generates section-wise verification reports that are transparent, editable, and computationally practical for real-world multimedia verification.","weakest_assumption":"That multimodal large language models combined with arena-based quantitative bipolar argumentation can reliably convert retrieved evidence into accurate support and attack arguments whose resolution produces correct verification outcomes without introducing systematic bias or error."}},"verdict_id":"bf624a4d-1b6c-4465-b1c4-fe1d9a140130"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d510dd1f0ac0619d92778d6dda9e10b7e1f806acae7356b0ff41cef5a8d31b26","target":"record","created_at":"2026-05-17T23:39:06Z","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":"06d1312ebdbba9e779fe17acaa5c9452091b7068e3a2456323d3e5ab69707a62","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"cs.MM","submitted_at":"2026-05-14T07:34:18Z","title_canon_sha256":"4506b6d2d3eaf0b6aef4eae05be27d610c488e9a5cef78ae13349bfb9092b31e"},"schema_version":"1.0","source":{"id":"2605.14495","kind":"arxiv","version":1}},"canonical_sha256":"fb27a0dcd5ec7d5b0db8b745bd99b86ae8846b30b794d1a790c82bb2f7b71aef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fb27a0dcd5ec7d5b0db8b745bd99b86ae8846b30b794d1a790c82bb2f7b71aef","first_computed_at":"2026-05-17T23:39:06.384896Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.384896Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mSDFwR0aHAPfg1FPdlpaoK4MLiNmm+QDsJoCJNpdNqXH/+kcoHqyyh2iEErkfNzy5XYAGZxof65UCUrTzccsDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.385572Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14495","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d510dd1f0ac0619d92778d6dda9e10b7e1f806acae7356b0ff41cef5a8d31b26","sha256:53ca75e13486f81df9cd653f6742c7a7d5cb2812f94c48544ed1d19658faa5c5"],"state_sha256":"9c363246f00b1dc0977375e4317ee3c854be0f904bc5321e0af27f544039506c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iS/DQMu0N48OLQWt0zgZsHdxoIq/kNL3ZIPK/tlA/VN0yBWKeP1PgL/Xsb40E/MxCV18APNquAnrYrVMy27bDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T19:43:06.402138Z","bundle_sha256":"356a58c87456a35fb3a03865fa00bf26ee0de12cff9715296019c556094660f1"}}