{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:AU4OE26SURC4YOGHCIKZG2RO6K","short_pith_number":"pith:AU4OE26S","canonical_record":{"source":{"id":"2409.01652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-03T06:45:22Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"93a498b7c81204f6e0578dac255065e9366313125d4cb49b8e15fb629cfd4561","abstract_canon_sha256":"66448a9fef71bb9aeed2a6f013fc0254372fead7269858ee59f22b2508bdd824"},"schema_version":"1.0"},"canonical_sha256":"0538e26bd2a445cc38c71215936a2ef29a4cec6355412a7391ab2d9a77754a15","source":{"kind":"arxiv","id":"2409.01652","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.01652","created_at":"2026-05-17T23:38:48Z"},{"alias_kind":"arxiv_version","alias_value":"2409.01652v2","created_at":"2026-05-17T23:38:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01652","created_at":"2026-05-17T23:38:48Z"},{"alias_kind":"pith_short_12","alias_value":"AU4OE26SURC4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AU4OE26SURC4YOGH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AU4OE26S","created_at":"2026-05-18T12:33:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:AU4OE26SURC4YOGHCIKZG2RO6K","target":"record","payload":{"canonical_record":{"source":{"id":"2409.01652","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-03T06:45:22Z","cross_cats_sorted":["cs.AI","cs.CV"],"title_canon_sha256":"93a498b7c81204f6e0578dac255065e9366313125d4cb49b8e15fb629cfd4561","abstract_canon_sha256":"66448a9fef71bb9aeed2a6f013fc0254372fead7269858ee59f22b2508bdd824"},"schema_version":"1.0"},"canonical_sha256":"0538e26bd2a445cc38c71215936a2ef29a4cec6355412a7391ab2d9a77754a15","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:38:48.512067Z","signature_b64":"Rrkm57LYiIJKGsNrv9LCCFlF30BMYBR5kAKETxqSnldMjXsPx3jqiaU256sK8yBxRH1i7g5B7vFlwc1irrxCBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0538e26bd2a445cc38c71215936a2ef29a4cec6355412a7391ab2d9a77754a15","last_reissued_at":"2026-05-17T23:38:48.511579Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:38:48.511579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2409.01652","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:38:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H87s1ufr65QVTtGu83J4uMkJSTUi8GAUulzorGBMr2VX4tsOwApexJelJj8OneOztUSTXJzU8IpJbSMC1qVnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:42:11.069373Z"},"content_sha256":"8ed8d30dce60f610d2be0bfcabf2086a10d9b5db8db98126450062c7ae9a79b1","schema_version":"1.0","event_id":"sha256:8ed8d30dce60f610d2be0bfcabf2086a10d9b5db8db98126450062c7ae9a79b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:AU4OE26SURC4YOGHCIKZG2RO6K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Manipulation tasks are solved in real time by optimizing sequences of relational keypoint constraints generated automatically from language instructions and RGB-D observations.","cross_cats":["cs.AI","cs.CV"],"primary_cat":"cs.RO","authors_text":"Chen Wang, Li Fei-Fei, Ruohan Zhang, Wenlong Huang, Yunzhu Li","submitted_at":"2024-09-03T06:45:22Z","abstract_excerpt":"Representing robotic manipulation tasks as constraints that associate the robot and the environment is a promising way to encode desired robot behaviors. However, it remains unclear how to formulate the constraints such that they are 1) versatile to diverse tasks, 2) free of manual labeling, and 3) optimizable by off-the-shelf solvers to produce robot actions in real-time. In this work, we introduce Relational Keypoint Constraints (ReKep), a visually-grounded representation for constraints in robotic manipulation. Specifically, ReKep is expressed as Python functions mapping a set of 3D keypoin"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"by representing a manipulation task as a sequence of Relational Keypoint Constraints, we can employ a hierarchical optimization procedure to solve for robot actions (represented by a sequence of end-effector poses in SE(3)) with a perception-action loop at a real-time frequency. Furthermore, in order to circumvent the need for manual specification of ReKep for each new task, we devise an automated procedure that leverages large vision models and vision-language models to produce ReKep from free-form language instructions and RGB-D observations.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The vision-language models will reliably generate correct, complete, and numerically stable Python constraint functions for arbitrary new tasks and scenes without introducing errors that break the optimizer or produce unsafe actions.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"ReKep encodes robotic tasks as optimizable Python functions over 3D keypoints that are generated automatically from language and RGB-D input, enabling real-time hierarchical planning on single- and dual-arm platforms without task-specific data.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Manipulation tasks are solved in real time by optimizing sequences of relational keypoint constraints generated automatically from language instructions and RGB-D observations.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"61b32d4da4c59649100ce2faeeaacf3e422ed4b3daf49b98fa22034105daa9a8"},"source":{"id":"2409.01652","kind":"arxiv","version":2},"verdict":{"id":"95f3c8eb-2769-4d38-9e0a-61e7a99990e1","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-16T08:21:03.984396Z","strongest_claim":"by representing a manipulation task as a sequence of Relational Keypoint Constraints, we can employ a hierarchical optimization procedure to solve for robot actions (represented by a sequence of end-effector poses in SE(3)) with a perception-action loop at a real-time frequency. Furthermore, in order to circumvent the need for manual specification of ReKep for each new task, we devise an automated procedure that leverages large vision models and vision-language models to produce ReKep from free-form language instructions and RGB-D observations.","one_line_summary":"ReKep encodes robotic tasks as optimizable Python functions over 3D keypoints that are generated automatically from language and RGB-D input, enabling real-time hierarchical planning on single- and dual-arm platforms without task-specific data.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The vision-language models will reliably generate correct, complete, and numerically stable Python constraint functions for arbitrary new tasks and scenes without introducing errors that break the optimizer or produce unsafe actions.","pith_extraction_headline":"Manipulation tasks are solved in real time by optimizing sequences of relational keypoint constraints generated automatically from language instructions and RGB-D observations."},"references":{"count":158,"sample":[{"doi":"","year":2010,"title":"L. P. Kaelbling and T. Lozano-P ´erez. Hierarchical planning in the now. In Workshops at the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010","work_id":"a6578317-bf75-45a7-9e33-ce65244b424b","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"D. Driess, J.-S. Ha, M. Toussaint, and R. Tedrake. Learning models as functionals of signed- distance fields for manipulation planning. In Conference on robot learning, pages 245–255. PMLR, 2022","work_id":"d53daa3a-8552-41d9-a445-e9dc89c20675","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2022,"title":"A. Simeonov, Y . Du, A. Tagliasacchi, J. B. Tenenbaum, A. Rodriguez, P. Agrawal, and V . Sitz- mann. Neural descriptor fields: Se (3)-equivariant object representations for manipulation. In 2022 Inter","work_id":"15655890-22dd-459b-860e-a12d2e639a40","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2019,"title":"L. Manuelli, W. Gao, P. Florence, and R. Tedrake. kpam: Keypoint affordances for category- level robotic manipulation. In The International Symposium of Robotics Research , pages 132–157. Springer, 20","work_id":"960540bb-ce99-42de-b544-f33a9367ff1a","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"DINOv2: Learning Robust Visual Features without Supervision","work_id":"26b304e5-b54a-4f26-be7e-83299eca52e4","ref_index":5,"cited_arxiv_id":"2304.07193","is_internal_anchor":true}],"resolved_work":158,"snapshot_sha256":"14e449c0b341ad545928328a4e7bde2ade54eb517813687e111d0c53d8a18148","internal_anchors":19},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9654112c60ac126aa23fe782063d46b9f9fbb167f6a2c3d6d88ba6f94a53f4cf"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"95f3c8eb-2769-4d38-9e0a-61e7a99990e1"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:38:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oMJykveY24OHneGEUvUUSW4VcZ3mPxZNMSCvNyHeZVh47TbQpffbX5yzpYmCZIgGITdNwoLcdKEcIZqZuhq1Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T21:42:11.070058Z"},"content_sha256":"88fe3687c5eb36708bd78d38e9328b9722d66dea3b2cd38e2d042aca52c50e0f","schema_version":"1.0","event_id":"sha256:88fe3687c5eb36708bd78d38e9328b9722d66dea3b2cd38e2d042aca52c50e0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AU4OE26SURC4YOGHCIKZG2RO6K/bundle.json","state_url":"https://pith.science/pith/AU4OE26SURC4YOGHCIKZG2RO6K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AU4OE26SURC4YOGHCIKZG2RO6K/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-26T21:42:11Z","links":{"resolver":"https://pith.science/pith/AU4OE26SURC4YOGHCIKZG2RO6K","bundle":"https://pith.science/pith/AU4OE26SURC4YOGHCIKZG2RO6K/bundle.json","state":"https://pith.science/pith/AU4OE26SURC4YOGHCIKZG2RO6K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AU4OE26SURC4YOGHCIKZG2RO6K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:AU4OE26SURC4YOGHCIKZG2RO6K","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":"66448a9fef71bb9aeed2a6f013fc0254372fead7269858ee59f22b2508bdd824","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-03T06:45:22Z","title_canon_sha256":"93a498b7c81204f6e0578dac255065e9366313125d4cb49b8e15fb629cfd4561"},"schema_version":"1.0","source":{"id":"2409.01652","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2409.01652","created_at":"2026-05-17T23:38:48Z"},{"alias_kind":"arxiv_version","alias_value":"2409.01652v2","created_at":"2026-05-17T23:38:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.01652","created_at":"2026-05-17T23:38:48Z"},{"alias_kind":"pith_short_12","alias_value":"AU4OE26SURC4","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_16","alias_value":"AU4OE26SURC4YOGH","created_at":"2026-05-18T12:33:37Z"},{"alias_kind":"pith_short_8","alias_value":"AU4OE26S","created_at":"2026-05-18T12:33:37Z"}],"graph_snapshots":[{"event_id":"sha256:88fe3687c5eb36708bd78d38e9328b9722d66dea3b2cd38e2d042aca52c50e0f","target":"graph","created_at":"2026-05-17T23:38:48Z","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":"by representing a manipulation task as a sequence of Relational Keypoint Constraints, we can employ a hierarchical optimization procedure to solve for robot actions (represented by a sequence of end-effector poses in SE(3)) with a perception-action loop at a real-time frequency. Furthermore, in order to circumvent the need for manual specification of ReKep for each new task, we devise an automated procedure that leverages large vision models and vision-language models to produce ReKep from free-form language instructions and RGB-D observations."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The vision-language models will reliably generate correct, complete, and numerically stable Python constraint functions for arbitrary new tasks and scenes without introducing errors that break the optimizer or produce unsafe actions."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"ReKep encodes robotic tasks as optimizable Python functions over 3D keypoints that are generated automatically from language and RGB-D input, enabling real-time hierarchical planning on single- and dual-arm platforms without task-specific data."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Manipulation tasks are solved in real time by optimizing sequences of relational keypoint constraints generated automatically from language instructions and RGB-D observations."}],"snapshot_sha256":"61b32d4da4c59649100ce2faeeaacf3e422ed4b3daf49b98fa22034105daa9a8"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"9654112c60ac126aa23fe782063d46b9f9fbb167f6a2c3d6d88ba6f94a53f4cf"},"paper":{"abstract_excerpt":"Representing robotic manipulation tasks as constraints that associate the robot and the environment is a promising way to encode desired robot behaviors. However, it remains unclear how to formulate the constraints such that they are 1) versatile to diverse tasks, 2) free of manual labeling, and 3) optimizable by off-the-shelf solvers to produce robot actions in real-time. In this work, we introduce Relational Keypoint Constraints (ReKep), a visually-grounded representation for constraints in robotic manipulation. Specifically, ReKep is expressed as Python functions mapping a set of 3D keypoin","authors_text":"Chen Wang, Li Fei-Fei, Ruohan Zhang, Wenlong Huang, Yunzhu Li","cross_cats":["cs.AI","cs.CV"],"headline":"Manipulation tasks are solved in real time by optimizing sequences of relational keypoint constraints generated automatically from language instructions and RGB-D observations.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-03T06:45:22Z","title":"ReKep: Spatio-Temporal Reasoning of Relational Keypoint Constraints for Robotic Manipulation"},"references":{"count":158,"internal_anchors":19,"resolved_work":158,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"L. P. Kaelbling and T. Lozano-P ´erez. Hierarchical planning in the now. In Workshops at the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010","work_id":"a6578317-bf75-45a7-9e33-ce65244b424b","year":2010},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"D. Driess, J.-S. Ha, M. Toussaint, and R. Tedrake. Learning models as functionals of signed- distance fields for manipulation planning. In Conference on robot learning, pages 245–255. PMLR, 2022","work_id":"d53daa3a-8552-41d9-a445-e9dc89c20675","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"A. Simeonov, Y . Du, A. Tagliasacchi, J. B. Tenenbaum, A. Rodriguez, P. Agrawal, and V . Sitz- mann. Neural descriptor fields: Se (3)-equivariant object representations for manipulation. In 2022 Inter","work_id":"15655890-22dd-459b-860e-a12d2e639a40","year":2022},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"L. Manuelli, W. Gao, P. Florence, and R. Tedrake. kpam: Keypoint affordances for category- level robotic manipulation. In The International Symposium of Robotics Research , pages 132–157. Springer, 20","work_id":"960540bb-ce99-42de-b544-f33a9367ff1a","year":2019},{"cited_arxiv_id":"2304.07193","doi":"","is_internal_anchor":true,"ref_index":5,"title":"DINOv2: Learning Robust Visual Features without Supervision","work_id":"26b304e5-b54a-4f26-be7e-83299eca52e4","year":2023}],"snapshot_sha256":"14e449c0b341ad545928328a4e7bde2ade54eb517813687e111d0c53d8a18148"},"source":{"id":"2409.01652","kind":"arxiv","version":2},"verdict":{"created_at":"2026-05-16T08:21:03.984396Z","id":"95f3c8eb-2769-4d38-9e0a-61e7a99990e1","model_set":{"reader":"grok-4.3"},"one_line_summary":"ReKep encodes robotic tasks as optimizable Python functions over 3D keypoints that are generated automatically from language and RGB-D input, enabling real-time hierarchical planning on single- and dual-arm platforms without task-specific data.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Manipulation tasks are solved in real time by optimizing sequences of relational keypoint constraints generated automatically from language instructions and RGB-D observations.","strongest_claim":"by representing a manipulation task as a sequence of Relational Keypoint Constraints, we can employ a hierarchical optimization procedure to solve for robot actions (represented by a sequence of end-effector poses in SE(3)) with a perception-action loop at a real-time frequency. Furthermore, in order to circumvent the need for manual specification of ReKep for each new task, we devise an automated procedure that leverages large vision models and vision-language models to produce ReKep from free-form language instructions and RGB-D observations.","weakest_assumption":"The vision-language models will reliably generate correct, complete, and numerically stable Python constraint functions for arbitrary new tasks and scenes without introducing errors that break the optimizer or produce unsafe actions."}},"verdict_id":"95f3c8eb-2769-4d38-9e0a-61e7a99990e1"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:8ed8d30dce60f610d2be0bfcabf2086a10d9b5db8db98126450062c7ae9a79b1","target":"record","created_at":"2026-05-17T23:38:48Z","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":"66448a9fef71bb9aeed2a6f013fc0254372fead7269858ee59f22b2508bdd824","cross_cats_sorted":["cs.AI","cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2024-09-03T06:45:22Z","title_canon_sha256":"93a498b7c81204f6e0578dac255065e9366313125d4cb49b8e15fb629cfd4561"},"schema_version":"1.0","source":{"id":"2409.01652","kind":"arxiv","version":2}},"canonical_sha256":"0538e26bd2a445cc38c71215936a2ef29a4cec6355412a7391ab2d9a77754a15","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0538e26bd2a445cc38c71215936a2ef29a4cec6355412a7391ab2d9a77754a15","first_computed_at":"2026-05-17T23:38:48.511579Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:38:48.511579Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Rrkm57LYiIJKGsNrv9LCCFlF30BMYBR5kAKETxqSnldMjXsPx3jqiaU256sK8yBxRH1i7g5B7vFlwc1irrxCBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:38:48.512067Z","signed_message":"canonical_sha256_bytes"},"source_id":"2409.01652","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8ed8d30dce60f610d2be0bfcabf2086a10d9b5db8db98126450062c7ae9a79b1","sha256:88fe3687c5eb36708bd78d38e9328b9722d66dea3b2cd38e2d042aca52c50e0f"],"state_sha256":"10accb4f29e50dc28b0d754787a5e8c69ef945d333b66da4904c1b09c365eac6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IDrUZjTem+MqXqlDd3pmo1drViK1P3jJ9Q8l+dccZcg07aSgiH35/JOBtaklAw/QDnHVL1VMypbJvr+0FrkqDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T21:42:11.073538Z","bundle_sha256":"c2f01ff0a7b28a286e7e3c4514173304cec77d700c0f4538abaa8f10b3a27ce6"}}