{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:YWL5L3BMRWK7EETKAU55XA7SQG","short_pith_number":"pith:YWL5L3BM","canonical_record":{"source":{"id":"2605.16824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T05:57:00Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"2f60d239e717102168fbc9d854150d6736dca42974dc85134ff1492f763d4d03","abstract_canon_sha256":"076a6624ab838da8b08dc2461a7151832c8763030ca32bb3b8b238ddc853a2cc"},"schema_version":"1.0"},"canonical_sha256":"c597d5ec2c8d95f2126a053bdb83f281ab06f4ba52ee9c216bdeec9c98193bd1","source":{"kind":"arxiv","id":"2605.16824","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16824","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16824v1","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16824","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"YWL5L3BMRWK7","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"YWL5L3BMRWK7EETK","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"YWL5L3BM","created_at":"2026-05-20T00:03:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:YWL5L3BMRWK7EETKAU55XA7SQG","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16824","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T05:57:00Z","cross_cats_sorted":["cs.CL"],"title_canon_sha256":"2f60d239e717102168fbc9d854150d6736dca42974dc85134ff1492f763d4d03","abstract_canon_sha256":"076a6624ab838da8b08dc2461a7151832c8763030ca32bb3b8b238ddc853a2cc"},"schema_version":"1.0"},"canonical_sha256":"c597d5ec2c8d95f2126a053bdb83f281ab06f4ba52ee9c216bdeec9c98193bd1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:24.519356Z","signature_b64":"MYnf6TXLMMn5GbELkUs+pEBrlL6eHGs+iiV8QrvWWQWL0BNDWJKzZpD1MzKfOPhkf+e3W5Af10GuIcXgvFRtAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c597d5ec2c8d95f2126a053bdb83f281ab06f4ba52ee9c216bdeec9c98193bd1","last_reissued_at":"2026-05-20T00:03:24.518186Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:24.518186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16824","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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/fr76y7CFpOBsLlpTnZZFFXV7wxqbxEDj4qD+6JPAJy2OrI2f3ua0cB019FSC95uaTKiyJZklatW05lGO7yxDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:39:58.965930Z"},"content_sha256":"10b3f05654566bd3daf0ed2f25973817b2a119ca6e37e97574f13dc308d48527","schema_version":"1.0","event_id":"sha256:10b3f05654566bd3daf0ed2f25973817b2a119ca6e37e97574f13dc308d48527"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:YWL5L3BMRWK7EETKAU55XA7SQG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Confidence Geometry Reveals Trace-Level Correctness in Large Language Model Reasoning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Token-level confidence trajectories in LLMs form low-dimensional geometries that separate correct from incorrect reasoning traces without using question or text content.","cross_cats":["cs.CL"],"primary_cat":"cs.LG","authors_text":"Ding Liu, Shi-Ju Ran, Shuo Liu","submitted_at":"2026-05-16T05:57:00Z","abstract_excerpt":"Large language models (LLMs) generate not only reasoning text, but also token-level confidence trajectories that record how uncertainty evolves during inference. Whether these trajectories are relevant to reasoning correctness remains unclear. Here we show that confidence trajectories encode a content-agnostic confidence geometry associated with trace-level final-answer correctness. Using only token-level confidence values, without access to the input question, reasoning text, hidden states, or external verifiers, we find that low-dimensional representations of confidence trajectories separate"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Using only token-level confidence values, without access to the input question, reasoning text, hidden states, or external verifiers, low-dimensional representations of confidence trajectories separate correct from incorrect reasoning traces.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That the observed low-dimensional separation arises specifically from trace-level correctness rather than from other correlated properties of the generation process such as length, token distribution, or model-specific artifacts, and that this separation generalizes beyond the three evaluated benchmarks without content information.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Token-level confidence trajectories in LLMs encode a content-agnostic geometry that separates correct and incorrect reasoning traces and supports a lightweight correctness estimator called NeuralConf.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Token-level confidence trajectories in LLMs form low-dimensional geometries that separate correct from incorrect reasoning traces without using question or text content.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"6f8d105ae6415ed8f6673440e7d7bd04a4cf4028724b3ef01bf8f72402750ce3"},"source":{"id":"2605.16824","kind":"arxiv","version":1},"verdict":{"id":"8aed55bb-914b-4a39-acab-eaa6d0d3ffdc","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:50:25.533304Z","strongest_claim":"Using only token-level confidence values, without access to the input question, reasoning text, hidden states, or external verifiers, low-dimensional representations of confidence trajectories separate correct from incorrect reasoning traces.","one_line_summary":"Token-level confidence trajectories in LLMs encode a content-agnostic geometry that separates correct and incorrect reasoning traces and supports a lightweight correctness estimator called NeuralConf.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That the observed low-dimensional separation arises specifically from trace-level correctness rather than from other correlated properties of the generation process such as length, token distribution, or model-specific artifacts, and that this separation generalizes beyond the three evaluated benchmarks without content information.","pith_extraction_headline":"Token-level confidence trajectories in LLMs form low-dimensional geometries that separate correct from incorrect reasoning traces without using question or text content."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16824/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_compliance","ran_at":"2026-05-19T21:01:26.409011Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.265439Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.265002Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.407531Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"655da22412969dd94f9148298f2ca415cf61f0164ae069d3574bf243a6a18302"},"references":{"count":32,"sample":[{"doi":"","year":2022,"title":"Chain-of- thought prompting elicits reasoning in large language models,","work_id":"a072c1ae-ca12-411a-8ff7-c501d9d89c6a","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Large language models are zero-shot reasoners,","work_id":"3117d03a-1cd7-4a6d-b581-fc15bce9a095","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Least-to-most prompting enables complex reasoning in large language models,","work_id":"b11eff8b-8a5f-4338-ba00-0eb3459b4f6d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Self-consistency improves chain of thought reasoning in language models,","work_id":"d3947bab-e558-4cac-90db-f5bfb5eb3e31","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"Tree of thoughts: Deliberate problem solving with large language models,","work_id":"c4646d28-69bb-440a-9038-a4bed3a63804","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":32,"snapshot_sha256":"c1a6d303708631bc547fbd0cea936b53908e1ca4246bf729e7525f2aa4e9ead4","internal_anchors":7},"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":"8aed55bb-914b-4a39-acab-eaa6d0d3ffdc"},"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:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"11v9+bK7aalggJlGHvO9w3FqZW4O2IHS3OM34HMvuLxtR0WDFzYJBH2mfwg+ty1lpeWQ5JmY6Lqx8DC95me4Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:39:58.967061Z"},"content_sha256":"23a765b8d8595ab0ba3fc6ead4d7ea8c962fb6f2bc0b5c5b24210a5bc6e0f46d","schema_version":"1.0","event_id":"sha256:23a765b8d8595ab0ba3fc6ead4d7ea8c962fb6f2bc0b5c5b24210a5bc6e0f46d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YWL5L3BMRWK7EETKAU55XA7SQG/bundle.json","state_url":"https://pith.science/pith/YWL5L3BMRWK7EETKAU55XA7SQG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YWL5L3BMRWK7EETKAU55XA7SQG/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-05-28T22:39:58Z","links":{"resolver":"https://pith.science/pith/YWL5L3BMRWK7EETKAU55XA7SQG","bundle":"https://pith.science/pith/YWL5L3BMRWK7EETKAU55XA7SQG/bundle.json","state":"https://pith.science/pith/YWL5L3BMRWK7EETKAU55XA7SQG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YWL5L3BMRWK7EETKAU55XA7SQG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:YWL5L3BMRWK7EETKAU55XA7SQG","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":"076a6624ab838da8b08dc2461a7151832c8763030ca32bb3b8b238ddc853a2cc","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T05:57:00Z","title_canon_sha256":"2f60d239e717102168fbc9d854150d6736dca42974dc85134ff1492f763d4d03"},"schema_version":"1.0","source":{"id":"2605.16824","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16824","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16824v1","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16824","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_12","alias_value":"YWL5L3BMRWK7","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_16","alias_value":"YWL5L3BMRWK7EETK","created_at":"2026-05-20T00:03:24Z"},{"alias_kind":"pith_short_8","alias_value":"YWL5L3BM","created_at":"2026-05-20T00:03:24Z"}],"graph_snapshots":[{"event_id":"sha256:23a765b8d8595ab0ba3fc6ead4d7ea8c962fb6f2bc0b5c5b24210a5bc6e0f46d","target":"graph","created_at":"2026-05-20T00:03:24Z","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":"Using only token-level confidence values, without access to the input question, reasoning text, hidden states, or external verifiers, low-dimensional representations of confidence trajectories separate correct from incorrect reasoning traces."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That the observed low-dimensional separation arises specifically from trace-level correctness rather than from other correlated properties of the generation process such as length, token distribution, or model-specific artifacts, and that this separation generalizes beyond the three evaluated benchmarks without content information."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Token-level confidence trajectories in LLMs encode a content-agnostic geometry that separates correct and incorrect reasoning traces and supports a lightweight correctness estimator called NeuralConf."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Token-level confidence trajectories in LLMs form low-dimensional geometries that separate correct from incorrect reasoning traces without using question or text content."}],"snapshot_sha256":"6f8d105ae6415ed8f6673440e7d7bd04a4cf4028724b3ef01bf8f72402750ce3"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T21:01:26.409011Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.265439Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T19:01:56.265002Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.407531Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16824/integrity.json","findings":[],"snapshot_sha256":"655da22412969dd94f9148298f2ca415cf61f0164ae069d3574bf243a6a18302","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Large language models (LLMs) generate not only reasoning text, but also token-level confidence trajectories that record how uncertainty evolves during inference. Whether these trajectories are relevant to reasoning correctness remains unclear. Here we show that confidence trajectories encode a content-agnostic confidence geometry associated with trace-level final-answer correctness. Using only token-level confidence values, without access to the input question, reasoning text, hidden states, or external verifiers, we find that low-dimensional representations of confidence trajectories separate","authors_text":"Ding Liu, Shi-Ju Ran, Shuo Liu","cross_cats":["cs.CL"],"headline":"Token-level confidence trajectories in LLMs form low-dimensional geometries that separate correct from incorrect reasoning traces without using question or text content.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T05:57:00Z","title":"Confidence Geometry Reveals Trace-Level Correctness in Large Language Model Reasoning"},"references":{"count":32,"internal_anchors":7,"resolved_work":32,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Chain-of- thought prompting elicits reasoning in large language models,","work_id":"a072c1ae-ca12-411a-8ff7-c501d9d89c6a","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Large language models are zero-shot reasoners,","work_id":"3117d03a-1cd7-4a6d-b581-fc15bce9a095","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Least-to-most prompting enables complex reasoning in large language models,","work_id":"b11eff8b-8a5f-4338-ba00-0eb3459b4f6d","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Self-consistency improves chain of thought reasoning in language models,","work_id":"d3947bab-e558-4cac-90db-f5bfb5eb3e31","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Tree of thoughts: Deliberate problem solving with large language models,","work_id":"c4646d28-69bb-440a-9038-a4bed3a63804","year":2023}],"snapshot_sha256":"c1a6d303708631bc547fbd0cea936b53908e1ca4246bf729e7525f2aa4e9ead4"},"source":{"id":"2605.16824","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:50:25.533304Z","id":"8aed55bb-914b-4a39-acab-eaa6d0d3ffdc","model_set":{"reader":"grok-4.3"},"one_line_summary":"Token-level confidence trajectories in LLMs encode a content-agnostic geometry that separates correct and incorrect reasoning traces and supports a lightweight correctness estimator called NeuralConf.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Token-level confidence trajectories in LLMs form low-dimensional geometries that separate correct from incorrect reasoning traces without using question or text content.","strongest_claim":"Using only token-level confidence values, without access to the input question, reasoning text, hidden states, or external verifiers, low-dimensional representations of confidence trajectories separate correct from incorrect reasoning traces.","weakest_assumption":"That the observed low-dimensional separation arises specifically from trace-level correctness rather than from other correlated properties of the generation process such as length, token distribution, or model-specific artifacts, and that this separation generalizes beyond the three evaluated benchmarks without content information."}},"verdict_id":"8aed55bb-914b-4a39-acab-eaa6d0d3ffdc"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:10b3f05654566bd3daf0ed2f25973817b2a119ca6e37e97574f13dc308d48527","target":"record","created_at":"2026-05-20T00:03:24Z","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":"076a6624ab838da8b08dc2461a7151832c8763030ca32bb3b8b238ddc853a2cc","cross_cats_sorted":["cs.CL"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-16T05:57:00Z","title_canon_sha256":"2f60d239e717102168fbc9d854150d6736dca42974dc85134ff1492f763d4d03"},"schema_version":"1.0","source":{"id":"2605.16824","kind":"arxiv","version":1}},"canonical_sha256":"c597d5ec2c8d95f2126a053bdb83f281ab06f4ba52ee9c216bdeec9c98193bd1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c597d5ec2c8d95f2126a053bdb83f281ab06f4ba52ee9c216bdeec9c98193bd1","first_computed_at":"2026-05-20T00:03:24.518186Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:24.518186Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MYnf6TXLMMn5GbELkUs+pEBrlL6eHGs+iiV8QrvWWQWL0BNDWJKzZpD1MzKfOPhkf+e3W5Af10GuIcXgvFRtAA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:24.519356Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16824","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:10b3f05654566bd3daf0ed2f25973817b2a119ca6e37e97574f13dc308d48527","sha256:23a765b8d8595ab0ba3fc6ead4d7ea8c962fb6f2bc0b5c5b24210a5bc6e0f46d"],"state_sha256":"1481c70bb8c05068e53f3204472cc378af0419edc1c6313fb00bbb0769b073ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cHIrJiCVNJNlQ/CJrABnn+ek8GmHOJFLKovD6Jxbzbz718p6rY+wnFn69qYvldY6dAOnVdJhekmM+gQHFbB2Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:39:58.972112Z","bundle_sha256":"c97e1341f83f1699a8d8e4c92d778c8c8fd65c6b7da8bc9ec4974321bbff7ede"}}