{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:WIPZ73I52ME4SRCRR4QEP5SBSZ","short_pith_number":"pith:WIPZ73I5","canonical_record":{"source":{"id":"2605.15492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T00:15:24Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7c5d5f36ffc93540fbb55d525aa4545c95ffa9220da490c37e37c1dfe7b2d483","abstract_canon_sha256":"9b2d27316ecf7e6e220612f986bece989b2a13fd2ba0bb80c8c43bf5143aaf03"},"schema_version":"1.0"},"canonical_sha256":"b21f9fed1dd309c944518f2047f6419644063e49994aa582aea0eb6152670575","source":{"kind":"arxiv","id":"2605.15492","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15492","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15492v1","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15492","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"WIPZ73I52ME4","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"pith_short_16","alias_value":"WIPZ73I52ME4SRCR","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"pith_short_8","alias_value":"WIPZ73I5","created_at":"2026-05-20T00:01:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:WIPZ73I52ME4SRCRR4QEP5SBSZ","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15492","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T00:15:24Z","cross_cats_sorted":["cs.CV"],"title_canon_sha256":"7c5d5f36ffc93540fbb55d525aa4545c95ffa9220da490c37e37c1dfe7b2d483","abstract_canon_sha256":"9b2d27316ecf7e6e220612f986bece989b2a13fd2ba0bb80c8c43bf5143aaf03"},"schema_version":"1.0"},"canonical_sha256":"b21f9fed1dd309c944518f2047f6419644063e49994aa582aea0eb6152670575","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:01:01.473795Z","signature_b64":"mSQoMD6adbOcRDcniit/M6cmSVedpHMHGVmOpMZQACRKgz0uCGrUipI9UwF/DfbNW++KUEog7IS5wTDis2d4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b21f9fed1dd309c944518f2047f6419644063e49994aa582aea0eb6152670575","last_reissued_at":"2026-05-20T00:01:01.473024Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:01:01.473024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15492","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:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0wQ7pwaMxxwKUc1rUJArRHQQhMWTbg+dOT7xHypKmAoyn2u2nHw9GlAonEB8dPeOBHwnDLqPlXbS/s/v7YYiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:03:13.761239Z"},"content_sha256":"b0dc53c1362d9efde657831c7df2df0c731ab092303ecbe0d60ca3a0efc7ab8a","schema_version":"1.0","event_id":"sha256:b0dc53c1362d9efde657831c7df2df0c731ab092303ecbe0d60ca3a0efc7ab8a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:WIPZ73I52ME4SRCRR4QEP5SBSZ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"FLASH: Efficient Visuomotor Policy via Sparse Sampling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"A visuomotor policy using Legendre polynomials and history-anchored flow matching generates long robot action sequences in a single fast step.","cross_cats":["cs.CV"],"primary_cat":"cs.RO","authors_text":"Gen Li, Jianfei Yang, Jiaqi Bai, Jindou Jia, Kuangji Zuo, Tuo An, Xiangyu Chen, Yuxuan Hu","submitted_at":"2026-05-15T00:15:24Z","abstract_excerpt":"Generative models such as diffusion and flow matching have become dominant paradigms for visuomotor policy learning, yet their reliance on iterative denoising incurs high inference latency incompatible with real-time robotic control. We present Fast Legendre-polynomial Action policy via Sparse History-anchored flow (FLASH Policy), which replaces discrete action-chunk generation with continuous Legendre polynomial trajectory representation. Specifically, by fitting expert demonstrations under sparse temporal sampling, FLASH enables a single inference to cover a significantly extended action hor"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"FLASH achieves state-of-the-art success rates (>=92% across all tasks), a per-episode inference time of 31.40 ms (up to 175x faster than diffusion policies and 18x faster than prior flow matching policies), up to 4x faster training convergence than ACT, and 5x to 7x reduction in controller tracking error compared to discrete-action baselines.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That fitting expert demonstrations under sparse temporal sampling combined with initialization from history polynomial coefficients enables accurate single-step flow matching that preserves performance over extended action horizons without post-hoc tuning or task-specific adjustments.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"FLASH Policy uses sparse Legendre polynomial trajectory fitting and history-anchored flow matching to enable single-step inference for visuomotor control, reporting 31.4 ms per-episode latency and >=92% success on five simulated plus two real manipulation tasks.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A visuomotor policy using Legendre polynomials and history-anchored flow matching generates long robot action sequences in a single fast step.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"23888b1834a3c0b8a72bf69babcdfea47dfc3ffab8301bcb8206a5f614504db0"},"source":{"id":"2605.15492","kind":"arxiv","version":1},"verdict":{"id":"a158105b-8162-4a82-b6df-27b98dd3036f","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T16:09:20.121346Z","strongest_claim":"FLASH achieves state-of-the-art success rates (>=92% across all tasks), a per-episode inference time of 31.40 ms (up to 175x faster than diffusion policies and 18x faster than prior flow matching policies), up to 4x faster training convergence than ACT, and 5x to 7x reduction in controller tracking error compared to discrete-action baselines.","one_line_summary":"FLASH Policy uses sparse Legendre polynomial trajectory fitting and history-anchored flow matching to enable single-step inference for visuomotor control, reporting 31.4 ms per-episode latency and >=92% success on five simulated plus two real manipulation tasks.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That fitting expert demonstrations under sparse temporal sampling combined with initialization from history polynomial coefficients enables accurate single-step flow matching that preserves performance over extended action horizons without post-hoc tuning or task-specific adjustments.","pith_extraction_headline":"A visuomotor policy using Legendre polynomials and history-anchored flow matching generates long robot action sequences in a single fast step."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15492/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.217001Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:15:40.602243Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:56.910774Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.070819Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.399241Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.647597Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"5a80d0d29abe162f9df2033408b874f9bc1f5c7ab49def67b365ecc9786aa1ee"},"references":{"count":33,"sample":[{"doi":"","year":null,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"117071d9-5700-4612-b37a-8ef042f42434","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Proceedings of International Conference on Learning Representations , year=","work_id":"eb25e03e-cdec-4b47-aa4e-8d1bc07aaa6d","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":null,"title":"Black, Kevin and Brown, Noah and Driess, Danny and Esmail, Adnan and Equi, Michael and Finn, Chelsea and Fusai, Niccolo and Groom, Lachy and Hausman, Karol and Ichter, Brian and others , journal=","work_id":"0c69f1d7-4638-40ea-a57a-a2df7da3295a","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"The International Journal of Robotics Research , volume=","work_id":"f5b6715b-1475-4efe-84e2-6ac2c1b889d3","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2010,"title":"Denoising Diffusion Implicit Models","work_id":"8fa2128b-d18c-405c-ac92-0e669cf89ac0","ref_index":5,"cited_arxiv_id":"2010.02502","is_internal_anchor":true}],"resolved_work":33,"snapshot_sha256":"4964a506a1e569fa729118ee11667bc56e26814afea8d64a4147b9d5df1eabf2","internal_anchors":6},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0f2089a5d0bd88d26e93d7be2ff759d70d4f5f9ab4f37135919bf1fe5b81cc76"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"a158105b-8162-4a82-b6df-27b98dd3036f"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-20T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kf0oSaTmSp79maGaqydWFwm2zmv26MbrOeRKWZVWaJkd4BOlnZa1fR+LKGUn65ht4jXsNjBRqU/YkskNO2AuBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T20:03:13.762446Z"},"content_sha256":"78b637e9b1fd0142faa6fd96464e9a3fedc0f4f3237a3830eb7737f620ac1f9a","schema_version":"1.0","event_id":"sha256:78b637e9b1fd0142faa6fd96464e9a3fedc0f4f3237a3830eb7737f620ac1f9a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/WIPZ73I52ME4SRCRR4QEP5SBSZ/bundle.json","state_url":"https://pith.science/pith/WIPZ73I52ME4SRCRR4QEP5SBSZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/WIPZ73I52ME4SRCRR4QEP5SBSZ/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-20T20:03:13Z","links":{"resolver":"https://pith.science/pith/WIPZ73I52ME4SRCRR4QEP5SBSZ","bundle":"https://pith.science/pith/WIPZ73I52ME4SRCRR4QEP5SBSZ/bundle.json","state":"https://pith.science/pith/WIPZ73I52ME4SRCRR4QEP5SBSZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/WIPZ73I52ME4SRCRR4QEP5SBSZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:WIPZ73I52ME4SRCRR4QEP5SBSZ","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":"9b2d27316ecf7e6e220612f986bece989b2a13fd2ba0bb80c8c43bf5143aaf03","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T00:15:24Z","title_canon_sha256":"7c5d5f36ffc93540fbb55d525aa4545c95ffa9220da490c37e37c1dfe7b2d483"},"schema_version":"1.0","source":{"id":"2605.15492","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15492","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15492v1","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15492","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"WIPZ73I52ME4","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"pith_short_16","alias_value":"WIPZ73I52ME4SRCR","created_at":"2026-05-20T00:01:01Z"},{"alias_kind":"pith_short_8","alias_value":"WIPZ73I5","created_at":"2026-05-20T00:01:01Z"}],"graph_snapshots":[{"event_id":"sha256:78b637e9b1fd0142faa6fd96464e9a3fedc0f4f3237a3830eb7737f620ac1f9a","target":"graph","created_at":"2026-05-20T00:01:01Z","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":"FLASH achieves state-of-the-art success rates (>=92% across all tasks), a per-episode inference time of 31.40 ms (up to 175x faster than diffusion policies and 18x faster than prior flow matching policies), up to 4x faster training convergence than ACT, and 5x to 7x reduction in controller tracking error compared to discrete-action baselines."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"That fitting expert demonstrations under sparse temporal sampling combined with initialization from history polynomial coefficients enables accurate single-step flow matching that preserves performance over extended action horizons without post-hoc tuning or task-specific adjustments."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"FLASH Policy uses sparse Legendre polynomial trajectory fitting and history-anchored flow matching to enable single-step inference for visuomotor control, reporting 31.4 ms per-episode latency and >=92% success on five simulated plus two real manipulation tasks."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"A visuomotor policy using Legendre polynomials and history-anchored flow matching generates long robot action sequences in a single fast step."}],"snapshot_sha256":"23888b1834a3c0b8a72bf69babcdfea47dfc3ffab8301bcb8206a5f614504db0"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"0f2089a5d0bd88d26e93d7be2ff759d70d4f5f9ab4f37135919bf1fe5b81cc76"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:31:18.217001Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:15:40.602243Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T14:51:56.910774Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.070819Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T13:49:41.399241Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.647597Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15492/integrity.json","findings":[],"snapshot_sha256":"5a80d0d29abe162f9df2033408b874f9bc1f5c7ab49def67b365ecc9786aa1ee","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Generative models such as diffusion and flow matching have become dominant paradigms for visuomotor policy learning, yet their reliance on iterative denoising incurs high inference latency incompatible with real-time robotic control. We present Fast Legendre-polynomial Action policy via Sparse History-anchored flow (FLASH Policy), which replaces discrete action-chunk generation with continuous Legendre polynomial trajectory representation. Specifically, by fitting expert demonstrations under sparse temporal sampling, FLASH enables a single inference to cover a significantly extended action hor","authors_text":"Gen Li, Jianfei Yang, Jiaqi Bai, Jindou Jia, Kuangji Zuo, Tuo An, Xiangyu Chen, Yuxuan Hu","cross_cats":["cs.CV"],"headline":"A visuomotor policy using Legendre polynomials and history-anchored flow matching generates long robot action sequences in a single fast step.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T00:15:24Z","title":"FLASH: Efficient Visuomotor Policy via Sparse Sampling"},"references":{"count":33,"internal_anchors":6,"resolved_work":33,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"Advances in Neural Information Processing Systems , volume=","work_id":"117071d9-5700-4612-b37a-8ef042f42434","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Proceedings of International Conference on Learning Representations , year=","work_id":"eb25e03e-cdec-4b47-aa4e-8d1bc07aaa6d","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"Black, Kevin and Brown, Noah and Driess, Danny and Esmail, Adnan and Equi, Michael and Finn, Chelsea and Fusai, Niccolo and Groom, Lachy and Hausman, Karol and Ichter, Brian and others , journal=","work_id":"0c69f1d7-4638-40ea-a57a-a2df7da3295a","year":null},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"The International Journal of Robotics Research , volume=","work_id":"f5b6715b-1475-4efe-84e2-6ac2c1b889d3","year":2025},{"cited_arxiv_id":"2010.02502","doi":"","is_internal_anchor":true,"ref_index":5,"title":"Denoising Diffusion Implicit Models","work_id":"8fa2128b-d18c-405c-ac92-0e669cf89ac0","year":2010}],"snapshot_sha256":"4964a506a1e569fa729118ee11667bc56e26814afea8d64a4147b9d5df1eabf2"},"source":{"id":"2605.15492","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T16:09:20.121346Z","id":"a158105b-8162-4a82-b6df-27b98dd3036f","model_set":{"reader":"grok-4.3"},"one_line_summary":"FLASH Policy uses sparse Legendre polynomial trajectory fitting and history-anchored flow matching to enable single-step inference for visuomotor control, reporting 31.4 ms per-episode latency and >=92% success on five simulated plus two real manipulation tasks.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"A visuomotor policy using Legendre polynomials and history-anchored flow matching generates long robot action sequences in a single fast step.","strongest_claim":"FLASH achieves state-of-the-art success rates (>=92% across all tasks), a per-episode inference time of 31.40 ms (up to 175x faster than diffusion policies and 18x faster than prior flow matching policies), up to 4x faster training convergence than ACT, and 5x to 7x reduction in controller tracking error compared to discrete-action baselines.","weakest_assumption":"That fitting expert demonstrations under sparse temporal sampling combined with initialization from history polynomial coefficients enables accurate single-step flow matching that preserves performance over extended action horizons without post-hoc tuning or task-specific adjustments."}},"verdict_id":"a158105b-8162-4a82-b6df-27b98dd3036f"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:b0dc53c1362d9efde657831c7df2df0c731ab092303ecbe0d60ca3a0efc7ab8a","target":"record","created_at":"2026-05-20T00:01:01Z","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":"9b2d27316ecf7e6e220612f986bece989b2a13fd2ba0bb80c8c43bf5143aaf03","cross_cats_sorted":["cs.CV"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.RO","submitted_at":"2026-05-15T00:15:24Z","title_canon_sha256":"7c5d5f36ffc93540fbb55d525aa4545c95ffa9220da490c37e37c1dfe7b2d483"},"schema_version":"1.0","source":{"id":"2605.15492","kind":"arxiv","version":1}},"canonical_sha256":"b21f9fed1dd309c944518f2047f6419644063e49994aa582aea0eb6152670575","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"b21f9fed1dd309c944518f2047f6419644063e49994aa582aea0eb6152670575","first_computed_at":"2026-05-20T00:01:01.473024Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:01:01.473024Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"mSQoMD6adbOcRDcniit/M6cmSVedpHMHGVmOpMZQACRKgz0uCGrUipI9UwF/DfbNW++KUEog7IS5wTDis2d4BA==","signature_status":"signed_v1","signed_at":"2026-05-20T00:01:01.473795Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15492","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b0dc53c1362d9efde657831c7df2df0c731ab092303ecbe0d60ca3a0efc7ab8a","sha256:78b637e9b1fd0142faa6fd96464e9a3fedc0f4f3237a3830eb7737f620ac1f9a"],"state_sha256":"f19e4291669329f9e6d02ef373130d06c243549cf728b2b867f4a48e43a7769b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xH4APgX/EXiL9fXJU4mqcwawyoDNg3GUciPcOY33aCVok8HP6OGd+K4hbhmq6P7CUnyTsfSTw4hAozhGYDlVCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T20:03:13.767294Z","bundle_sha256":"98e9178d83582e7964e11a373e981b54ff6a7967e6e3c3cda5ac6d70187bd4f8"}}