{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:OLCEGV2KOBFU4BNZRZHYVECXML","short_pith_number":"pith:OLCEGV2K","canonical_record":{"source":{"id":"2605.17513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-17T15:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"1d6b6267c1192ccb8299e38ed40795829ea6d55716b68eaf66c5f604f61adea4","abstract_canon_sha256":"6178b6e1ecb9676f21875bbe2e5b79aedbaa26be71ebc8f59853defaee686371"},"schema_version":"1.0"},"canonical_sha256":"72c443574a704b4e05b98e4f8a905762e891b11a9a107c2b76b67bcc98037157","source":{"kind":"arxiv","id":"2605.17513","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17513","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17513v1","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17513","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"OLCEGV2KOBFU","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"OLCEGV2KOBFU4BNZ","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"OLCEGV2K","created_at":"2026-05-20T00:04:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:OLCEGV2KOBFU4BNZRZHYVECXML","target":"record","payload":{"canonical_record":{"source":{"id":"2605.17513","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-17T15:57:39Z","cross_cats_sorted":[],"title_canon_sha256":"1d6b6267c1192ccb8299e38ed40795829ea6d55716b68eaf66c5f604f61adea4","abstract_canon_sha256":"6178b6e1ecb9676f21875bbe2e5b79aedbaa26be71ebc8f59853defaee686371"},"schema_version":"1.0"},"canonical_sha256":"72c443574a704b4e05b98e4f8a905762e891b11a9a107c2b76b67bcc98037157","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:04:43.165166Z","signature_b64":"JmTqmiR1a3ndXpgZYTa7WpyDMSjJRGcOZUxen4K78ZK5wrbEV5AHPIQxSjo7YCdc3LPnU35Qdzf/qX2liJVKDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72c443574a704b4e05b98e4f8a905762e891b11a9a107c2b76b67bcc98037157","last_reissued_at":"2026-05-20T00:04:43.164463Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:04:43.164463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.17513","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:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"24S6RfehOFwkdcHQ7xya8PbDFzy8VIAxa9qiiYVBuVsOvJ531MIEPhMR9UwpAiBIZAk0ljvAGBQdnwGdHRv+CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:40:16.669395Z"},"content_sha256":"3c2956c7847948d46d3228b86601635122c44e52c40aa0b8f80ab8e4b589c9b9","schema_version":"1.0","event_id":"sha256:3c2956c7847948d46d3228b86601635122c44e52c40aa0b8f80ab8e4b589c9b9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:OLCEGV2KOBFU4BNZRZHYVECXML","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Nonconcentration of hitting times for random walks on graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Hitting times of random walks on graphs have variance at least the square of their mean divided by one plus the log of the number of vertices.","cross_cats":[],"primary_cat":"math.PR","authors_text":"Rafael Chiclana","submitted_at":"2026-05-17T15:57:39Z","abstract_excerpt":"We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with $n$ vertices, \\[ \\operatorname{Var}_x(\\tau_y)+\\mathbb E_x\\tau_y \\ge \\frac{(\\mathbb E_x\\tau_y)^2}{1+\\log n}, \\] with the logarithmic term sharp up to constants. Under a bounded-degree assumption the additive mean term can be removed, giving a variance lower bound depending only on \\(\\mathbb E_x\\tau_y\\) and the graph distance \\(\\dist(x,y)\\). We show that this degree assumption is necessary by constructing high-degree graphs with linear mean and bounded variance; the s"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"For every connected graph with n vertices, Var_x(τ_y) + E_x τ_y ≥ (E_x τ_y)^2 / (1 + log n), with the logarithmic term sharp up to constants; under bounded degree the additive term can be removed.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The random walk is the simple symmetric random walk on an undirected connected finite graph; the constructions rely on specific high-degree vertex placements that keep variance bounded while making mean linear.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Hitting times of random walks on graphs have variance at least the square of their mean divided by one plus the log of the number of vertices.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9ae38250d799ed2016c7db10847b4f266af5fa828564c963d2516ee97f19c5e7"},"source":{"id":"2605.17513","kind":"arxiv","version":1},"verdict":{"id":"2ccd9d4d-dc01-4a27-8a7d-3f6f448a8b71","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T22:37:18.247183Z","strongest_claim":"For every connected graph with n vertices, Var_x(τ_y) + E_x τ_y ≥ (E_x τ_y)^2 / (1 + log n), with the logarithmic term sharp up to constants; under bounded degree the additive term can be removed.","one_line_summary":"Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The random walk is the simple symmetric random walk on an undirected connected finite graph; the constructions rely on specific high-degree vertex placements that keep variance bounded while making mean linear.","pith_extraction_headline":"Hitting times of random walks on graphs have variance at least the square of their mean divided by one plus the log of the number of vertices."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.17513/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.518429Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T22:51:32.003569Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.653064Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.629291Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"9be09ad45f3257a1042cbfa8eea89d9d6c67df878e8cdfb144fc68d31b86fe69"},"references":{"count":54,"sample":[{"doi":"10.1214/17-aop1189","year":2018,"title":"Random walks on the random graph , JOURNAL =","work_id":"96ff4b03-be4e-423b-bba5-b83a65193961","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1215/00127094-2010-029","year":2010,"title":"Lubetzky, Eyal and Sly, Allan , TITLE =. Duke Math. J. , FJOURNAL =. 2010 , NUMBER =. doi:10.1215/00127094-2010-029 , URL =","work_id":"8150dc15-9b72-47dc-bea3-7835a09194d5","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2012,"title":"arXiv preprint arXiv:2012.11484 , year=","work_id":"d2f229c1-4ae5-4a14-bc54-d933229a4297","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1090/mbk/107","year":2017,"title":"and Peres, Yuval , TITLE =","work_id":"e0f1d359-5079-4aa3-9d83-01ffb50fc068","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1239/jap/1389370092","year":2013,"title":"Chen, Guan-Yu and Saloff-Coste, Laurent , TITLE =. J. Appl. Probab. , FJOURNAL =. 2013 , NUMBER =. doi:10.1239/jap/1389370092 , URL =","work_id":"d35491ee-aece-41d2-b4c7-c716c09d6404","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":54,"snapshot_sha256":"158d78eedbd355e816a457a64b8bdfab77b14d2f21b6c997b0a1d970a59faddd","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ade0cb3d402c391939ad0f535990ea4bc5e49c3b3de1dcc935d90b93834f9fb7"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"2ccd9d4d-dc01-4a27-8a7d-3f6f448a8b71"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:04:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5P6a0HK4vYO0Rf+01I8glz74Pc0+Rmn8zsGEhZ8HReecj6y42cc1xLjnvTLtyM6PGCnJO3/N1h898PlB2yVgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T12:40:16.670189Z"},"content_sha256":"102b21e547258551a4b3d63760ace5a6f146c895e34d8c342f0fde5d98005e7a","schema_version":"1.0","event_id":"sha256:102b21e547258551a4b3d63760ace5a6f146c895e34d8c342f0fde5d98005e7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OLCEGV2KOBFU4BNZRZHYVECXML/bundle.json","state_url":"https://pith.science/pith/OLCEGV2KOBFU4BNZRZHYVECXML/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OLCEGV2KOBFU4BNZRZHYVECXML/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-25T12:40:16Z","links":{"resolver":"https://pith.science/pith/OLCEGV2KOBFU4BNZRZHYVECXML","bundle":"https://pith.science/pith/OLCEGV2KOBFU4BNZRZHYVECXML/bundle.json","state":"https://pith.science/pith/OLCEGV2KOBFU4BNZRZHYVECXML/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OLCEGV2KOBFU4BNZRZHYVECXML/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:OLCEGV2KOBFU4BNZRZHYVECXML","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":"6178b6e1ecb9676f21875bbe2e5b79aedbaa26be71ebc8f59853defaee686371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-17T15:57:39Z","title_canon_sha256":"1d6b6267c1192ccb8299e38ed40795829ea6d55716b68eaf66c5f604f61adea4"},"schema_version":"1.0","source":{"id":"2605.17513","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.17513","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"arxiv_version","alias_value":"2605.17513v1","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.17513","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"pith_short_12","alias_value":"OLCEGV2KOBFU","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"pith_short_16","alias_value":"OLCEGV2KOBFU4BNZ","created_at":"2026-05-20T00:04:43Z"},{"alias_kind":"pith_short_8","alias_value":"OLCEGV2K","created_at":"2026-05-20T00:04:43Z"}],"graph_snapshots":[{"event_id":"sha256:102b21e547258551a4b3d63760ace5a6f146c895e34d8c342f0fde5d98005e7a","target":"graph","created_at":"2026-05-20T00:04:43Z","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 every connected graph with n vertices, Var_x(τ_y) + E_x τ_y ≥ (E_x τ_y)^2 / (1 + log n), with the logarithmic term sharp up to constants; under bounded degree the additive term can be removed."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The random walk is the simple symmetric random walk on an undirected connected finite graph; the constructions rely on specific high-degree vertex placements that keep variance bounded while making mean linear."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Hitting times of random walks on graphs have variance at least the square of their mean divided by one plus the log of the number of vertices."}],"snapshot_sha256":"9ae38250d799ed2016c7db10847b4f266af5fa828564c963d2516ee97f19c5e7"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"ade0cb3d402c391939ad0f535990ea4bc5e49c3b3de1dcc935d90b93834f9fb7"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T23:01:19.518429Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T22:51:32.003569Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T21:41:57.653064Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T21:33:23.629291Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.17513/integrity.json","findings":[],"snapshot_sha256":"9be09ad45f3257a1042cbfa8eea89d9d6c67df878e8cdfb144fc68d31b86fe69","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We study nonconcentration of hitting times for simple random walk on finite graphs. We prove that, for every connected graph with $n$ vertices, \\[ \\operatorname{Var}_x(\\tau_y)+\\mathbb E_x\\tau_y \\ge \\frac{(\\mathbb E_x\\tau_y)^2}{1+\\log n}, \\] with the logarithmic term sharp up to constants. Under a bounded-degree assumption the additive mean term can be removed, giving a variance lower bound depending only on \\(\\mathbb E_x\\tau_y\\) and the graph distance \\(\\dist(x,y)\\). We show that this degree assumption is necessary by constructing high-degree graphs with linear mean and bounded variance; the s","authors_text":"Rafael Chiclana","cross_cats":[],"headline":"Hitting times of random walks on graphs have variance at least the square of their mean divided by one plus the log of the number of vertices.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-17T15:57:39Z","title":"Nonconcentration of hitting times for random walks on graphs"},"references":{"count":54,"internal_anchors":0,"resolved_work":54,"sample":[{"cited_arxiv_id":"","doi":"10.1214/17-aop1189","is_internal_anchor":false,"ref_index":1,"title":"Random walks on the random graph , JOURNAL =","work_id":"96ff4b03-be4e-423b-bba5-b83a65193961","year":2018},{"cited_arxiv_id":"","doi":"10.1215/00127094-2010-029","is_internal_anchor":false,"ref_index":2,"title":"Lubetzky, Eyal and Sly, Allan , TITLE =. Duke Math. J. , FJOURNAL =. 2010 , NUMBER =. doi:10.1215/00127094-2010-029 , URL =","work_id":"8150dc15-9b72-47dc-bea3-7835a09194d5","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"arXiv preprint arXiv:2012.11484 , year=","work_id":"d2f229c1-4ae5-4a14-bc54-d933229a4297","year":2012},{"cited_arxiv_id":"","doi":"10.1090/mbk/107","is_internal_anchor":false,"ref_index":4,"title":"and Peres, Yuval , TITLE =","work_id":"e0f1d359-5079-4aa3-9d83-01ffb50fc068","year":2017},{"cited_arxiv_id":"","doi":"10.1239/jap/1389370092","is_internal_anchor":false,"ref_index":5,"title":"Chen, Guan-Yu and Saloff-Coste, Laurent , TITLE =. J. Appl. Probab. , FJOURNAL =. 2013 , NUMBER =. doi:10.1239/jap/1389370092 , URL =","work_id":"d35491ee-aece-41d2-b4c7-c716c09d6404","year":2013}],"snapshot_sha256":"158d78eedbd355e816a457a64b8bdfab77b14d2f21b6c997b0a1d970a59faddd"},"source":{"id":"2605.17513","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T22:37:18.247183Z","id":"2ccd9d4d-dc01-4a27-8a7d-3f6f448a8b71","model_set":{"reader":"grok-4.3"},"one_line_summary":"Establishes variance lower bounds for hitting times of random walks on graphs and disproves a conjecture on local nonconcentration via high-degree constructions.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Hitting times of random walks on graphs have variance at least the square of their mean divided by one plus the log of the number of vertices.","strongest_claim":"For every connected graph with n vertices, Var_x(τ_y) + E_x τ_y ≥ (E_x τ_y)^2 / (1 + log n), with the logarithmic term sharp up to constants; under bounded degree the additive term can be removed.","weakest_assumption":"The random walk is the simple symmetric random walk on an undirected connected finite graph; the constructions rely on specific high-degree vertex placements that keep variance bounded while making mean linear."}},"verdict_id":"2ccd9d4d-dc01-4a27-8a7d-3f6f448a8b71"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3c2956c7847948d46d3228b86601635122c44e52c40aa0b8f80ab8e4b589c9b9","target":"record","created_at":"2026-05-20T00:04:43Z","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":"6178b6e1ecb9676f21875bbe2e5b79aedbaa26be71ebc8f59853defaee686371","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.PR","submitted_at":"2026-05-17T15:57:39Z","title_canon_sha256":"1d6b6267c1192ccb8299e38ed40795829ea6d55716b68eaf66c5f604f61adea4"},"schema_version":"1.0","source":{"id":"2605.17513","kind":"arxiv","version":1}},"canonical_sha256":"72c443574a704b4e05b98e4f8a905762e891b11a9a107c2b76b67bcc98037157","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"72c443574a704b4e05b98e4f8a905762e891b11a9a107c2b76b67bcc98037157","first_computed_at":"2026-05-20T00:04:43.164463Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:04:43.164463Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JmTqmiR1a3ndXpgZYTa7WpyDMSjJRGcOZUxen4K78ZK5wrbEV5AHPIQxSjo7YCdc3LPnU35Qdzf/qX2liJVKDg==","signature_status":"signed_v1","signed_at":"2026-05-20T00:04:43.165166Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.17513","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c2956c7847948d46d3228b86601635122c44e52c40aa0b8f80ab8e4b589c9b9","sha256:102b21e547258551a4b3d63760ace5a6f146c895e34d8c342f0fde5d98005e7a"],"state_sha256":"e2e0622509286e7b1ba89cdfed793f936bb22dc0568f3c1dcf3266f8ede14da1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7kM7vnRPAvqog6t1bKZv52T8qVLuZcjf4YVjXSd+TEnuB3q8o01ARQkJk7IKhdjPqklPkbKTg1n0/pxXdlh/AQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T12:40:16.674246Z","bundle_sha256":"5982289dd77d7017ff8b1a11b41de6ffad8b84118c86d1505c21257e4b977db3"}}