{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:IFBIJ64DKZVZ6JPG6SZADS76NL","short_pith_number":"pith:IFBIJ64D","canonical_record":{"source":{"id":"2605.13324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T10:36:02Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"b46116afbb709857b0a600d48499daff81965b17093ed0e6cedc3a8b54fe97db","abstract_canon_sha256":"f38b9297a8ed54a76232bf5529dfae509a1831c906251f37686a4e5433996eda"},"schema_version":"1.0"},"canonical_sha256":"414284fb83566b9f25e6f4b201cbfe6ae80abbfb65c82ceaa5ec5a3dcc35b5b3","source":{"kind":"arxiv","id":"2605.13324","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13324","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13324v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13324","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"IFBIJ64DKZVZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IFBIJ64DKZVZ6JPG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IFBIJ64D","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:IFBIJ64DKZVZ6JPG6SZADS76NL","target":"record","payload":{"canonical_record":{"source":{"id":"2605.13324","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T10:36:02Z","cross_cats_sorted":["cs.NE"],"title_canon_sha256":"b46116afbb709857b0a600d48499daff81965b17093ed0e6cedc3a8b54fe97db","abstract_canon_sha256":"f38b9297a8ed54a76232bf5529dfae509a1831c906251f37686a4e5433996eda"},"schema_version":"1.0"},"canonical_sha256":"414284fb83566b9f25e6f4b201cbfe6ae80abbfb65c82ceaa5ec5a3dcc35b5b3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:44:48.633132Z","signature_b64":"15ez1ComKXirL7XmGfLFWwW2l/dqyYgtHUZXlYm5A9KiUCGa7wxQPWHQBFslZbwZFolhyWnzgJ4Kfr7yHOmgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"414284fb83566b9f25e6f4b201cbfe6ae80abbfb65c82ceaa5ec5a3dcc35b5b3","last_reissued_at":"2026-05-18T02:44:48.632644Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:44:48.632644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.13324","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-18T02:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Fd4SRisGLrl1IA2mDlkN50k0ivgZUBPww2+POSiU8RYE2kTkec+EidqS5UPFiUW058+FrZ5fzUnm9K/4XG8jCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:25:47.061049Z"},"content_sha256":"faa8990e6846d7d343336728dda8ef858fb24867c0e1a372264eefee852b078d","schema_version":"1.0","event_id":"sha256:faa8990e6846d7d343336728dda8ef858fb24867c0e1a372264eefee852b078d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:IFBIJ64DKZVZ6JPG6SZADS76NL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"TRUST-TAEA: A trustworthiness-guided two-archive evolutionary algorithm with variable-grouping sparse search for large-scale multi-objective optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"TRUST-TAEA defines trustworthiness from evolutionary progress and archive maturity to coordinate variable-grouping sparse search in large-scale multi-objective optimization.","cross_cats":["cs.NE"],"primary_cat":"math.OC","authors_text":"JunYi Cui","submitted_at":"2026-05-13T10:36:02Z","abstract_excerpt":"Large-scale multi-objective optimization remains challenging because high-dimensional decision spaces, complex variable interactions, and limited function evaluation budgets make it difficult to balance convergence, diversity, and stability. Existing two-archive evolutionary algorithms can alleviate the conflict between convergence and diversity, but they often underuse archive reliability and problem-structure information, leading to inefficient search, incomplete front coverage, and late-stage archive drift. To address these issues, this paper proposes TRUST-TAEA, a trustworthiness-guided tw"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"TRUST-TAEA achieves superior or highly competitive performance in terms of convergence, diversity, and stability on the LSMOP benchmark suite with 500--5000 decision variables and obtains the best IGD+ value on a three-objective microgrid scheduling case.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that integrating evolutionary progress with convergence-archive maturity produces a reliable trustworthiness signal that can safely coordinate variable-grouping sparse search and archive stabilization without introducing bias or late-stage drift.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"TRUST-TAEA is a trustworthiness-guided two-archive evolutionary algorithm using variable-grouping sparse search that outperforms or matches existing methods on large-scale multi-objective benchmarks and a microgrid dispatch problem.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"TRUST-TAEA defines trustworthiness from evolutionary progress and archive maturity to coordinate variable-grouping sparse search in large-scale multi-objective optimization.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"8020834a106b80101a411efd2ba1f906f880665ab72785c50e764cecbd8b984a"},"source":{"id":"2605.13324","kind":"arxiv","version":1},"verdict":{"id":"c2c0feb3-da72-4041-bb04-53b62a588002","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T17:46:37.565504Z","strongest_claim":"TRUST-TAEA achieves superior or highly competitive performance in terms of convergence, diversity, and stability on the LSMOP benchmark suite with 500--5000 decision variables and obtains the best IGD+ value on a three-objective microgrid scheduling case.","one_line_summary":"TRUST-TAEA is a trustworthiness-guided two-archive evolutionary algorithm using variable-grouping sparse search that outperforms or matches existing methods on large-scale multi-objective benchmarks and a microgrid dispatch problem.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that integrating evolutionary progress with convergence-archive maturity produces a reliable trustworthiness signal that can safely coordinate variable-grouping sparse search and archive stabilization without introducing bias or late-stage drift.","pith_extraction_headline":"TRUST-TAEA defines trustworthiness from evolutionary progress and archive maturity to coordinate variable-grouping sparse search in large-scale multi-objective optimization."},"references":{"count":41,"sample":[{"doi":"10.1016/j.asoc.2023.111065","year":2024,"title":"A. Younis, Z. Dong, Adaptive surrogate assisted multi-objective optimization approach for highly nonlinear and complex engineering design problems, Applied Soft Computing 150 (2024) 111065.doi: https:","work_id":"04b8a7d8-9e43-4bfc-821d-79895403f01b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.chaos.2025.117303","year":2025,"title":"J. Yang, F. Yan, J. Zhang, C. Peng, R. Zhang, Multi-objective plant root growth optimization algorithm for engineering design problems anduavpathplanning,Chaos,Solitons&Fractals201(2025)117303. doi:ht","work_id":"79f3b1c2-aa39-495d-975e-ea9f0ffb46ca","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.apples.2026.100310","year":2026,"title":"A. Pichitkul, A. Boksawat, T. Phiboon, S. Tantrairatn, S. Bureerat, R. Kasemsri, A. Ariyarit, An intelligent multi-objective robust de- sign optimization framework based on pathline transformation and","work_id":"7a705041-769d-48d9-b3be-1a6b0e552c17","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2011,"title":"F. Ballestín, R. Blanco, Theoretical and practical fundamentals for multi-objectiveoptimisationinresource-constrainedprojectschedul- ing problems, Computers & Operations Research 38 (1) (2011) 51– 62,","work_id":"a7bfc705-bdac-47b8-ba09-5a3ed509355a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/j.engappai.2024","year":2024,"title":"M. Fekri, M. Heydari, M. Mahdavi Mazdeh, Bi-objective optimiza- tion of flexible flow shop scheduling problem with multi-skilled human resources, Engineering Applications of Artificial Intelligence 13","work_id":"cab12ec0-e0e0-49e2-94be-de904ffab51a","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":41,"snapshot_sha256":"88397e36430fe32521d16f4e2282da540fd7b50b223252886f6e80e2c1266d43","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":"c2c0feb3-da72-4041-bb04-53b62a588002"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:44:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xDH6XQKS8xJcAaitQgcJIY/lszLDeusDQ7CNmpBkNQJhzWA1+akWnVDhlzPOkYHCZGf2bfitu+LssGHnbXhdDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T05:25:47.062202Z"},"content_sha256":"d9642d486f2c382a99eb0aca4fbde7524e85e3f54ca7d65bece1b34c3b64f7e3","schema_version":"1.0","event_id":"sha256:d9642d486f2c382a99eb0aca4fbde7524e85e3f54ca7d65bece1b34c3b64f7e3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IFBIJ64DKZVZ6JPG6SZADS76NL/bundle.json","state_url":"https://pith.science/pith/IFBIJ64DKZVZ6JPG6SZADS76NL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IFBIJ64DKZVZ6JPG6SZADS76NL/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-04T05:25:47Z","links":{"resolver":"https://pith.science/pith/IFBIJ64DKZVZ6JPG6SZADS76NL","bundle":"https://pith.science/pith/IFBIJ64DKZVZ6JPG6SZADS76NL/bundle.json","state":"https://pith.science/pith/IFBIJ64DKZVZ6JPG6SZADS76NL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IFBIJ64DKZVZ6JPG6SZADS76NL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:IFBIJ64DKZVZ6JPG6SZADS76NL","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":"f38b9297a8ed54a76232bf5529dfae509a1831c906251f37686a4e5433996eda","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T10:36:02Z","title_canon_sha256":"b46116afbb709857b0a600d48499daff81965b17093ed0e6cedc3a8b54fe97db"},"schema_version":"1.0","source":{"id":"2605.13324","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.13324","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"arxiv_version","alias_value":"2605.13324v1","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.13324","created_at":"2026-05-18T02:44:48Z"},{"alias_kind":"pith_short_12","alias_value":"IFBIJ64DKZVZ","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"IFBIJ64DKZVZ6JPG","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"IFBIJ64D","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:d9642d486f2c382a99eb0aca4fbde7524e85e3f54ca7d65bece1b34c3b64f7e3","target":"graph","created_at":"2026-05-18T02:44:48Z","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":"TRUST-TAEA achieves superior or highly competitive performance in terms of convergence, diversity, and stability on the LSMOP benchmark suite with 500--5000 decision variables and obtains the best IGD+ value on a three-objective microgrid scheduling case."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that integrating evolutionary progress with convergence-archive maturity produces a reliable trustworthiness signal that can safely coordinate variable-grouping sparse search and archive stabilization without introducing bias or late-stage drift."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"TRUST-TAEA is a trustworthiness-guided two-archive evolutionary algorithm using variable-grouping sparse search that outperforms or matches existing methods on large-scale multi-objective benchmarks and a microgrid dispatch problem."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"TRUST-TAEA defines trustworthiness from evolutionary progress and archive maturity to coordinate variable-grouping sparse search in large-scale multi-objective optimization."}],"snapshot_sha256":"8020834a106b80101a411efd2ba1f906f880665ab72785c50e764cecbd8b984a"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Large-scale multi-objective optimization remains challenging because high-dimensional decision spaces, complex variable interactions, and limited function evaluation budgets make it difficult to balance convergence, diversity, and stability. Existing two-archive evolutionary algorithms can alleviate the conflict between convergence and diversity, but they often underuse archive reliability and problem-structure information, leading to inefficient search, incomplete front coverage, and late-stage archive drift. To address these issues, this paper proposes TRUST-TAEA, a trustworthiness-guided tw","authors_text":"JunYi Cui","cross_cats":["cs.NE"],"headline":"TRUST-TAEA defines trustworthiness from evolutionary progress and archive maturity to coordinate variable-grouping sparse search in large-scale multi-objective optimization.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T10:36:02Z","title":"TRUST-TAEA: A trustworthiness-guided two-archive evolutionary algorithm with variable-grouping sparse search for large-scale multi-objective optimization"},"references":{"count":41,"internal_anchors":0,"resolved_work":41,"sample":[{"cited_arxiv_id":"","doi":"10.1016/j.asoc.2023.111065","is_internal_anchor":false,"ref_index":1,"title":"A. Younis, Z. Dong, Adaptive surrogate assisted multi-objective optimization approach for highly nonlinear and complex engineering design problems, Applied Soft Computing 150 (2024) 111065.doi: https:","work_id":"04b8a7d8-9e43-4bfc-821d-79895403f01b","year":2024},{"cited_arxiv_id":"","doi":"10.1016/j.chaos.2025.117303","is_internal_anchor":false,"ref_index":2,"title":"J. Yang, F. Yan, J. Zhang, C. Peng, R. Zhang, Multi-objective plant root growth optimization algorithm for engineering design problems anduavpathplanning,Chaos,Solitons&Fractals201(2025)117303. doi:ht","work_id":"79f3b1c2-aa39-495d-975e-ea9f0ffb46ca","year":2025},{"cited_arxiv_id":"","doi":"10.1016/j.apples.2026.100310","is_internal_anchor":false,"ref_index":3,"title":"A. Pichitkul, A. Boksawat, T. Phiboon, S. Tantrairatn, S. Bureerat, R. Kasemsri, A. Ariyarit, An intelligent multi-objective robust de- sign optimization framework based on pathline transformation and","work_id":"7a705041-769d-48d9-b3be-1a6b0e552c17","year":2026},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"F. Ballestín, R. Blanco, Theoretical and practical fundamentals for multi-objectiveoptimisationinresource-constrainedprojectschedul- ing problems, Computers & Operations Research 38 (1) (2011) 51– 62,","work_id":"a7bfc705-bdac-47b8-ba09-5a3ed509355a","year":2011},{"cited_arxiv_id":"","doi":"10.1016/j.engappai.2024","is_internal_anchor":false,"ref_index":5,"title":"M. Fekri, M. Heydari, M. Mahdavi Mazdeh, Bi-objective optimiza- tion of flexible flow shop scheduling problem with multi-skilled human resources, Engineering Applications of Artificial Intelligence 13","work_id":"cab12ec0-e0e0-49e2-94be-de904ffab51a","year":2024}],"snapshot_sha256":"88397e36430fe32521d16f4e2282da540fd7b50b223252886f6e80e2c1266d43"},"source":{"id":"2605.13324","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-14T17:46:37.565504Z","id":"c2c0feb3-da72-4041-bb04-53b62a588002","model_set":{"reader":"grok-4.3"},"one_line_summary":"TRUST-TAEA is a trustworthiness-guided two-archive evolutionary algorithm using variable-grouping sparse search that outperforms or matches existing methods on large-scale multi-objective benchmarks and a microgrid dispatch problem.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"TRUST-TAEA defines trustworthiness from evolutionary progress and archive maturity to coordinate variable-grouping sparse search in large-scale multi-objective optimization.","strongest_claim":"TRUST-TAEA achieves superior or highly competitive performance in terms of convergence, diversity, and stability on the LSMOP benchmark suite with 500--5000 decision variables and obtains the best IGD+ value on a three-objective microgrid scheduling case.","weakest_assumption":"The assumption that integrating evolutionary progress with convergence-archive maturity produces a reliable trustworthiness signal that can safely coordinate variable-grouping sparse search and archive stabilization without introducing bias or late-stage drift."}},"verdict_id":"c2c0feb3-da72-4041-bb04-53b62a588002"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:faa8990e6846d7d343336728dda8ef858fb24867c0e1a372264eefee852b078d","target":"record","created_at":"2026-05-18T02:44:48Z","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":"f38b9297a8ed54a76232bf5529dfae509a1831c906251f37686a4e5433996eda","cross_cats_sorted":["cs.NE"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2026-05-13T10:36:02Z","title_canon_sha256":"b46116afbb709857b0a600d48499daff81965b17093ed0e6cedc3a8b54fe97db"},"schema_version":"1.0","source":{"id":"2605.13324","kind":"arxiv","version":1}},"canonical_sha256":"414284fb83566b9f25e6f4b201cbfe6ae80abbfb65c82ceaa5ec5a3dcc35b5b3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"414284fb83566b9f25e6f4b201cbfe6ae80abbfb65c82ceaa5ec5a3dcc35b5b3","first_computed_at":"2026-05-18T02:44:48.632644Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:44:48.632644Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"15ez1ComKXirL7XmGfLFWwW2l/dqyYgtHUZXlYm5A9KiUCGa7wxQPWHQBFslZbwZFolhyWnzgJ4Kfr7yHOmgAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:44:48.633132Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.13324","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:faa8990e6846d7d343336728dda8ef858fb24867c0e1a372264eefee852b078d","sha256:d9642d486f2c382a99eb0aca4fbde7524e85e3f54ca7d65bece1b34c3b64f7e3"],"state_sha256":"f6dc3f0e402bfde271e3937c588e0510af0adb346593ff839c2f723632f0cf08"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fmYv16FJq9Gdr2DbbM5KBrFPO8DDL9mVMWUD1fyQweuPG3BWDgJymtnrT1buFCH1zzVkazqtI/BwD75rnKRJBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T05:25:47.066973Z","bundle_sha256":"7a5f390c461bfbfdb40319a49c9dadf9a5739bc5c68849690a93e1c05930e217"}}