{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BONJSSDX5CAW4IRTLQ2SYLXCH3","short_pith_number":"pith:BONJSSDX","canonical_record":{"source":{"id":"2605.15449","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T22:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"9303d91a6ba606d240d8cb1b9ecf62c1d86d541a26e2209904c8a694aa0493ad","abstract_canon_sha256":"a101dc6d41fcefa4c4039f958d97216b807b35aaae951f057191cc9f39688632"},"schema_version":"1.0"},"canonical_sha256":"0b9a994877e8816e22335c352c2ee23ee3e0645873d71abf3739c945943d70a6","source":{"kind":"arxiv","id":"2605.15449","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15449","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15449v1","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15449","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"BONJSSDX5CAW","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"BONJSSDX5CAW4IRT","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"BONJSSDX","created_at":"2026-05-20T00:00:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BONJSSDX5CAW4IRTLQ2SYLXCH3","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15449","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T22:19:03Z","cross_cats_sorted":[],"title_canon_sha256":"9303d91a6ba606d240d8cb1b9ecf62c1d86d541a26e2209904c8a694aa0493ad","abstract_canon_sha256":"a101dc6d41fcefa4c4039f958d97216b807b35aaae951f057191cc9f39688632"},"schema_version":"1.0"},"canonical_sha256":"0b9a994877e8816e22335c352c2ee23ee3e0645873d71abf3739c945943d70a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:59.213454Z","signature_b64":"IKHUCrtqZWqPBOLEHH1/Ul/w3t15yDd4V2iTACj0GxJpx9+ntsiRsAl+VY3Jl0FJZCTxNzlS2Se0VjqfsqY3DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0b9a994877e8816e22335c352c2ee23ee3e0645873d71abf3739c945943d70a6","last_reissued_at":"2026-05-20T00:00:59.212690Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:59.212690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15449","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:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZjbkVbH2JFICUd+uSdlNMSElude9IADki5JArOTGU4dlPHSvfeUJB2pkT6EXxFMGQXy5CbVHry2nPnvVCAVbBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:55:55.468798Z"},"content_sha256":"3d8a7306cd53cda5a524b2357c6e9628e58fcd5fdb68d898466cd58ff5c77a60","schema_version":"1.0","event_id":"sha256:3d8a7306cd53cda5a524b2357c6e9628e58fcd5fdb68d898466cd58ff5c77a60"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BONJSSDX5CAW4IRTLQ2SYLXCH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"Under some condition all interior vertices of an admissible n-turn path between two points lie in a specific region, and every admissible sequence of corner points admits an explicit description.","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nefedov V.N","submitted_at":"2026-05-14T22:19:03Z","abstract_excerpt":"We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed bound). Under some condition, we characterize the region to which all interior vertices of such a path must belong (Theorem 1). It is shown that for any point from this region, there exists a polygonal line satisfying the given constraints (Lemma 1). Based on these findings, an explicit expression is derived (Theorem 2) that describes the collection of all admiss"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"Under some condition, all interior vertices of an admissible n-turn polygonal line belong to a specific region (Theorem 1); an explicit expression describes the collection of all admissible sequences of corner points (Theorem 2), which is then approximated by a finite family for optimization algorithms.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The unspecified 'some condition' under which the region characterization in Theorem 1 holds; without knowing or verifying this condition the claimed region and subsequent sequence expression may not apply to the general case.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Characterizes admissible regions and sequences for bounded-turn n-segment paths and builds finite approximations for optimization algorithms.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Under some condition all interior vertices of an admissible n-turn path between two points lie in a specific region, and every admissible sequence of corner points admits an explicit description.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"72ab88f7d6758cd64e95f410dbfbb30fabbb34b6f2579a7b0d1538d6fb833ea1"},"source":{"id":"2605.15449","kind":"arxiv","version":1},"verdict":{"id":"fbab1034-7a83-4fef-91ee-0eb2d723fef1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T14:28:53.803238Z","strongest_claim":"Under some condition, all interior vertices of an admissible n-turn polygonal line belong to a specific region (Theorem 1); an explicit expression describes the collection of all admissible sequences of corner points (Theorem 2), which is then approximated by a finite family for optimization algorithms.","one_line_summary":"Characterizes admissible regions and sequences for bounded-turn n-segment paths and builds finite approximations for optimization algorithms.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The unspecified 'some condition' under which the region characterization in Theorem 1 holds; without knowing or verifying this condition the claimed region and subsequent sequence expression may not apply to the general case.","pith_extraction_headline":"Under some condition all interior vertices of an admissible n-turn path between two points lie in a specific region, and every admissible sequence of corner points admits an explicit description."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15449/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T15:51:56.241280Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:05.014142Z","status":"completed","version":"0.1.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.619014Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T14:37:53.784045Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.111784Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.679079Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"8387b51787707c67299733f625fa021c1c5e92e388d2427aad87f392f325fcde"},"references":{"count":8,"sample":[{"doi":"","year":2025,"title":"Methods of Approximation of Two Dimensional Sets by Finite Sets and Their Application to Some Geometric Optimization 99 Problems","work_id":"82c34db7-95b7-460e-ac6c-d9fe5e3e3b2f","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"Problem of Finding an Optimal Piecewise Linear Route with n Turns","work_id":"d947a47a-6376-4a44-95e4-95c2180fe03e","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Dynamic Programming","work_id":"223006b2-9e82-46ac-8374-d6abedfcc670","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. 4th ed. Cambridge, MA: The MIT Press, 2022","work_id":"2785987d-8988-49f4-aed2-fb9d1c43caf7","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2006,"title":"Papadimitriou, and Umesh Vazirani","work_id":"5b46984e-11e1-4a92-9e3e-894a3814310d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":8,"snapshot_sha256":"b5281afc58449ecabbd9641b0e9d8b57ec1dfa9ce5db42b2ad48e6b6f22eabae","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3e89b357e0bdbfed24d589890de381715409fd19b8ebfde65f30db409bc2b0fd"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"fbab1034-7a83-4fef-91ee-0eb2d723fef1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:00:59Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8L5cAiL9wh5KPunftafxWGMBcemb1yA3iDYYGQxIO4i3Fv1oCQ2Qh3nq39F+2sZ444oVY7ynOxESOVvCeIGpDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T03:55:55.469805Z"},"content_sha256":"1105374363da18cdffbaa6817ab93f9797498e521ebfd52afc7d4969f60e87a5","schema_version":"1.0","event_id":"sha256:1105374363da18cdffbaa6817ab93f9797498e521ebfd52afc7d4969f60e87a5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BONJSSDX5CAW4IRTLQ2SYLXCH3/bundle.json","state_url":"https://pith.science/pith/BONJSSDX5CAW4IRTLQ2SYLXCH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BONJSSDX5CAW4IRTLQ2SYLXCH3/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-11T03:55:55Z","links":{"resolver":"https://pith.science/pith/BONJSSDX5CAW4IRTLQ2SYLXCH3","bundle":"https://pith.science/pith/BONJSSDX5CAW4IRTLQ2SYLXCH3/bundle.json","state":"https://pith.science/pith/BONJSSDX5CAW4IRTLQ2SYLXCH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BONJSSDX5CAW4IRTLQ2SYLXCH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BONJSSDX5CAW4IRTLQ2SYLXCH3","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":"a101dc6d41fcefa4c4039f958d97216b807b35aaae951f057191cc9f39688632","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T22:19:03Z","title_canon_sha256":"9303d91a6ba606d240d8cb1b9ecf62c1d86d541a26e2209904c8a694aa0493ad"},"schema_version":"1.0","source":{"id":"2605.15449","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15449","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15449v1","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15449","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_12","alias_value":"BONJSSDX5CAW","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_16","alias_value":"BONJSSDX5CAW4IRT","created_at":"2026-05-20T00:00:59Z"},{"alias_kind":"pith_short_8","alias_value":"BONJSSDX","created_at":"2026-05-20T00:00:59Z"}],"graph_snapshots":[{"event_id":"sha256:1105374363da18cdffbaa6817ab93f9797498e521ebfd52afc7d4969f60e87a5","target":"graph","created_at":"2026-05-20T00:00:59Z","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":"Under some condition, all interior vertices of an admissible n-turn polygonal line belong to a specific region (Theorem 1); an explicit expression describes the collection of all admissible sequences of corner points (Theorem 2), which is then approximated by a finite family for optimization algorithms."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The unspecified 'some condition' under which the region characterization in Theorem 1 holds; without knowing or verifying this condition the claimed region and subsequent sequence expression may not apply to the general case."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Characterizes admissible regions and sequences for bounded-turn n-segment paths and builds finite approximations for optimization algorithms."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Under some condition all interior vertices of an admissible n-turn path between two points lie in a specific region, and every admissible sequence of corner points admits an explicit description."}],"snapshot_sha256":"72ab88f7d6758cd64e95f410dbfbb30fabbb34b6f2579a7b0d1538d6fb833ea1"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"3e89b357e0bdbfed24d589890de381715409fd19b8ebfde65f30db409bc2b0fd"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T15:51:56.241280Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:05.014142Z","status":"completed","version":"0.1.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T15:01:17.619014Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T14:37:53.784045Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.111784Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.679079Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15449/integrity.json","findings":[],"snapshot_sha256":"8387b51787707c67299733f625fa021c1c5e92e388d2427aad87f392f325fcde","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of finding an optimal piecewise linear path (polygonal line) connecting two given points with the possibility of making n turns at some points (the absolute value of each turn angle does not exceed a prescribed bound). Under some condition, we characterize the region to which all interior vertices of such a path must belong (Theorem 1). It is shown that for any point from this region, there exists a polygonal line satisfying the given constraints (Lemma 1). Based on these findings, an explicit expression is derived (Theorem 2) that describes the collection of all admiss","authors_text":"Nefedov V.N","cross_cats":[],"headline":"Under some condition all interior vertices of an admissible n-turn path between two points lie in a specific region, and every admissible sequence of corner points admits an explicit description.","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T22:19:03Z","title":"Problem of Finding an Optimal Piecewise Linear Path Connecting Two Given Points with the Possibility of Making n Turns"},"references":{"count":8,"internal_anchors":0,"resolved_work":8,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Methods of Approximation of Two Dimensional Sets by Finite Sets and Their Application to Some Geometric Optimization 99 Problems","work_id":"82c34db7-95b7-460e-ac6c-d9fe5e3e3b2f","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Problem of Finding an Optimal Piecewise Linear Route with n Turns","work_id":"d947a47a-6376-4a44-95e4-95c2180fe03e","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Dynamic Programming","work_id":"223006b2-9e82-46ac-8374-d6abedfcc670","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"Cormen, Thomas H., Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. 4th ed. Cambridge, MA: The MIT Press, 2022","work_id":"2785987d-8988-49f4-aed2-fb9d1c43caf7","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"Papadimitriou, and Umesh Vazirani","work_id":"5b46984e-11e1-4a92-9e3e-894a3814310d","year":2006}],"snapshot_sha256":"b5281afc58449ecabbd9641b0e9d8b57ec1dfa9ce5db42b2ad48e6b6f22eabae"},"source":{"id":"2605.15449","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T14:28:53.803238Z","id":"fbab1034-7a83-4fef-91ee-0eb2d723fef1","model_set":{"reader":"grok-4.3"},"one_line_summary":"Characterizes admissible regions and sequences for bounded-turn n-segment paths and builds finite approximations for optimization algorithms.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Under some condition all interior vertices of an admissible n-turn path between two points lie in a specific region, and every admissible sequence of corner points admits an explicit description.","strongest_claim":"Under some condition, all interior vertices of an admissible n-turn polygonal line belong to a specific region (Theorem 1); an explicit expression describes the collection of all admissible sequences of corner points (Theorem 2), which is then approximated by a finite family for optimization algorithms.","weakest_assumption":"The unspecified 'some condition' under which the region characterization in Theorem 1 holds; without knowing or verifying this condition the claimed region and subsequent sequence expression may not apply to the general case."}},"verdict_id":"fbab1034-7a83-4fef-91ee-0eb2d723fef1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:3d8a7306cd53cda5a524b2357c6e9628e58fcd5fdb68d898466cd58ff5c77a60","target":"record","created_at":"2026-05-20T00:00:59Z","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":"a101dc6d41fcefa4c4039f958d97216b807b35aaae951f057191cc9f39688632","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.OC","submitted_at":"2026-05-14T22:19:03Z","title_canon_sha256":"9303d91a6ba606d240d8cb1b9ecf62c1d86d541a26e2209904c8a694aa0493ad"},"schema_version":"1.0","source":{"id":"2605.15449","kind":"arxiv","version":1}},"canonical_sha256":"0b9a994877e8816e22335c352c2ee23ee3e0645873d71abf3739c945943d70a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0b9a994877e8816e22335c352c2ee23ee3e0645873d71abf3739c945943d70a6","first_computed_at":"2026-05-20T00:00:59.212690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:59.212690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IKHUCrtqZWqPBOLEHH1/Ul/w3t15yDd4V2iTACj0GxJpx9+ntsiRsAl+VY3Jl0FJZCTxNzlS2Se0VjqfsqY3DA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:59.213454Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15449","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3d8a7306cd53cda5a524b2357c6e9628e58fcd5fdb68d898466cd58ff5c77a60","sha256:1105374363da18cdffbaa6817ab93f9797498e521ebfd52afc7d4969f60e87a5"],"state_sha256":"419202f1217dbdcd3555c17bbb8740649a6144a62ff03fb8b49ddade25aa8e36"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v761aoCDNEWpSWsziQ9OPHrH6TzNfgp+BoQ+b+NDVuKPlKRepxeI0wcHlmiUZ6fqftZNMzpudj0GlTC36fZwAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T03:55:55.474005Z","bundle_sha256":"f3981f0e407928dc38f454de1e7dddf26e96ec6b85d54d2aefea25cf6fcdbaa3"}}