{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:ZP7UZNOEWYGC3D7DAGUIKICKBU","short_pith_number":"pith:ZP7UZNOE","canonical_record":{"source":{"id":"2602.19292","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-22T17:59:27Z","cross_cats_sorted":["cs.IT","cs.SY","eess.SY","math.IT"],"title_canon_sha256":"4ceb5d7b812a86f26559e7c4cfb7f3af6533058bf3bc06bb676aa54eca341ffc","abstract_canon_sha256":"b4d8982678878d66c69045411182216d039d39456a91f42b51f790eb31b58cc7"},"schema_version":"1.0"},"canonical_sha256":"cbff4cb5c4b60c2d8fe301a885204a0d051cd6fea069da607d16e87236527497","source":{"kind":"arxiv","id":"2602.19292","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.19292","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2602.19292v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.19292","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZP7UZNOEWYGC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZP7UZNOEWYGC3D7D","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZP7UZNOE","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:ZP7UZNOEWYGC3D7DAGUIKICKBU","target":"record","payload":{"canonical_record":{"source":{"id":"2602.19292","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-22T17:59:27Z","cross_cats_sorted":["cs.IT","cs.SY","eess.SY","math.IT"],"title_canon_sha256":"4ceb5d7b812a86f26559e7c4cfb7f3af6533058bf3bc06bb676aa54eca341ffc","abstract_canon_sha256":"b4d8982678878d66c69045411182216d039d39456a91f42b51f790eb31b58cc7"},"schema_version":"1.0"},"canonical_sha256":"cbff4cb5c4b60c2d8fe301a885204a0d051cd6fea069da607d16e87236527497","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:16.026098Z","signature_b64":"gsv9ViHLFd94JOs2mya11yUFvFkxQXsdDgsfdBHy9D5Dp5Kdc2npL2UPrkiTqdGtKyUFy20hFUhfp7xfOBzvBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbff4cb5c4b60c2d8fe301a885204a0d051cd6fea069da607d16e87236527497","last_reissued_at":"2026-05-17T23:39:16.025482Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:16.025482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2602.19292","source_version":2,"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:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7oDprnb4zLxhzOb7QTeTqW0bNijteajAcUWpfcj91dTEpMko+6ryXG93V68qeU5BY2DRoBUHm86yan9rr0+QAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:17:16.424067Z"},"content_sha256":"b788770e38a68fc147e0d57af56d35ba685fce7cc92b1656301a0bf7101ff99d","schema_version":"1.0","event_id":"sha256:b788770e38a68fc147e0d57af56d35ba685fce7cc92b1656301a0bf7101ff99d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:ZP7UZNOEWYGC3D7DAGUIKICKBU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategic Gaussian Signaling under Linear Sensitivity Mismatch","license":"http://creativecommons.org/licenses/by/4.0/","headline":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, the encoder transmits information only along the negative-eigenvalue directions of the mismatch matrix in the noiseless case.","cross_cats":["cs.IT","cs.SY","eess.SY","math.IT"],"primary_cat":"cs.GT","authors_text":"Hassan Munif, Samson Lasaulce, Vineeth Satheeskumar Varma","submitted_at":"2026-02-22T17:59:27Z","abstract_excerpt":"We analyze Stackelberg Gaussian signaling games where the encoder and decoder have a linear sensitivity mismatch. Unlike the standard additive-bias model, a sensitivity mismatch means the encoder prefers the decoder to track a linear transformation of the state rather than a shifted one. We derive the equilibrium structure for both noiseless (cheap-talk) and noisy signaling channels. In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regim"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regime, we derive analytical thresholds for informative signaling, showing that communication collapses if the sensitivity mismatch or transmission cost exceeds a channel-dependent threshold.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The analysis assumes a linear sensitivity mismatch between encoder and decoder preferences together with jointly Gaussian state and noise; if the mismatch is nonlinear or the distributions are non-Gaussian the derived spectral and threshold characterizations need not hold.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, equilibria feature transmission only along negative-eigenvalue eigenspaces in noiseless cases and collapse if mismatch or transmission cost exceeds channel-dependent thresholds in noisy cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, the encoder transmits information only along the negative-eigenvalue directions of the mismatch matrix in the noiseless case.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"84f0096e777695d8f30b54d1bb2cff61b7a12807004ae8909487f7de25a0d5b1"},"source":{"id":"2602.19292","kind":"arxiv","version":2},"verdict":{"id":"004ec7c3-cb1e-4a1c-8a80-f315fe6d8323","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T20:38:56.638233Z","strongest_claim":"In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regime, we derive analytical thresholds for informative signaling, showing that communication collapses if the sensitivity mismatch or transmission cost exceeds a channel-dependent threshold.","one_line_summary":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, equilibria feature transmission only along negative-eigenvalue eigenspaces in noiseless cases and collapse if mismatch or transmission cost exceeds channel-dependent thresholds in noisy cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The analysis assumes a linear sensitivity mismatch between encoder and decoder preferences together with jointly Gaussian state and noise; if the mismatch is nonlinear or the distributions are non-Gaussian the derived spectral and threshold characterizations need not hold.","pith_extraction_headline":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, the encoder transmits information only along the negative-eigenvalue directions of the mismatch matrix in the noiseless case."},"references":{"count":17,"sample":[{"doi":"","year":2015,"title":"Akyol, E., Langbort, C., and Ba¸ sar, T. (2015). Privacy constrained information processing. InProc. 54th IEEE Conf. Decis. Control (CDC), 4511–4516","work_id":"9ff2da24-8882-4162-a4f2-555c0bae200f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Akyol, E., Langbort, C., and Ba¸ sar, T. (2017). Information-theoretic approach to strategic communica- tion as a hierarchical game.Proc. IEEE, 105, 205–218","work_id":"4ff41a97-ca5e-48ef-b32c-fc8f71dda35e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"Cover, T.M. and Thomas, J.A. (1999).Elements of Information Theory. John Wiley & Sons","work_id":"eb8f48a1-4c64-41f0-acb3-4018b267de6d","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1982,"title":"Crawford, V.P. and Sobel, J. (1982). Strategic information transmission.Econometrica, 50(6), 1431–1451","work_id":"02b51341-e398-415f-b75f-cbbd171aa1a4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"Farokhi, F., Teixeira, A.M.H., and Langbort, C. (2017). Estimation with strategic sensors.IEEE Trans. Autom. Control, 62(2), 724–739","work_id":"4c7b30d0-0cd2-4007-82ca-0b93fc8e4a67","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":17,"snapshot_sha256":"4c48e709953270600aa1bb8d6a11ca282b2cb987e9f86f511e7975accd496fd9","internal_anchors":0},"formal_canon":{"evidence_count":1,"snapshot_sha256":"b4d25fceca5b2f145451120e8286b7420aaed5bdd9a5a2ae0c6508d4cf0af2b0"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"004ec7c3-cb1e-4a1c-8a80-f315fe6d8323"},"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:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1H++gIQA3733jElpigIDM1iW3y1ocgysjtmocwahH5zbqd6lm5R4IjM8TzUKuN2MF1uULVPzsaLHBWkjyLDEBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T17:17:16.425276Z"},"content_sha256":"086fb53f2e0f8bf1c80a2d698f0cde90e6feed902049b1a81e911f344af81b67","schema_version":"1.0","event_id":"sha256:086fb53f2e0f8bf1c80a2d698f0cde90e6feed902049b1a81e911f344af81b67"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZP7UZNOEWYGC3D7DAGUIKICKBU/bundle.json","state_url":"https://pith.science/pith/ZP7UZNOEWYGC3D7DAGUIKICKBU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZP7UZNOEWYGC3D7DAGUIKICKBU/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-07T17:17:16Z","links":{"resolver":"https://pith.science/pith/ZP7UZNOEWYGC3D7DAGUIKICKBU","bundle":"https://pith.science/pith/ZP7UZNOEWYGC3D7DAGUIKICKBU/bundle.json","state":"https://pith.science/pith/ZP7UZNOEWYGC3D7DAGUIKICKBU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZP7UZNOEWYGC3D7DAGUIKICKBU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:ZP7UZNOEWYGC3D7DAGUIKICKBU","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":"b4d8982678878d66c69045411182216d039d39456a91f42b51f790eb31b58cc7","cross_cats_sorted":["cs.IT","cs.SY","eess.SY","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-22T17:59:27Z","title_canon_sha256":"4ceb5d7b812a86f26559e7c4cfb7f3af6533058bf3bc06bb676aa54eca341ffc"},"schema_version":"1.0","source":{"id":"2602.19292","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2602.19292","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"arxiv_version","alias_value":"2602.19292v2","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2602.19292","created_at":"2026-05-17T23:39:16Z"},{"alias_kind":"pith_short_12","alias_value":"ZP7UZNOEWYGC","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"ZP7UZNOEWYGC3D7D","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"ZP7UZNOE","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:086fb53f2e0f8bf1c80a2d698f0cde90e6feed902049b1a81e911f344af81b67","target":"graph","created_at":"2026-05-17T23:39:16Z","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":"In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regime, we derive analytical thresholds for informative signaling, showing that communication collapses if the sensitivity mismatch or transmission cost exceeds a channel-dependent threshold."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The analysis assumes a linear sensitivity mismatch between encoder and decoder preferences together with jointly Gaussian state and noise; if the mismatch is nonlinear or the distributions are non-Gaussian the derived spectral and threshold characterizations need not hold."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, equilibria feature transmission only along negative-eigenvalue eigenspaces in noiseless cases and collapse if mismatch or transmission cost exceeds channel-dependent thresholds in noisy cases."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, the encoder transmits information only along the negative-eigenvalue directions of the mismatch matrix in the noiseless case."}],"snapshot_sha256":"84f0096e777695d8f30b54d1bb2cff61b7a12807004ae8909487f7de25a0d5b1"},"formal_canon":{"evidence_count":1,"snapshot_sha256":"b4d25fceca5b2f145451120e8286b7420aaed5bdd9a5a2ae0c6508d4cf0af2b0"},"paper":{"abstract_excerpt":"We analyze Stackelberg Gaussian signaling games where the encoder and decoder have a linear sensitivity mismatch. Unlike the standard additive-bias model, a sensitivity mismatch means the encoder prefers the decoder to track a linear transformation of the state rather than a shifted one. We derive the equilibrium structure for both noiseless (cheap-talk) and noisy signaling channels. In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regim","authors_text":"Hassan Munif, Samson Lasaulce, Vineeth Satheeskumar Varma","cross_cats":["cs.IT","cs.SY","eess.SY","math.IT"],"headline":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, the encoder transmits information only along the negative-eigenvalue directions of the mismatch matrix in the noiseless case.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-22T17:59:27Z","title":"Strategic Gaussian Signaling under Linear Sensitivity Mismatch"},"references":{"count":17,"internal_anchors":0,"resolved_work":17,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Akyol, E., Langbort, C., and Ba¸ sar, T. (2015). Privacy constrained information processing. InProc. 54th IEEE Conf. Decis. Control (CDC), 4511–4516","work_id":"9ff2da24-8882-4162-a4f2-555c0bae200f","year":2015},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Akyol, E., Langbort, C., and Ba¸ sar, T. (2017). Information-theoretic approach to strategic communica- tion as a hierarchical game.Proc. IEEE, 105, 205–218","work_id":"4ff41a97-ca5e-48ef-b32c-fc8f71dda35e","year":2017},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Cover, T.M. and Thomas, J.A. (1999).Elements of Information Theory. John Wiley & Sons","work_id":"eb8f48a1-4c64-41f0-acb3-4018b267de6d","year":1999},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Crawford, V.P. and Sobel, J. (1982). Strategic information transmission.Econometrica, 50(6), 1431–1451","work_id":"02b51341-e398-415f-b75f-cbbd171aa1a4","year":1982},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Farokhi, F., Teixeira, A.M.H., and Langbort, C. (2017). Estimation with strategic sensors.IEEE Trans. Autom. Control, 62(2), 724–739","work_id":"4c7b30d0-0cd2-4007-82ca-0b93fc8e4a67","year":2017}],"snapshot_sha256":"4c48e709953270600aa1bb8d6a11ca282b2cb987e9f86f511e7975accd496fd9"},"source":{"id":"2602.19292","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-15T20:38:56.638233Z","id":"004ec7c3-cb1e-4a1c-8a80-f315fe6d8323","model_set":{"reader":"grok-4.3"},"one_line_summary":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, equilibria feature transmission only along negative-eigenvalue eigenspaces in noiseless cases and collapse if mismatch or transmission cost exceeds channel-dependent thresholds in noisy cases.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"In Stackelberg Gaussian signaling with linear sensitivity mismatch, the encoder transmits information only along the negative-eigenvalue directions of the mismatch matrix in the noiseless case.","strongest_claim":"In the noiseless case, the equilibrium admits a spectral characterization: the encoder transmits information only along eigenspaces associated with the negative eigenvalues of a mismatch matrix. In the noisy regime, we derive analytical thresholds for informative signaling, showing that communication collapses if the sensitivity mismatch or transmission cost exceeds a channel-dependent threshold.","weakest_assumption":"The analysis assumes a linear sensitivity mismatch between encoder and decoder preferences together with jointly Gaussian state and noise; if the mismatch is nonlinear or the distributions are non-Gaussian the derived spectral and threshold characterizations need not hold."}},"verdict_id":"004ec7c3-cb1e-4a1c-8a80-f315fe6d8323"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b788770e38a68fc147e0d57af56d35ba685fce7cc92b1656301a0bf7101ff99d","target":"record","created_at":"2026-05-17T23:39:16Z","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":"b4d8982678878d66c69045411182216d039d39456a91f42b51f790eb31b58cc7","cross_cats_sorted":["cs.IT","cs.SY","eess.SY","math.IT"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2026-02-22T17:59:27Z","title_canon_sha256":"4ceb5d7b812a86f26559e7c4cfb7f3af6533058bf3bc06bb676aa54eca341ffc"},"schema_version":"1.0","source":{"id":"2602.19292","kind":"arxiv","version":2}},"canonical_sha256":"cbff4cb5c4b60c2d8fe301a885204a0d051cd6fea069da607d16e87236527497","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cbff4cb5c4b60c2d8fe301a885204a0d051cd6fea069da607d16e87236527497","first_computed_at":"2026-05-17T23:39:16.025482Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:16.025482Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gsv9ViHLFd94JOs2mya11yUFvFkxQXsdDgsfdBHy9D5Dp5Kdc2npL2UPrkiTqdGtKyUFy20hFUhfp7xfOBzvBA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:16.026098Z","signed_message":"canonical_sha256_bytes"},"source_id":"2602.19292","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b788770e38a68fc147e0d57af56d35ba685fce7cc92b1656301a0bf7101ff99d","sha256:086fb53f2e0f8bf1c80a2d698f0cde90e6feed902049b1a81e911f344af81b67"],"state_sha256":"c91edce9bfa6116a94bb4af164cffb0fc504cb21e798b92be3dae8afa2757b5e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1dB8Qk0UJ6frPf0GZU3yuVyLhavUQErlo9Beo9JbMTxrD8mtZTEJwbto+N7WLMv9udPzwPvNuHodSI5GoFEoCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T17:17:16.430367Z","bundle_sha256":"31676e4f3adb0b970f679af1e596972fbf607105a8739b18b8e60eb1d8a0e8d5"}}