{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:7GTJUIRQWQHEOEI35IHFAZUNM7","short_pith_number":"pith:7GTJUIRQ","canonical_record":{"source":{"id":"2605.15323","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-14T18:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"c5d83142d9c8b055789e59d1e238280e0f3217772101d2cae894419daebee69a","abstract_canon_sha256":"864a4199cfb29672b850d1742e32cc1d2dfa30d952fcc863887bbea649576c18"},"schema_version":"1.0"},"canonical_sha256":"f9a69a2230b40e47111bea0e50668d67dd7dc9dbfefb04af30781983feea71c9","source":{"kind":"arxiv","id":"2605.15323","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15323","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15323v1","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15323","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"7GTJUIRQWQHE","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"7GTJUIRQWQHEOEI3","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"7GTJUIRQ","created_at":"2026-05-20T00:00:52Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:7GTJUIRQWQHEOEI35IHFAZUNM7","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15323","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-14T18:36:12Z","cross_cats_sorted":[],"title_canon_sha256":"c5d83142d9c8b055789e59d1e238280e0f3217772101d2cae894419daebee69a","abstract_canon_sha256":"864a4199cfb29672b850d1742e32cc1d2dfa30d952fcc863887bbea649576c18"},"schema_version":"1.0"},"canonical_sha256":"f9a69a2230b40e47111bea0e50668d67dd7dc9dbfefb04af30781983feea71c9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:52.648922Z","signature_b64":"bzFJBhkq/KdD71IF8EtWo+2lClDDnNqXvp+kPSDcnj56MgpiAQF3al4HFmI00c+cUhpzkC+vZJAD5j89PIczCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f9a69a2230b40e47111bea0e50668d67dd7dc9dbfefb04af30781983feea71c9","last_reissued_at":"2026-05-20T00:00:52.648134Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:52.648134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15323","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:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHH/iKYBnFhMXVY6+8TTwcx/zRdIq75sCy1SsR9MTZCpksJET4mPnCLtiCaeZoQn5ekIohnoz5YNkVWgPhx9Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:06:12.269591Z"},"content_sha256":"d76e949870f88dfe80ea8a11e2a1be47c0de6b7892709c45759380de5af748bc","schema_version":"1.0","event_id":"sha256:d76e949870f88dfe80ea8a11e2a1be47c0de6b7892709c45759380de5af748bc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:7GTJUIRQWQHEOEI35IHFAZUNM7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improvements to Jacobian Arithmetic in Global Function Fields","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"Two optimizations to Jacobian arithmetic in global function fields cut reduction steps for typical inputs and cache intermediates to achieve faster practical performance.","cross_cats":[],"primary_cat":"math.NT","authors_text":"Michael Jacobson Jr., Renate Scheidler, Vincent Macri","submitted_at":"2026-05-14T18:36:12Z","abstract_excerpt":"We present two improvements to arithmetic in the Jacobian of global function fields based on the approach of Hess. The first reduces the number of expensive reduction steps by optimizing for typical inputs rather than worst-case behavior, assuming the function field contains a degree-one place. The second introduces a memory-time trade-off that speeds up computations by caching frequently used intermediate results. Our asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowle"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Our asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowledge, our publicly-available software implementation of Jacobian arithmetic is the first to support unique representatives of divisor classes.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The function field contains a degree-one place (invoked for the first improvement that optimizes reduction steps for typical inputs rather than worst-case behavior).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Two optimizations to Jacobian arithmetic in global function fields—optimized reductions for typical cases and caching—yield faster practical performance with the first public software supporting unique divisor class representatives.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Two optimizations to Jacobian arithmetic in global function fields cut reduction steps for typical inputs and cache intermediates to achieve faster practical performance.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"27f538a84d0b750d13737c23a4954cca9c1584f3972d2cf333f0bc33729730db"},"source":{"id":"2605.15323","kind":"arxiv","version":1},"verdict":{"id":"ab5f5f4b-f011-40e5-863c-74d03f19668e","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T16:00:20.165481Z","strongest_claim":"Our asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowledge, our publicly-available software implementation of Jacobian arithmetic is the first to support unique representatives of divisor classes.","one_line_summary":"Two optimizations to Jacobian arithmetic in global function fields—optimized reductions for typical cases and caching—yield faster practical performance with the first public software supporting unique divisor class representatives.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The function field contains a degree-one place (invoked for the first improvement that optimizes reduction steps for typical inputs rather than worst-case behavior).","pith_extraction_headline":"Two optimizations to Jacobian arithmetic in global function fields cut reduction steps for typical inputs and cache intermediates to achieve faster practical performance."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15323/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.299291Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:16:11.756097Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.203887Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.766997Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8e11d4568889be152ab650d87e5bed5b69c5339a71b69cdbcbd99a3702ae66b6"},"references":{"count":23,"sample":[{"doi":"","year":2014,"title":"Bauch, J.D.: Lattices over Polynomial Rings and Applications to Function Fields. Ph.D. thesis, Universitat Autònoma de Barcelona, Bellaterra (Jul 2014)","work_id":"ef14f8c1-e724-491e-9b05-b9a579263d4c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1006/jsco.1996.0125","year":1997,"title":"Journal of Symbolic Computation24(3-4), 235–265 (Sep 1997)","work_id":"06215236-1c77-43c5-b35a-fbcef91b5ec6","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2018,"title":"Galbraith, S.D.: Mathematics of Public Key Cryptography. 2 edn. (Oct 2018)","work_id":"8578691d-c641-4405-82e7-b556e3e764c6","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1007/978-3-540-7","year":2008,"title":"In: van der Poorten, A.J., Stein, A","work_id":"4eba932d-66c4-43b9-b29b-3d524bb404fa","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Free Software Foundation, Inc","work_id":"586efff8-9c7a-4997-ad8d-2adfb690ca8c","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":23,"snapshot_sha256":"0724cf52f8d1d24932d00345165e1d54262f954a2b8723d1c16c7423db205722","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f1506a5735d00b4abb8754b4fe35bdc270725179711f3d0d86544fa58e0c68b3"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"ab5f5f4b-f011-40e5-863c-74d03f19668e"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BNeTMog8A1zp+8tEuHALss0W9anrQiQOLOFsKxmZZhtldmh0j5dljaqvoNWPZalXHP85Zr9q0KheFLsjkrR/Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T14:06:12.270901Z"},"content_sha256":"001b651f5e615e07df6412aefd5034389c6c12bdfeb60971475727aaff336d54","schema_version":"1.0","event_id":"sha256:001b651f5e615e07df6412aefd5034389c6c12bdfeb60971475727aaff336d54"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7GTJUIRQWQHEOEI35IHFAZUNM7/bundle.json","state_url":"https://pith.science/pith/7GTJUIRQWQHEOEI35IHFAZUNM7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7GTJUIRQWQHEOEI35IHFAZUNM7/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-10T14:06:12Z","links":{"resolver":"https://pith.science/pith/7GTJUIRQWQHEOEI35IHFAZUNM7","bundle":"https://pith.science/pith/7GTJUIRQWQHEOEI35IHFAZUNM7/bundle.json","state":"https://pith.science/pith/7GTJUIRQWQHEOEI35IHFAZUNM7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7GTJUIRQWQHEOEI35IHFAZUNM7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:7GTJUIRQWQHEOEI35IHFAZUNM7","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":"864a4199cfb29672b850d1742e32cc1d2dfa30d952fcc863887bbea649576c18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-14T18:36:12Z","title_canon_sha256":"c5d83142d9c8b055789e59d1e238280e0f3217772101d2cae894419daebee69a"},"schema_version":"1.0","source":{"id":"2605.15323","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15323","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15323v1","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15323","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_12","alias_value":"7GTJUIRQWQHE","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_16","alias_value":"7GTJUIRQWQHEOEI3","created_at":"2026-05-20T00:00:52Z"},{"alias_kind":"pith_short_8","alias_value":"7GTJUIRQ","created_at":"2026-05-20T00:00:52Z"}],"graph_snapshots":[{"event_id":"sha256:001b651f5e615e07df6412aefd5034389c6c12bdfeb60971475727aaff336d54","target":"graph","created_at":"2026-05-20T00:00:52Z","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 asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowledge, our publicly-available software implementation of Jacobian arithmetic is the first to support unique representatives of divisor classes."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The function field contains a degree-one place (invoked for the first improvement that optimizes reduction steps for typical inputs rather than worst-case behavior)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Two optimizations to Jacobian arithmetic in global function fields—optimized reductions for typical cases and caching—yield faster practical performance with the first public software supporting unique divisor class representatives."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Two optimizations to Jacobian arithmetic in global function fields cut reduction steps for typical inputs and cache intermediates to achieve faster practical performance."}],"snapshot_sha256":"27f538a84d0b750d13737c23a4954cca9c1584f3972d2cf333f0bc33729730db"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"f1506a5735d00b4abb8754b4fe35bdc270725179711f3d0d86544fa58e0c68b3"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.299291Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:16:11.756097Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:41:54.203887Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.766997Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15323/integrity.json","findings":[],"snapshot_sha256":"8e11d4568889be152ab650d87e5bed5b69c5339a71b69cdbcbd99a3702ae66b6","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present two improvements to arithmetic in the Jacobian of global function fields based on the approach of Hess. The first reduces the number of expensive reduction steps by optimizing for typical inputs rather than worst-case behavior, assuming the function field contains a degree-one place. The second introduces a memory-time trade-off that speeds up computations by caching frequently used intermediate results. Our asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowle","authors_text":"Michael Jacobson Jr., Renate Scheidler, Vincent Macri","cross_cats":[],"headline":"Two optimizations to Jacobian arithmetic in global function fields cut reduction steps for typical inputs and cache intermediates to achieve faster practical performance.","license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-14T18:36:12Z","title":"Improvements to Jacobian Arithmetic in Global Function Fields"},"references":{"count":23,"internal_anchors":0,"resolved_work":23,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Bauch, J.D.: Lattices over Polynomial Rings and Applications to Function Fields. Ph.D. thesis, Universitat Autònoma de Barcelona, Bellaterra (Jul 2014)","work_id":"ef14f8c1-e724-491e-9b05-b9a579263d4c","year":2014},{"cited_arxiv_id":"","doi":"10.1006/jsco.1996.0125","is_internal_anchor":false,"ref_index":2,"title":"Journal of Symbolic Computation24(3-4), 235–265 (Sep 1997)","work_id":"06215236-1c77-43c5-b35a-fbcef91b5ec6","year":1997},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Galbraith, S.D.: Mathematics of Public Key Cryptography. 2 edn. (Oct 2018)","work_id":"8578691d-c641-4405-82e7-b556e3e764c6","year":2018},{"cited_arxiv_id":"","doi":"10.1007/978-3-540-7","is_internal_anchor":false,"ref_index":4,"title":"In: van der Poorten, A.J., Stein, A","work_id":"4eba932d-66c4-43b9-b29b-3d524bb404fa","year":2008},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Free Software Foundation, Inc","work_id":"586efff8-9c7a-4997-ad8d-2adfb690ca8c","year":2023}],"snapshot_sha256":"0724cf52f8d1d24932d00345165e1d54262f954a2b8723d1c16c7423db205722"},"source":{"id":"2605.15323","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:00:20.165481Z","id":"ab5f5f4b-f011-40e5-863c-74d03f19668e","model_set":{"reader":"grok-4.3"},"one_line_summary":"Two optimizations to Jacobian arithmetic in global function fields—optimized reductions for typical cases and caching—yield faster practical performance with the first public software supporting unique divisor class representatives.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Two optimizations to Jacobian arithmetic in global function fields cut reduction steps for typical inputs and cache intermediates to achieve faster practical performance.","strongest_claim":"Our asymptotic analysis and empirical experiments show that our improved algorithms are significantly faster in practice than previously published methods. To the best of our knowledge, our publicly-available software implementation of Jacobian arithmetic is the first to support unique representatives of divisor classes.","weakest_assumption":"The function field contains a degree-one place (invoked for the first improvement that optimizes reduction steps for typical inputs rather than worst-case behavior)."}},"verdict_id":"ab5f5f4b-f011-40e5-863c-74d03f19668e"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:d76e949870f88dfe80ea8a11e2a1be47c0de6b7892709c45759380de5af748bc","target":"record","created_at":"2026-05-20T00:00:52Z","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":"864a4199cfb29672b850d1742e32cc1d2dfa30d952fcc863887bbea649576c18","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"math.NT","submitted_at":"2026-05-14T18:36:12Z","title_canon_sha256":"c5d83142d9c8b055789e59d1e238280e0f3217772101d2cae894419daebee69a"},"schema_version":"1.0","source":{"id":"2605.15323","kind":"arxiv","version":1}},"canonical_sha256":"f9a69a2230b40e47111bea0e50668d67dd7dc9dbfefb04af30781983feea71c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f9a69a2230b40e47111bea0e50668d67dd7dc9dbfefb04af30781983feea71c9","first_computed_at":"2026-05-20T00:00:52.648134Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:52.648134Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"bzFJBhkq/KdD71IF8EtWo+2lClDDnNqXvp+kPSDcnj56MgpiAQF3al4HFmI00c+cUhpzkC+vZJAD5j89PIczCw==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:52.648922Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15323","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d76e949870f88dfe80ea8a11e2a1be47c0de6b7892709c45759380de5af748bc","sha256:001b651f5e615e07df6412aefd5034389c6c12bdfeb60971475727aaff336d54"],"state_sha256":"074ad8129d451dd1507d36af7af0119aae127f4b3cf020caf4e2b6a77f692b37"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YFDByLqtOpNUYNVPhgxXwPcncNEeYsxpCxWh5994eMYBQoYSvxCn+eGAGjYEDU83z00yRt+WJsEGl8oZfmhHDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T14:06:12.276529Z","bundle_sha256":"2d8895e589dff74702255d78c2dcb8a4d31f510a25d887a54e36839425b8bb89"}}