{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TXNUGIPJY7LFWO643566G3NPC7","short_pith_number":"pith:TXNUGIPJ","canonical_record":{"source":{"id":"2605.14511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T07:55:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1196d5fb10b15e325886b24009fd782e49bfa158a4105facc5ba1d21781fba2c","abstract_canon_sha256":"81c22ea4202694620a00ec482261e267af2fdd42bd71f89e889c30ad3ed066a3"},"schema_version":"1.0"},"canonical_sha256":"9ddb4321e9c7d65b3bdcdf7de36daf17ec70db5393ddc3e87eafc065b2cc23c6","source":{"kind":"arxiv","id":"2605.14511","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14511","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14511v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14511","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"TXNUGIPJY7LF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TXNUGIPJY7LFWO64","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TXNUGIPJ","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TXNUGIPJY7LFWO643566G3NPC7","target":"record","payload":{"canonical_record":{"source":{"id":"2605.14511","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T07:55:13Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"1196d5fb10b15e325886b24009fd782e49bfa158a4105facc5ba1d21781fba2c","abstract_canon_sha256":"81c22ea4202694620a00ec482261e267af2fdd42bd71f89e889c30ad3ed066a3"},"schema_version":"1.0"},"canonical_sha256":"9ddb4321e9c7d65b3bdcdf7de36daf17ec70db5393ddc3e87eafc065b2cc23c6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:06.193086Z","signature_b64":"8fdvgt5by7DEYb3+BGuuHebcgkNc8BKSeba4+/EwfNtGIqac75j6P5Pq0PWuzixeWxeBzBH9fgGZo3MHZQRIAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ddb4321e9c7d65b3bdcdf7de36daf17ec70db5393ddc3e87eafc065b2cc23c6","last_reissued_at":"2026-05-17T23:39:06.192337Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:06.192337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.14511","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-17T23:39:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VqGfsEAmCWnOSNp8GlAYiswFP/OFQ38pWA1a2PDyvVp22ZUWRPHpdSmOlUNtcoDbLKxxnZUjqqo9fVsRpXx1DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:32:46.830112Z"},"content_sha256":"dd34468f16a66d70a81936b96391430a62d081b092aeb956cf5ea8f2449f1af7","schema_version":"1.0","event_id":"sha256:dd34468f16a66d70a81936b96391430a62d081b092aeb956cf5ea8f2449f1af7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TXNUGIPJY7LFWO643566G3NPC7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"The stationary-entry flux controls hitting times to completion in non-monotone coupon collector models, producing exponential limits.","cross_cats":["math.CO"],"primary_cat":"math.PR","authors_text":"Christopher D. Long","submitted_at":"2026-05-14T07:55:13Z","abstract_excerpt":"We study three nonmonotone coupon-collector models through a stationary-entry viewpoint. In such models the all-present state is not absorbing, so completion is governed not by the disappearance of a monotone terminal cloud but by rare new entries into a target state, except in the reset-button model, where exact regeneration gives a separate reduction.\n  We prove a finite stationary-entry theorem: a mixing estimate, a one-block clump-control estimate, and the stationary entry flux imply an exponential hitting law. For the reset-button collector, regeneration gives an exact probability-generat"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For the clumsy collector the stationary-entry flux equals p q^n and p q^n T_n converges in distribution to Exp(1); for the post-loss careless collector the flux satisfies μ_n ~ (q;q)_∞^{-1} n!/n^n q^{n(n+1)/2} and μ_n T_n converges in distribution to Exp(1).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The finite stationary-entry theorem requires a mixing estimate and a one-block clump-control estimate to hold uniformly for the specific non-monotone chains; these are asserted but their verification for the careless model is not detailed in the abstract.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Stationary-entry flux yields exponential hitting laws for clumsy and careless non-monotone coupon collectors, with explicit asymptotic flux formulas replacing the usual Gumbel scale.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"The stationary-entry flux controls hitting times to completion in non-monotone coupon collector models, producing exponential limits.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"974b4bb897881ada6c17999a26ca3029a4913cc291a679f4e2d1fd0c06c375a4"},"source":{"id":"2605.14511","kind":"arxiv","version":1},"verdict":{"id":"b52c4210-a761-400f-a622-30ba37c68b66","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-15T01:45:53.301839Z","strongest_claim":"For the clumsy collector the stationary-entry flux equals p q^n and p q^n T_n converges in distribution to Exp(1); for the post-loss careless collector the flux satisfies μ_n ~ (q;q)_∞^{-1} n!/n^n q^{n(n+1)/2} and μ_n T_n converges in distribution to Exp(1).","one_line_summary":"Stationary-entry flux yields exponential hitting laws for clumsy and careless non-monotone coupon collectors, with explicit asymptotic flux formulas replacing the usual Gumbel scale.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The finite stationary-entry theorem requires a mixing estimate and a one-block clump-control estimate to hold uniformly for the specific non-monotone chains; these are asserted but their verification for the careless model is not detailed in the abstract.","pith_extraction_headline":"The stationary-entry flux controls hitting times to completion in non-monotone coupon collector models, producing exponential limits."},"references":{"count":15,"sample":[{"doi":"10.1007/978-3-031-76738-8","year":2023,"title":"S. Aggarwal and T. M. Garoni,The clumsy coupon collector, in D. R. Wood, A. M. Etheridge, J. de Gier, and N. Joshi (eds.),2023 MATRIX Annals, MATRIX Book Series, vol. 6, Springer, Cham, 2025, pp. 609–","work_id":"8a5bba91-c97a-4270-a9d7-3784eddf71eb","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2026,"title":"L. J. Attrill and T. M. Garoni,The clumsy coupon collector’s problem, manuscript submitted to arXiv, 2026","work_id":"d31df43b-cc70-443a-9bdd-997bdcd89415","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1016/0304-4149(82)90016-3","year":1982,"title":"D. J. Aldous,Markov chains with almost exponential hitting times, Stochastic Processes and their Applications13(1982), no. 3, 305–310. doi:10.1016/0304-4149(82)90016-3","work_id":"485a381a-9500-4fdd-b4e2-38642d10a04b","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1214/lnms/1215461937","year":1991,"title":"D. J. Aldous and M. Brown,Inequalities for rare events in time-reversible Markov chains. I, in Stochastic Inequalities(Seattle, WA, 1991), IMS Lecture Notes–Monograph Series, vol. 22, Insti- tute of M","work_id":"cc2a1eb6-7e09-4aec-829e-310ec36d03c4","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1976,"title":"G. E. Andrews,The Theory of Partitions, Encyclopedia of Mathematics and Its Applications, vol. 2, Addison-Wesley, Reading, MA, 1976","work_id":"0374c376-e9cd-4108-becb-fb3abbb4be93","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":15,"snapshot_sha256":"fc7da2574ee1bfec92f6238badb70cf27d4316a79ce59338f0b0437973af4989","internal_anchors":1},"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":"b52c4210-a761-400f-a622-30ba37c68b66"},"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:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0SdGvtGaUvkgYIgPgSblENyKDVKB7j3DanDK64YzxRwou8M21nXK7L2S6pjgm3a9rWsPu8rRiA/4kEKzAt2+BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T06:32:46.830822Z"},"content_sha256":"0ab8e6a4c8c285af3bad704dac876d856f454c517f5e5a85c09953401deaa738","schema_version":"1.0","event_id":"sha256:0ab8e6a4c8c285af3bad704dac876d856f454c517f5e5a85c09953401deaa738"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TXNUGIPJY7LFWO643566G3NPC7/bundle.json","state_url":"https://pith.science/pith/TXNUGIPJY7LFWO643566G3NPC7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TXNUGIPJY7LFWO643566G3NPC7/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-30T06:32:46Z","links":{"resolver":"https://pith.science/pith/TXNUGIPJY7LFWO643566G3NPC7","bundle":"https://pith.science/pith/TXNUGIPJY7LFWO643566G3NPC7/bundle.json","state":"https://pith.science/pith/TXNUGIPJY7LFWO643566G3NPC7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TXNUGIPJY7LFWO643566G3NPC7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TXNUGIPJY7LFWO643566G3NPC7","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":"81c22ea4202694620a00ec482261e267af2fdd42bd71f89e889c30ad3ed066a3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T07:55:13Z","title_canon_sha256":"1196d5fb10b15e325886b24009fd782e49bfa158a4105facc5ba1d21781fba2c"},"schema_version":"1.0","source":{"id":"2605.14511","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.14511","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"arxiv_version","alias_value":"2605.14511v1","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.14511","created_at":"2026-05-17T23:39:06Z"},{"alias_kind":"pith_short_12","alias_value":"TXNUGIPJY7LF","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"TXNUGIPJY7LFWO64","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"TXNUGIPJ","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:0ab8e6a4c8c285af3bad704dac876d856f454c517f5e5a85c09953401deaa738","target":"graph","created_at":"2026-05-17T23:39:06Z","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":"For the clumsy collector the stationary-entry flux equals p q^n and p q^n T_n converges in distribution to Exp(1); for the post-loss careless collector the flux satisfies μ_n ~ (q;q)_∞^{-1} n!/n^n q^{n(n+1)/2} and μ_n T_n converges in distribution to Exp(1)."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The finite stationary-entry theorem requires a mixing estimate and a one-block clump-control estimate to hold uniformly for the specific non-monotone chains; these are asserted but their verification for the careless model is not detailed in the abstract."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Stationary-entry flux yields exponential hitting laws for clumsy and careless non-monotone coupon collectors, with explicit asymptotic flux formulas replacing the usual Gumbel scale."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"The stationary-entry flux controls hitting times to completion in non-monotone coupon collector models, producing exponential limits."}],"snapshot_sha256":"974b4bb897881ada6c17999a26ca3029a4913cc291a679f4e2d1fd0c06c375a4"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"We study three nonmonotone coupon-collector models through a stationary-entry viewpoint. In such models the all-present state is not absorbing, so completion is governed not by the disappearance of a monotone terminal cloud but by rare new entries into a target state, except in the reset-button model, where exact regeneration gives a separate reduction.\n  We prove a finite stationary-entry theorem: a mixing estimate, a one-block clump-control estimate, and the stationary entry flux imply an exponential hitting law. For the reset-button collector, regeneration gives an exact probability-generat","authors_text":"Christopher D. Long","cross_cats":["math.CO"],"headline":"The stationary-entry flux controls hitting times to completion in non-monotone coupon collector models, producing exponential limits.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T07:55:13Z","title":"Clumsy and Careless: Stationary-Entry Flux in Non-monotone Coupon Collectors"},"references":{"count":15,"internal_anchors":1,"resolved_work":15,"sample":[{"cited_arxiv_id":"","doi":"10.1007/978-3-031-76738-8","is_internal_anchor":false,"ref_index":1,"title":"S. Aggarwal and T. M. Garoni,The clumsy coupon collector, in D. R. Wood, A. M. Etheridge, J. de Gier, and N. Joshi (eds.),2023 MATRIX Annals, MATRIX Book Series, vol. 6, Springer, Cham, 2025, pp. 609–","work_id":"8a5bba91-c97a-4270-a9d7-3784eddf71eb","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"L. J. Attrill and T. M. Garoni,The clumsy coupon collector’s problem, manuscript submitted to arXiv, 2026","work_id":"d31df43b-cc70-443a-9bdd-997bdcd89415","year":2026},{"cited_arxiv_id":"","doi":"10.1016/0304-4149(82)90016-3","is_internal_anchor":false,"ref_index":3,"title":"D. J. Aldous,Markov chains with almost exponential hitting times, Stochastic Processes and their Applications13(1982), no. 3, 305–310. doi:10.1016/0304-4149(82)90016-3","work_id":"485a381a-9500-4fdd-b4e2-38642d10a04b","year":1982},{"cited_arxiv_id":"","doi":"10.1214/lnms/1215461937","is_internal_anchor":false,"ref_index":4,"title":"D. J. Aldous and M. Brown,Inequalities for rare events in time-reversible Markov chains. I, in Stochastic Inequalities(Seattle, WA, 1991), IMS Lecture Notes–Monograph Series, vol. 22, Insti- tute of M","work_id":"cc2a1eb6-7e09-4aec-829e-310ec36d03c4","year":1991},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"G. E. Andrews,The Theory of Partitions, Encyclopedia of Mathematics and Its Applications, vol. 2, Addison-Wesley, Reading, MA, 1976","work_id":"0374c376-e9cd-4108-becb-fb3abbb4be93","year":1976}],"snapshot_sha256":"fc7da2574ee1bfec92f6238badb70cf27d4316a79ce59338f0b0437973af4989"},"source":{"id":"2605.14511","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-15T01:45:53.301839Z","id":"b52c4210-a761-400f-a622-30ba37c68b66","model_set":{"reader":"grok-4.3"},"one_line_summary":"Stationary-entry flux yields exponential hitting laws for clumsy and careless non-monotone coupon collectors, with explicit asymptotic flux formulas replacing the usual Gumbel scale.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"The stationary-entry flux controls hitting times to completion in non-monotone coupon collector models, producing exponential limits.","strongest_claim":"For the clumsy collector the stationary-entry flux equals p q^n and p q^n T_n converges in distribution to Exp(1); for the post-loss careless collector the flux satisfies μ_n ~ (q;q)_∞^{-1} n!/n^n q^{n(n+1)/2} and μ_n T_n converges in distribution to Exp(1).","weakest_assumption":"The finite stationary-entry theorem requires a mixing estimate and a one-block clump-control estimate to hold uniformly for the specific non-monotone chains; these are asserted but their verification for the careless model is not detailed in the abstract."}},"verdict_id":"b52c4210-a761-400f-a622-30ba37c68b66"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:dd34468f16a66d70a81936b96391430a62d081b092aeb956cf5ea8f2449f1af7","target":"record","created_at":"2026-05-17T23:39:06Z","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":"81c22ea4202694620a00ec482261e267af2fdd42bd71f89e889c30ad3ed066a3","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-14T07:55:13Z","title_canon_sha256":"1196d5fb10b15e325886b24009fd782e49bfa158a4105facc5ba1d21781fba2c"},"schema_version":"1.0","source":{"id":"2605.14511","kind":"arxiv","version":1}},"canonical_sha256":"9ddb4321e9c7d65b3bdcdf7de36daf17ec70db5393ddc3e87eafc065b2cc23c6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ddb4321e9c7d65b3bdcdf7de36daf17ec70db5393ddc3e87eafc065b2cc23c6","first_computed_at":"2026-05-17T23:39:06.192337Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:06.192337Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"8fdvgt5by7DEYb3+BGuuHebcgkNc8BKSeba4+/EwfNtGIqac75j6P5Pq0PWuzixeWxeBzBH9fgGZo3MHZQRIAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:06.193086Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.14511","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:dd34468f16a66d70a81936b96391430a62d081b092aeb956cf5ea8f2449f1af7","sha256:0ab8e6a4c8c285af3bad704dac876d856f454c517f5e5a85c09953401deaa738"],"state_sha256":"ebfef82b2a0de3ad94617e40e0b2677991106b1a7c12b2d5cb021e3497775ec6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vSI8HpOkhy0OWT1Zr253hftBMbU6rCsJKeYv9Toe0d4+QElxW0qAFdJO85uaI88gDB1XKyChlzkDoDYwt1KLBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T06:32:46.833716Z","bundle_sha256":"e60b428035f9d79348ba7d70342e9692d46694b40ae6dd41e7f4fc621b749484"}}