{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:Q4G7JXVKMLGOWOMZSKS3EWP7HR","short_pith_number":"pith:Q4G7JXVK","canonical_record":{"source":{"id":"2602.14674","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-02-16T12:01:58Z","cross_cats_sorted":[],"title_canon_sha256":"c1b78d30ce12a077d436e1537b158b63f7aec50ca5576278a926a352d9824099","abstract_canon_sha256":"63ad65c8d866c1adf08998942c6fee7387ac21c1c4a06053185734665db7f0ae"},"schema_version":"1.0"},"canonical_sha256":"870df4deaa62cceb399992a5b259ff3c6e7f257602fbe234790e49f7e87b22b9","source":{"kind":"arxiv","id":"2602.14674","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.14674","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"2602.14674v4","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14674","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q4G7JXVKMLGO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4G7JXVKMLGOWOMZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4G7JXVK","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:Q4G7JXVKMLGOWOMZSKS3EWP7HR","target":"record","payload":{"canonical_record":{"source":{"id":"2602.14674","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-02-16T12:01:58Z","cross_cats_sorted":[],"title_canon_sha256":"c1b78d30ce12a077d436e1537b158b63f7aec50ca5576278a926a352d9824099","abstract_canon_sha256":"63ad65c8d866c1adf08998942c6fee7387ac21c1c4a06053185734665db7f0ae"},"schema_version":"1.0"},"canonical_sha256":"870df4deaa62cceb399992a5b259ff3c6e7f257602fbe234790e49f7e87b22b9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:59.938446Z","signature_b64":"e7oTXYeE86cDY7AZvRuVxZcAIGv7r79haOd8gqIz7Hlvx986QYCub/0ji3xr+nt7hZwx+TD+setJ4+3Q8XYdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"870df4deaa62cceb399992a5b259ff3c6e7f257602fbe234790e49f7e87b22b9","last_reissued_at":"2026-05-17T23:38:59.937866Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:59.937866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.14674","source_version":4,"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:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"L9xvGioxgKk4hHajTB8/ZSz0f9fMgQJtm2okCjoyE3gdJmGDUYKm6LtQqmjh8znYfRslKMJjPXMU2zGtZOTfBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:57:13.737360Z"},"content_sha256":"c82f33d463ac11efc5e032939f0b04219f50680af03dcddef8a83effc8055494","schema_version":"1.0","event_id":"sha256:c82f33d463ac11efc5e032939f0b04219f50680af03dcddef8a83effc8055494"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:Q4G7JXVKMLGOWOMZSKS3EWP7HR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"From User Preferences to Base Score Extraction Functions in Gradual Argumentation (with Appendix)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Base Score Extraction Functions convert user preferences over arguments into numerical base scores for quantitative gradual argumentation.","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Aniol Civit, Antonio Andriella, Antonio Rago, Francesca Toni, Guillem Aleny\\`a","submitted_at":"2026-02-16T12:01:58Z","abstract_excerpt":"Gradual argumentation is a field of symbolic AI which is attracting attention for its ability to support transparent and contestable AI systems. It is considered a useful tool in domains such as decision-making, recommendation, debate analysis, and others. The outcomes in such domains are usually dependent on the arguments' base scores, which must be selected carefully. Often, this selection process requires user expertise and may not always be straightforward. On the other hand, organising the arguments by preference could simplify the task. In this work, we introduce \\emph{Base Score Extract"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We introduce Base Score Extraction Functions, which provide a mapping from users' preferences over arguments to base scores. These functions can be applied to the arguments of a Bipolar Argumentation Framework (BAF), supplemented with preferences, to obtain a Quantitative Bipolar Argumentation Framework (QBAF).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That user preferences over arguments can be reliably captured by the proposed extraction functions, including their approximation of non-linearities, and that the resulting base scores produce meaningful and stable outcomes under standard gradual semantics.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Base Score Extraction Functions convert user preferences into base scores for Bipolar Argumentation Frameworks, producing Quantitative Bipolar Argumentation Frameworks usable with existing gradual semantics tools, including an algorithm and robotics evaluation.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Base Score Extraction Functions convert user preferences over arguments into numerical base scores for quantitative gradual argumentation.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"597d63606969536128afd8ce9268693cc71f84b7b7d4c0c83a586a70d9304b66"},"source":{"id":"2602.14674","kind":"arxiv","version":4},"verdict":{"id":"5ffa55ea-8ec1-4dfb-bf3c-1483f12eef51","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T21:53:03.894091Z","strongest_claim":"We introduce Base Score Extraction Functions, which provide a mapping from users' preferences over arguments to base scores. These functions can be applied to the arguments of a Bipolar Argumentation Framework (BAF), supplemented with preferences, to obtain a Quantitative Bipolar Argumentation Framework (QBAF).","one_line_summary":"Base Score Extraction Functions convert user preferences into base scores for Bipolar Argumentation Frameworks, producing Quantitative Bipolar Argumentation Frameworks usable with existing gradual semantics tools, including an algorithm and robotics evaluation.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That user preferences over arguments can be reliably captured by the proposed extraction functions, including their approximation of non-linearities, and that the resulting base scores produce meaningful and stable outcomes under standard gradual semantics.","pith_extraction_headline":"Base Score Extraction Functions convert user preferences over arguments into numerical base scores for quantitative gradual argumentation."},"references":{"count":44,"sample":[{"doi":"","year":2020,"title":"Emanuele Albini, Piyawat Lertvittayakumjorn, Antonio Rago, and Francesca Toni. 2020. Deep argumentative explanations.arXiv preprint arXiv:2012.05766 (2020)","work_id":"1ea633b1-91d6-4624-a655-9da5f4de32b2","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2009,"title":"Leila Amgoud. 2009. Argumentation for decision making. InArgumentation in artificial intelligence. Springer, 301–320","work_id":"97f7e3b1-dbcf-4145-8f14-d6fbcc462b3d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Leila Amgoud and Jonathan Ben-Naim. 2018. Evaluation of arguments in weighted bipolar graphs.International Journal of Approximate Reasoning(2018), 39–55","work_id":"ea1fa924-4a8d-49a2-a5d0-3ca7a964f8e8","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2016,"title":"Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, and Srdjan Vesic. 2016. Rank- ing arguments with compensation-based semantics. In15th International Confer- ence on Principles of Knowledge Representatio","work_id":"7c4632e7-72fb-480c-b075-0836e46c8358","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1998,"title":"Leila Amgoud and Claudette Cayrol. 1998. On the acceptability of arguments in preference-based argumentation. InProceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence. 1–7","work_id":"98dcf9c1-996c-40a0-a183-cd00bd26711c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":44,"snapshot_sha256":"6bd4abb6d48bcc4b4da14ad64b199f705b87c5e70dabcadde6cc17274b7fc5ea","internal_anchors":2},"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":"5ffa55ea-8ec1-4dfb-bf3c-1483f12eef51"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rtvl6JCQbg32VWpgTC4mHL4Jj0pYq9NMTNxvcNr7OSHvGHdvJ6Z1W+ItOnTMkLz19ueS+DxLiytdUHpIQBQIDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T22:57:13.738000Z"},"content_sha256":"fd047710b6d8403f3e9d2c84483cf75c5632c5bbb1e720767b43cf9216d319a7","schema_version":"1.0","event_id":"sha256:fd047710b6d8403f3e9d2c84483cf75c5632c5bbb1e720767b43cf9216d319a7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/Q4G7JXVKMLGOWOMZSKS3EWP7HR/bundle.json","state_url":"https://pith.science/pith/Q4G7JXVKMLGOWOMZSKS3EWP7HR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/Q4G7JXVKMLGOWOMZSKS3EWP7HR/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-03T22:57:13Z","links":{"resolver":"https://pith.science/pith/Q4G7JXVKMLGOWOMZSKS3EWP7HR","bundle":"https://pith.science/pith/Q4G7JXVKMLGOWOMZSKS3EWP7HR/bundle.json","state":"https://pith.science/pith/Q4G7JXVKMLGOWOMZSKS3EWP7HR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/Q4G7JXVKMLGOWOMZSKS3EWP7HR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:Q4G7JXVKMLGOWOMZSKS3EWP7HR","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":"63ad65c8d866c1adf08998942c6fee7387ac21c1c4a06053185734665db7f0ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-02-16T12:01:58Z","title_canon_sha256":"c1b78d30ce12a077d436e1537b158b63f7aec50ca5576278a926a352d9824099"},"schema_version":"1.0","source":{"id":"2602.14674","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.14674","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"arxiv_version","alias_value":"2602.14674v4","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.14674","created_at":"2026-05-17T23:38:59Z"},{"alias_kind":"pith_short_12","alias_value":"Q4G7JXVKMLGO","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"Q4G7JXVKMLGOWOMZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"Q4G7JXVK","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:fd047710b6d8403f3e9d2c84483cf75c5632c5bbb1e720767b43cf9216d319a7","target":"graph","created_at":"2026-05-17T23:38:59Z","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":"We introduce Base Score Extraction Functions, which provide a mapping from users' preferences over arguments to base scores. These functions can be applied to the arguments of a Bipolar Argumentation Framework (BAF), supplemented with preferences, to obtain a Quantitative Bipolar Argumentation Framework (QBAF)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That user preferences over arguments can be reliably captured by the proposed extraction functions, including their approximation of non-linearities, and that the resulting base scores produce meaningful and stable outcomes under standard gradual semantics."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Base Score Extraction Functions convert user preferences into base scores for Bipolar Argumentation Frameworks, producing Quantitative Bipolar Argumentation Frameworks usable with existing gradual semantics tools, including an algorithm and robotics evaluation."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Base Score Extraction Functions convert user preferences over arguments into numerical base scores for quantitative gradual argumentation."}],"snapshot_sha256":"597d63606969536128afd8ce9268693cc71f84b7b7d4c0c83a586a70d9304b66"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Gradual argumentation is a field of symbolic AI which is attracting attention for its ability to support transparent and contestable AI systems. It is considered a useful tool in domains such as decision-making, recommendation, debate analysis, and others. The outcomes in such domains are usually dependent on the arguments' base scores, which must be selected carefully. Often, this selection process requires user expertise and may not always be straightforward. On the other hand, organising the arguments by preference could simplify the task. In this work, we introduce \\emph{Base Score Extract","authors_text":"Aniol Civit, Antonio Andriella, Antonio Rago, Francesca Toni, Guillem Aleny\\`a","cross_cats":[],"headline":"Base Score Extraction Functions convert user preferences over arguments into numerical base scores for quantitative gradual argumentation.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-02-16T12:01:58Z","title":"From User Preferences to Base Score Extraction Functions in Gradual Argumentation (with Appendix)"},"references":{"count":44,"internal_anchors":2,"resolved_work":44,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Emanuele Albini, Piyawat Lertvittayakumjorn, Antonio Rago, and Francesca Toni. 2020. Deep argumentative explanations.arXiv preprint arXiv:2012.05766 (2020)","work_id":"1ea633b1-91d6-4624-a655-9da5f4de32b2","year":2020},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Leila Amgoud. 2009. Argumentation for decision making. InArgumentation in artificial intelligence. Springer, 301–320","work_id":"97f7e3b1-dbcf-4145-8f14-d6fbcc462b3d","year":2009},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Leila Amgoud and Jonathan Ben-Naim. 2018. Evaluation of arguments in weighted bipolar graphs.International Journal of Approximate Reasoning(2018), 39–55","work_id":"ea1fa924-4a8d-49a2-a5d0-3ca7a964f8e8","year":2018},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Leila Amgoud, Jonathan Ben-Naim, Dragan Doder, and Srdjan Vesic. 2016. Rank- ing arguments with compensation-based semantics. In15th International Confer- ence on Principles of Knowledge Representatio","work_id":"7c4632e7-72fb-480c-b075-0836e46c8358","year":2016},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Leila Amgoud and Claudette Cayrol. 1998. On the acceptability of arguments in preference-based argumentation. InProceedings of the Fourteenth Conference on Uncertainty in Artificial Intelligence. 1–7","work_id":"98dcf9c1-996c-40a0-a183-cd00bd26711c","year":1998}],"snapshot_sha256":"6bd4abb6d48bcc4b4da14ad64b199f705b87c5e70dabcadde6cc17274b7fc5ea"},"source":{"id":"2602.14674","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-15T21:53:03.894091Z","id":"5ffa55ea-8ec1-4dfb-bf3c-1483f12eef51","model_set":{"reader":"grok-4.3"},"one_line_summary":"Base Score Extraction Functions convert user preferences into base scores for Bipolar Argumentation Frameworks, producing Quantitative Bipolar Argumentation Frameworks usable with existing gradual semantics tools, including an algorithm and robotics evaluation.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Base Score Extraction Functions convert user preferences over arguments into numerical base scores for quantitative gradual argumentation.","strongest_claim":"We introduce Base Score Extraction Functions, which provide a mapping from users' preferences over arguments to base scores. These functions can be applied to the arguments of a Bipolar Argumentation Framework (BAF), supplemented with preferences, to obtain a Quantitative Bipolar Argumentation Framework (QBAF).","weakest_assumption":"That user preferences over arguments can be reliably captured by the proposed extraction functions, including their approximation of non-linearities, and that the resulting base scores produce meaningful and stable outcomes under standard gradual semantics."}},"verdict_id":"5ffa55ea-8ec1-4dfb-bf3c-1483f12eef51"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c82f33d463ac11efc5e032939f0b04219f50680af03dcddef8a83effc8055494","target":"record","created_at":"2026-05-17T23:38:59Z","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":"63ad65c8d866c1adf08998942c6fee7387ac21c1c4a06053185734665db7f0ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2026-02-16T12:01:58Z","title_canon_sha256":"c1b78d30ce12a077d436e1537b158b63f7aec50ca5576278a926a352d9824099"},"schema_version":"1.0","source":{"id":"2602.14674","kind":"arxiv","version":4}},"canonical_sha256":"870df4deaa62cceb399992a5b259ff3c6e7f257602fbe234790e49f7e87b22b9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"870df4deaa62cceb399992a5b259ff3c6e7f257602fbe234790e49f7e87b22b9","first_computed_at":"2026-05-17T23:38:59.937866Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:59.937866Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"e7oTXYeE86cDY7AZvRuVxZcAIGv7r79haOd8gqIz7Hlvx986QYCub/0ji3xr+nt7hZwx+TD+setJ4+3Q8XYdDA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:59.938446Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.14674","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c82f33d463ac11efc5e032939f0b04219f50680af03dcddef8a83effc8055494","sha256:fd047710b6d8403f3e9d2c84483cf75c5632c5bbb1e720767b43cf9216d319a7"],"state_sha256":"2e813e12a57414ed4b4165f19923dedb925dbeee456435881e85d0d6783315d0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mnYC+2mjUWEMkOmiWnGFgjvgLrhVu6nAlA1OnmtMhDP9miOILVv9dJqpm8KbDiOLvhNJsfCp9e1wJyGAECqjAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T22:57:13.740635Z","bundle_sha256":"c37a9e6f09cc9341a9dc80eb0fa40acdfa4611dfcc245d304ce142566ef793f6"}}