{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RZILCBXJKTBWOC34HAXTGATBM6","short_pith_number":"pith:RZILCBXJ","canonical_record":{"source":{"id":"2605.16848","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-16T07:12:19Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"a72e14f0a7f78f09eada04bf03dc36ca0d9d4cf64d871856be334986c0cb6491","abstract_canon_sha256":"b858adf7b6d06eae85694e2be7d7721a31b81425fdeb69410b992b9fce62cf34"},"schema_version":"1.0"},"canonical_sha256":"8e50b106e954c3670b7c382f330261678e14b3de1f6a250333d961a8291d3d01","source":{"kind":"arxiv","id":"2605.16848","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16848","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16848v1","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16848","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"RZILCBXJKTBW","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_16","alias_value":"RZILCBXJKTBWOC34","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_8","alias_value":"RZILCBXJ","created_at":"2026-05-20T00:03:26Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RZILCBXJKTBWOC34HAXTGATBM6","target":"record","payload":{"canonical_record":{"source":{"id":"2605.16848","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-16T07:12:19Z","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"title_canon_sha256":"a72e14f0a7f78f09eada04bf03dc36ca0d9d4cf64d871856be334986c0cb6491","abstract_canon_sha256":"b858adf7b6d06eae85694e2be7d7721a31b81425fdeb69410b992b9fce62cf34"},"schema_version":"1.0"},"canonical_sha256":"8e50b106e954c3670b7c382f330261678e14b3de1f6a250333d961a8291d3d01","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:03:26.004485Z","signature_b64":"SUu91ccut7rLrDlCgmYOZ95XxTvCanECGImy87DEuYIOniXYuoUkm4sERP1Q7ScxqZmtnYgSEBlDLPioVDaICQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8e50b106e954c3670b7c382f330261678e14b3de1f6a250333d961a8291d3d01","last_reissued_at":"2026-05-20T00:03:26.003656Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:03:26.003656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.16848","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sIQ6QU+Dp+AYEsUqA1dQttnQCTCp66swiLVZDjen7VymhYEgCeva8/92AkeqtoynEpU+rBAEcgdaWvuQM9pTAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:34:09.576447Z"},"content_sha256":"c06fdd954d898aaf2aa7af88dcfe2b26759605b8e716082136416b86c4d3a8c1","schema_version":"1.0","event_id":"sha256:c06fdd954d898aaf2aa7af88dcfe2b26759605b8e716082136416b86c4d3a8c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RZILCBXJKTBWOC34HAXTGATBM6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Thinking with Patterns: Breaking the Perceptual Bottleneck in Visual Planning via Pattern Induction","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Vision-language models overcome perceptual limits in visual planning by inducing reusable patterns that build accurate internal world models step by step.","cross_cats":["cs.AI","cs.CL","cs.LG"],"primary_cat":"cs.CV","authors_text":"Boyuan Xiao, Yao-Xiang Ding, Yichang Jian, Yifei Peng, Zhenyuan Huang","submitted_at":"2026-05-16T07:12:19Z","abstract_excerpt":"Planning from raw visual input remains a significant challenge for current Vision-Language Models (VLMs), when the complexity of input is beyond their one-step perception capability. Motivated by recent advances in Thinking with Images (TWI), a reasonable solution is to decompose the perception process into simpler steps by iteratively acquiring and incorporating local visual evidence. However, even though current VLMs are well-trained in general TWI ability, their perceptual bottleneck in the planning domain remains. To tackle this challenge, we formulate TWI as a tool to gradually build and "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"The resulting training-free planning strategy enables VLMs to solve tasks that are far beyond their initial capabilities, at the cost that too many TWI operations would significantly increase the computational overhead; Pattern Inference and Pattern Induction achieve a desirable balance between accuracy and efficiency.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That visual patterns can be treated as composite and reusable experts which are autonomously discovered and optimized from experience in a way that directly improves inference efficiency without requiring task-specific retraining or external supervision.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Pattern Induction discovers reusable visual patterns as experts via online inductive learning, and Pattern Inference uses them to let VLMs perform efficient multi-step visual planning beyond their native capabilities.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Vision-language models overcome perceptual limits in visual planning by inducing reusable patterns that build accurate internal world models step by step.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"c294cb134a2b2f1b7c9daf37b67e13956d89b52219959b0ba0c91f408cbae945"},"source":{"id":"2605.16848","kind":"arxiv","version":1},"verdict":{"id":"fd5e472c-fb94-465a-86b2-af22e36aba69","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T20:40:10.681899Z","strongest_claim":"The resulting training-free planning strategy enables VLMs to solve tasks that are far beyond their initial capabilities, at the cost that too many TWI operations would significantly increase the computational overhead; Pattern Inference and Pattern Induction achieve a desirable balance between accuracy and efficiency.","one_line_summary":"Pattern Induction discovers reusable visual patterns as experts via online inductive learning, and Pattern Inference uses them to let VLMs perform efficient multi-step visual planning beyond their native capabilities.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That visual patterns can be treated as composite and reusable experts which are autonomously discovered and optimized from experience in a way that directly improves inference efficiency without requiring task-specific retraining or external supervision.","pith_extraction_headline":"Vision-language models overcome perceptual limits in visual planning by inducing reusable patterns that build accurate internal world models step by step."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.16848/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.242682Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T20:51:12.384217Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.316321Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.389385Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"d621e9ba4b9f3cb28e219a88d2ad7a62409507638f2a985aa6798536079fa4b3"},"references":{"count":25,"sample":[{"doi":"","year":null,"title":"On top of this, we plan the shortest path","work_id":"7f6321af-c4fa-4e76-b14f-74dd49c88c6c","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"If there aren’t any unrevealed grids on the path, the algorithm stops and returns the path","work_id":"0ec10c1a-07df-4786-b1f5-be17982b985f","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"If there are, we check the unrevealed grids one by one from start to goal","work_id":"fc6f6b03-0f8e-414b-bf3d-40beb4cd5be9","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"If an impassable grid is ever encountered during this process, we immediately go back to step 1 to get another plan","work_id":"459f3547-8a23-4c23-86dc-ebcad48fa377","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"If all checked grids are passable, the algorithm stops and returns the path. Thepolicy-generation procedureworks at step (4) above. Each time, it outputs the first unrevealed grid from start to goal. ","work_id":"a2a15d64-511f-4c51-bf1d-8573017dae15","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":25,"snapshot_sha256":"ce303876fad08763714cf31a1592dcc6be00e44fecc6091ee1c5c289dd28863b","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9186336b8dbf870eaf5554ad0dea06c701ed5784cc4e089032d5cf3101e448d3"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"fd5e472c-fb94-465a-86b2-af22e36aba69"},"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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"S/X+T2je8vi9IQvB7IVqHAj8SXGI3FIlJx5uMGJnVnFQyWJs10u5SrQfihI8zuaw2/DglOzyDZAUMDVki9vBAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T07:34:09.578014Z"},"content_sha256":"140955ef1eb0dfb02d751a13de6d1459b00e73a6fd4897ef0f01491996b7cf4f","schema_version":"1.0","event_id":"sha256:140955ef1eb0dfb02d751a13de6d1459b00e73a6fd4897ef0f01491996b7cf4f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RZILCBXJKTBWOC34HAXTGATBM6/bundle.json","state_url":"https://pith.science/pith/RZILCBXJKTBWOC34HAXTGATBM6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RZILCBXJKTBWOC34HAXTGATBM6/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-11T07:34:09Z","links":{"resolver":"https://pith.science/pith/RZILCBXJKTBWOC34HAXTGATBM6","bundle":"https://pith.science/pith/RZILCBXJKTBWOC34HAXTGATBM6/bundle.json","state":"https://pith.science/pith/RZILCBXJKTBWOC34HAXTGATBM6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RZILCBXJKTBWOC34HAXTGATBM6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RZILCBXJKTBWOC34HAXTGATBM6","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":"b858adf7b6d06eae85694e2be7d7721a31b81425fdeb69410b992b9fce62cf34","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-16T07:12:19Z","title_canon_sha256":"a72e14f0a7f78f09eada04bf03dc36ca0d9d4cf64d871856be334986c0cb6491"},"schema_version":"1.0","source":{"id":"2605.16848","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.16848","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"arxiv_version","alias_value":"2605.16848v1","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.16848","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_12","alias_value":"RZILCBXJKTBW","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_16","alias_value":"RZILCBXJKTBWOC34","created_at":"2026-05-20T00:03:26Z"},{"alias_kind":"pith_short_8","alias_value":"RZILCBXJ","created_at":"2026-05-20T00:03:26Z"}],"graph_snapshots":[{"event_id":"sha256:140955ef1eb0dfb02d751a13de6d1459b00e73a6fd4897ef0f01491996b7cf4f","target":"graph","created_at":"2026-05-20T00:03:26Z","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":"The resulting training-free planning strategy enables VLMs to solve tasks that are far beyond their initial capabilities, at the cost that too many TWI operations would significantly increase the computational overhead; Pattern Inference and Pattern Induction achieve a desirable balance between accuracy and efficiency."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That visual patterns can be treated as composite and reusable experts which are autonomously discovered and optimized from experience in a way that directly improves inference efficiency without requiring task-specific retraining or external supervision."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Pattern Induction discovers reusable visual patterns as experts via online inductive learning, and Pattern Inference uses them to let VLMs perform efficient multi-step visual planning beyond their native capabilities."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Vision-language models overcome perceptual limits in visual planning by inducing reusable patterns that build accurate internal world models step by step."}],"snapshot_sha256":"c294cb134a2b2f1b7c9daf37b67e13956d89b52219959b0ba0c91f408cbae945"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9186336b8dbf870eaf5554ad0dea06c701ed5784cc4e089032d5cf3101e448d3"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T21:01:19.242682Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T20:51:12.384217Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T18:41:56.316321Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T18:33:26.389385Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.16848/integrity.json","findings":[],"snapshot_sha256":"d621e9ba4b9f3cb28e219a88d2ad7a62409507638f2a985aa6798536079fa4b3","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Planning from raw visual input remains a significant challenge for current Vision-Language Models (VLMs), when the complexity of input is beyond their one-step perception capability. Motivated by recent advances in Thinking with Images (TWI), a reasonable solution is to decompose the perception process into simpler steps by iteratively acquiring and incorporating local visual evidence. However, even though current VLMs are well-trained in general TWI ability, their perceptual bottleneck in the planning domain remains. To tackle this challenge, we formulate TWI as a tool to gradually build and ","authors_text":"Boyuan Xiao, Yao-Xiang Ding, Yichang Jian, Yifei Peng, Zhenyuan Huang","cross_cats":["cs.AI","cs.CL","cs.LG"],"headline":"Vision-language models overcome perceptual limits in visual planning by inducing reusable patterns that build accurate internal world models step by step.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-16T07:12:19Z","title":"Thinking with Patterns: Breaking the Perceptual Bottleneck in Visual Planning via Pattern Induction"},"references":{"count":25,"internal_anchors":0,"resolved_work":25,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"On top of this, we plan the shortest path","work_id":"7f6321af-c4fa-4e76-b14f-74dd49c88c6c","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"If there aren’t any unrevealed grids on the path, the algorithm stops and returns the path","work_id":"0ec10c1a-07df-4786-b1f5-be17982b985f","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"If there are, we check the unrevealed grids one by one from start to goal","work_id":"fc6f6b03-0f8e-414b-bf3d-40beb4cd5be9","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"If an impassable grid is ever encountered during this process, we immediately go back to step 1 to get another plan","work_id":"459f3547-8a23-4c23-86dc-ebcad48fa377","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"If all checked grids are passable, the algorithm stops and returns the path. Thepolicy-generation procedureworks at step (4) above. Each time, it outputs the first unrevealed grid from start to goal. ","work_id":"a2a15d64-511f-4c51-bf1d-8573017dae15","year":2025}],"snapshot_sha256":"ce303876fad08763714cf31a1592dcc6be00e44fecc6091ee1c5c289dd28863b"},"source":{"id":"2605.16848","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T20:40:10.681899Z","id":"fd5e472c-fb94-465a-86b2-af22e36aba69","model_set":{"reader":"grok-4.3"},"one_line_summary":"Pattern Induction discovers reusable visual patterns as experts via online inductive learning, and Pattern Inference uses them to let VLMs perform efficient multi-step visual planning beyond their native capabilities.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Vision-language models overcome perceptual limits in visual planning by inducing reusable patterns that build accurate internal world models step by step.","strongest_claim":"The resulting training-free planning strategy enables VLMs to solve tasks that are far beyond their initial capabilities, at the cost that too many TWI operations would significantly increase the computational overhead; Pattern Inference and Pattern Induction achieve a desirable balance between accuracy and efficiency.","weakest_assumption":"That visual patterns can be treated as composite and reusable experts which are autonomously discovered and optimized from experience in a way that directly improves inference efficiency without requiring task-specific retraining or external supervision."}},"verdict_id":"fd5e472c-fb94-465a-86b2-af22e36aba69"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c06fdd954d898aaf2aa7af88dcfe2b26759605b8e716082136416b86c4d3a8c1","target":"record","created_at":"2026-05-20T00:03:26Z","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":"b858adf7b6d06eae85694e2be7d7721a31b81425fdeb69410b992b9fce62cf34","cross_cats_sorted":["cs.AI","cs.CL","cs.LG"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2026-05-16T07:12:19Z","title_canon_sha256":"a72e14f0a7f78f09eada04bf03dc36ca0d9d4cf64d871856be334986c0cb6491"},"schema_version":"1.0","source":{"id":"2605.16848","kind":"arxiv","version":1}},"canonical_sha256":"8e50b106e954c3670b7c382f330261678e14b3de1f6a250333d961a8291d3d01","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8e50b106e954c3670b7c382f330261678e14b3de1f6a250333d961a8291d3d01","first_computed_at":"2026-05-20T00:03:26.003656Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:03:26.003656Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SUu91ccut7rLrDlCgmYOZ95XxTvCanECGImy87DEuYIOniXYuoUkm4sERP1Q7ScxqZmtnYgSEBlDLPioVDaICQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:03:26.004485Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.16848","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c06fdd954d898aaf2aa7af88dcfe2b26759605b8e716082136416b86c4d3a8c1","sha256:140955ef1eb0dfb02d751a13de6d1459b00e73a6fd4897ef0f01491996b7cf4f"],"state_sha256":"d44744236a2c454289c3107bb63653525f4276d9a1d153c0c12613c4582a7e51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GRLMAY7PW07Txc5jpm4wvKTgxZBemUpmR5UKRQHOMhvJoGXTkxWYs6HII/O/Q7oV6YuDMAnK8AHnTsFosGVRCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T07:34:09.583962Z","bundle_sha256":"2c06155dd5e12c447ea1af27a0aacef39d4a0fed3b5d4c275e4ac377bd32db5a"}}