{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:RCTLJG2EU4OWPQDHAAH5ZFWDTA","short_pith_number":"pith:RCTLJG2E","canonical_record":{"source":{"id":"2605.15419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"8f94b1d4a152b12dd6e95b734af9f9742444f422deed75309cdc13e4e4506dd1","abstract_canon_sha256":"f228cb44b3931ee5f81fcba193e146d068ee4a180fa2b59ee54e2d31ac0b64a2"},"schema_version":"1.0"},"canonical_sha256":"88a6b49b44a71d67c067000fdc96c39829c8e2ddc70fb18ce352065a9fec1414","source":{"kind":"arxiv","id":"2605.15419","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15419","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15419v1","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15419","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_12","alias_value":"RCTLJG2EU4OW","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCTLJG2EU4OWPQDH","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCTLJG2E","created_at":"2026-05-20T00:00:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:RCTLJG2EU4OWPQDHAAH5ZFWDTA","target":"record","payload":{"canonical_record":{"source":{"id":"2605.15419","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:05:03Z","cross_cats_sorted":[],"title_canon_sha256":"8f94b1d4a152b12dd6e95b734af9f9742444f422deed75309cdc13e4e4506dd1","abstract_canon_sha256":"f228cb44b3931ee5f81fcba193e146d068ee4a180fa2b59ee54e2d31ac0b64a2"},"schema_version":"1.0"},"canonical_sha256":"88a6b49b44a71d67c067000fdc96c39829c8e2ddc70fb18ce352065a9fec1414","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T00:00:57.623665Z","signature_b64":"syjfIo12nSmW5GX/Cjyz+6nqSBsBnioT2hEaaRLPtQ4nLTplDeYUa/LjWgFqCKqPPbDNqGnCib0h9p4ou5yHBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"88a6b49b44a71d67c067000fdc96c39829c8e2ddc70fb18ce352065a9fec1414","last_reissued_at":"2026-05-20T00:00:57.622873Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T00:00:57.622873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2605.15419","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:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AC93jsVWfwPHSgTLZRSviA975Ey2Ou2kBDyft3uura72DGK1AlPUQ2Jcbq1c2ROgNF5Wlg6vzRkorGvvj6h8BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:02:04.075718Z"},"content_sha256":"1143ccddaa51fca5c639091077be277d9b670137c3ac753a041451f0bb8b6c44","schema_version":"1.0","event_id":"sha256:1143ccddaa51fca5c639091077be277d9b670137c3ac753a041451f0bb8b6c44"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:RCTLJG2EU4OWPQDHAAH5ZFWDTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrangian Flow Matching: A Least-Action Framework for Principled Path Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Minimizing a general Lagrangian's action under the continuity equation produces a family of probability paths for flow matching.","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Junzhe Zhang, Shukai Du, Yiming Li","submitted_at":"2026-05-14T21:05:03Z","abstract_excerpt":"Flow matching trains a neural velocity field by regression against a target velocity associated with a prescribed probability path connecting a simple initial distribution to the data distribution. A central design choice is the path itself. Existing constructions, including rectified and optimal-transport-based paths, transport samples along straight lines between coupled endpoints and thus cover only a narrow class of dynamics. We observe that this corresponds to the simplest case of the least-action principle in classical mechanics, in which the kinetic Lagrangian yields free-particle strai"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show that this dynamic problem admits an equivalent static optimal transport (OT) formulation, yielding a family of simulation-free training objectives that recover OT-based flow matching as the kinetic special case and the trigonometric variance-preserving diffusion path as the harmonic-oscillator case.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The assumption that minimizing the action of an arbitrary Lagrangian subject to the continuity equation and fixed marginal endpoints produces a valid probability path whose induced velocity field can be regressed by a neural network without introducing inconsistencies or requiring simulation.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Lagrangian flow matching minimizes action of a general Lagrangian subject to continuity equation and endpoints to generate new probability paths and simulation-free training objectives that recover prior flow matching methods as special cases.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Minimizing a general Lagrangian's action under the continuity equation produces a family of probability paths for flow matching.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"7e6f8dabf95526acfeefd9cdbffc147c0be5de4d4416ceb3f3e2647e9571d26c"},"source":{"id":"2605.15419","kind":"arxiv","version":1},"verdict":{"id":"f5bd1302-09a9-41f3-bc4e-09ce28b782cc","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-19T15:49:51.168263Z","strongest_claim":"We show that this dynamic problem admits an equivalent static optimal transport (OT) formulation, yielding a family of simulation-free training objectives that recover OT-based flow matching as the kinetic special case and the trigonometric variance-preserving diffusion path as the harmonic-oscillator case.","one_line_summary":"Lagrangian flow matching minimizes action of a general Lagrangian subject to continuity equation and endpoints to generate new probability paths and simulation-free training objectives that recover prior flow matching methods as special cases.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The assumption that minimizing the action of an arbitrary Lagrangian subject to the continuity equation and fixed marginal endpoints produces a valid probability path whose induced velocity field can be regressed by a neural network without introducing inconsistencies or requiring simulation.","pith_extraction_headline":"Minimizing a general Lagrangian's action under the continuity equation produces a family of probability paths for flow matching."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.15419/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"cited_work_retraction","ran_at":"2026-05-19T16:22:12.760587Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T16:04:39.999601Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.991806Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:43.812513Z","status":"skipped","version":"0.1.0","findings_count":0},{"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.143788Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.705146Z","status":"skipped","version":"1.0.0","findings_count":0}],"snapshot_sha256":"52a0a8190e6e5461db9bb455ea7bf00ea0adbef34f1930688608c34fc45fefbc"},"references":{"count":31,"sample":[{"doi":"","year":2025,"title":"M. S. Albergo, N. M. Boffi, and E. Vanden-Eijnden. Stochastic interpolants: A unifying framework for flows and diffusions.Journal of Machine Learning Research, 26(209):1–80, 2025","work_id":"4a85a9da-2d60-428f-9fe7-d66bc074a919","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2023,"title":"M. S. Albergo and E. Vanden-Eijnden. Building normalizing flows with stochastic interpolants. InThe Eleventh International Conference on Learning Representations (ICLR), 2023","work_id":"215142f4-ac3b-4521-842a-627c67ca1904","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2005,"title":"L. Ambrosio, N. Gigli, and G. Savaré.Gradient Flows: In Metric Spaces and in the Space of Probability Measures. Birkhäuser, Basel, 2005","work_id":"cee8e776-92fa-402c-a7af-c27333127ca0","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1989,"title":"V . I. Arnold, K. V ogtmann, and A. Weinstein.Mathematical Methods of Classical Mechanics, volume 60 ofGraduate Texts in Mathematics. Springer, New York, 2 edition, 1989","work_id":"30cf9856-0dbc-4ad7-aeaf-e821ebfb6e59","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2025,"title":"arXiv preprint arXiv:2504.10612 , year=","work_id":"d0d065c8-17d7-404d-87f8-af8a3656897d","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":31,"snapshot_sha256":"f684f6838efa533d413cf95c7764a4c22458f6eb842227df82e2fe4e48aea795","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4089b2c0a19547d088830b91c924d1aafe9d3faedeea0f89d4dd0bdbafc2b08d"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"f5bd1302-09a9-41f3-bc4e-09ce28b782cc"},"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:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UYhWrYICKsKhZ+UCMwSB+VikAzqhaPWZ9W7GBP4xPJdjF6ayVctlP6/9kENuI2UBCkb+SQzAotcUU2m0wDBhBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T02:02:04.077092Z"},"content_sha256":"e934f9f1177242d2f5f3fcaea5c578459ba5e68df5152ac3079a528ceb9a00eb","schema_version":"1.0","event_id":"sha256:e934f9f1177242d2f5f3fcaea5c578459ba5e68df5152ac3079a528ceb9a00eb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCTLJG2EU4OWPQDHAAH5ZFWDTA/bundle.json","state_url":"https://pith.science/pith/RCTLJG2EU4OWPQDHAAH5ZFWDTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCTLJG2EU4OWPQDHAAH5ZFWDTA/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-26T02:02:04Z","links":{"resolver":"https://pith.science/pith/RCTLJG2EU4OWPQDHAAH5ZFWDTA","bundle":"https://pith.science/pith/RCTLJG2EU4OWPQDHAAH5ZFWDTA/bundle.json","state":"https://pith.science/pith/RCTLJG2EU4OWPQDHAAH5ZFWDTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCTLJG2EU4OWPQDHAAH5ZFWDTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:RCTLJG2EU4OWPQDHAAH5ZFWDTA","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":"f228cb44b3931ee5f81fcba193e146d068ee4a180fa2b59ee54e2d31ac0b64a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:05:03Z","title_canon_sha256":"8f94b1d4a152b12dd6e95b734af9f9742444f422deed75309cdc13e4e4506dd1"},"schema_version":"1.0","source":{"id":"2605.15419","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.15419","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"arxiv_version","alias_value":"2605.15419v1","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.15419","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_12","alias_value":"RCTLJG2EU4OW","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_16","alias_value":"RCTLJG2EU4OWPQDH","created_at":"2026-05-20T00:00:57Z"},{"alias_kind":"pith_short_8","alias_value":"RCTLJG2E","created_at":"2026-05-20T00:00:57Z"}],"graph_snapshots":[{"event_id":"sha256:e934f9f1177242d2f5f3fcaea5c578459ba5e68df5152ac3079a528ceb9a00eb","target":"graph","created_at":"2026-05-20T00:00:57Z","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":"We show that this dynamic problem admits an equivalent static optimal transport (OT) formulation, yielding a family of simulation-free training objectives that recover OT-based flow matching as the kinetic special case and the trigonometric variance-preserving diffusion path as the harmonic-oscillator case."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The assumption that minimizing the action of an arbitrary Lagrangian subject to the continuity equation and fixed marginal endpoints produces a valid probability path whose induced velocity field can be regressed by a neural network without introducing inconsistencies or requiring simulation."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Lagrangian flow matching minimizes action of a general Lagrangian subject to continuity equation and endpoints to generate new probability paths and simulation-free training objectives that recover prior flow matching methods as special cases."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Minimizing a general Lagrangian's action under the continuity equation produces a family of probability paths for flow matching."}],"snapshot_sha256":"7e6f8dabf95526acfeefd9cdbffc147c0be5de4d4416ceb3f3e2647e9571d26c"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"4089b2c0a19547d088830b91c924d1aafe9d3faedeea0f89d4dd0bdbafc2b08d"},"integrity":{"available":true,"clean":true,"detectors_run":[{"findings_count":0,"name":"cited_work_retraction","ran_at":"2026-05-19T16:22:12.760587Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_compliance","ran_at":"2026-05-19T16:04:39.999601Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"doi_title_agreement","ran_at":"2026-05-19T16:01:17.991806Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"citation_quote_validity","ran_at":"2026-05-19T15:50:43.812513Z","status":"skipped","version":"0.1.0"},{"findings_count":0,"name":"claim_evidence","ran_at":"2026-05-19T14:21:54.143788Z","status":"completed","version":"1.0.0"},{"findings_count":0,"name":"ai_meta_artifact","ran_at":"2026-05-19T13:33:22.705146Z","status":"skipped","version":"1.0.0"}],"endpoint":"/pith/2605.15419/integrity.json","findings":[],"snapshot_sha256":"52a0a8190e6e5461db9bb455ea7bf00ea0adbef34f1930688608c34fc45fefbc","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Flow matching trains a neural velocity field by regression against a target velocity associated with a prescribed probability path connecting a simple initial distribution to the data distribution. A central design choice is the path itself. Existing constructions, including rectified and optimal-transport-based paths, transport samples along straight lines between coupled endpoints and thus cover only a narrow class of dynamics. We observe that this corresponds to the simplest case of the least-action principle in classical mechanics, in which the kinetic Lagrangian yields free-particle strai","authors_text":"Junzhe Zhang, Shukai Du, Yiming Li","cross_cats":[],"headline":"Minimizing a general Lagrangian's action under the continuity equation produces a family of probability paths for flow matching.","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:05:03Z","title":"Lagrangian Flow Matching: A Least-Action Framework for Principled Path Design"},"references":{"count":31,"internal_anchors":0,"resolved_work":31,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"M. S. Albergo, N. M. Boffi, and E. Vanden-Eijnden. Stochastic interpolants: A unifying framework for flows and diffusions.Journal of Machine Learning Research, 26(209):1–80, 2025","work_id":"4a85a9da-2d60-428f-9fe7-d66bc074a919","year":2025},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"M. S. Albergo and E. Vanden-Eijnden. Building normalizing flows with stochastic interpolants. InThe Eleventh International Conference on Learning Representations (ICLR), 2023","work_id":"215142f4-ac3b-4521-842a-627c67ca1904","year":2023},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":3,"title":"L. Ambrosio, N. Gigli, and G. Savaré.Gradient Flows: In Metric Spaces and in the Space of Probability Measures. Birkhäuser, Basel, 2005","work_id":"cee8e776-92fa-402c-a7af-c27333127ca0","year":2005},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":4,"title":"V . I. Arnold, K. V ogtmann, and A. Weinstein.Mathematical Methods of Classical Mechanics, volume 60 ofGraduate Texts in Mathematics. Springer, New York, 2 edition, 1989","work_id":"30cf9856-0dbc-4ad7-aeaf-e821ebfb6e59","year":1989},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":5,"title":"arXiv preprint arXiv:2504.10612 , year=","work_id":"d0d065c8-17d7-404d-87f8-af8a3656897d","year":2025}],"snapshot_sha256":"f684f6838efa533d413cf95c7764a4c22458f6eb842227df82e2fe4e48aea795"},"source":{"id":"2605.15419","kind":"arxiv","version":1},"verdict":{"created_at":"2026-05-19T15:49:51.168263Z","id":"f5bd1302-09a9-41f3-bc4e-09ce28b782cc","model_set":{"reader":"grok-4.3"},"one_line_summary":"Lagrangian flow matching minimizes action of a general Lagrangian subject to continuity equation and endpoints to generate new probability paths and simulation-free training objectives that recover prior flow matching methods as special cases.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Minimizing a general Lagrangian's action under the continuity equation produces a family of probability paths for flow matching.","strongest_claim":"We show that this dynamic problem admits an equivalent static optimal transport (OT) formulation, yielding a family of simulation-free training objectives that recover OT-based flow matching as the kinetic special case and the trigonometric variance-preserving diffusion path as the harmonic-oscillator case.","weakest_assumption":"The assumption that minimizing the action of an arbitrary Lagrangian subject to the continuity equation and fixed marginal endpoints produces a valid probability path whose induced velocity field can be regressed by a neural network without introducing inconsistencies or requiring simulation."}},"verdict_id":"f5bd1302-09a9-41f3-bc4e-09ce28b782cc"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1143ccddaa51fca5c639091077be277d9b670137c3ac753a041451f0bb8b6c44","target":"record","created_at":"2026-05-20T00:00:57Z","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":"f228cb44b3931ee5f81fcba193e146d068ee4a180fa2b59ee54e2d31ac0b64a2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2026-05-14T21:05:03Z","title_canon_sha256":"8f94b1d4a152b12dd6e95b734af9f9742444f422deed75309cdc13e4e4506dd1"},"schema_version":"1.0","source":{"id":"2605.15419","kind":"arxiv","version":1}},"canonical_sha256":"88a6b49b44a71d67c067000fdc96c39829c8e2ddc70fb18ce352065a9fec1414","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"88a6b49b44a71d67c067000fdc96c39829c8e2ddc70fb18ce352065a9fec1414","first_computed_at":"2026-05-20T00:00:57.622873Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-20T00:00:57.622873Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"syjfIo12nSmW5GX/Cjyz+6nqSBsBnioT2hEaaRLPtQ4nLTplDeYUa/LjWgFqCKqPPbDNqGnCib0h9p4ou5yHBQ==","signature_status":"signed_v1","signed_at":"2026-05-20T00:00:57.623665Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.15419","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1143ccddaa51fca5c639091077be277d9b670137c3ac753a041451f0bb8b6c44","sha256:e934f9f1177242d2f5f3fcaea5c578459ba5e68df5152ac3079a528ceb9a00eb"],"state_sha256":"b8d1e41107b93ba0734010dd7b1dfa970e4c0a7f9628ad52a18b58a2c4621886"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DXSaQKOm8u6U10ouWU+pEj76UwYy07S+OVY26hp3HICJjSsgIs5HnFmG8ndjAEVXAmoz6vD0lV8yU8dCqlLuDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T02:02:04.084551Z","bundle_sha256":"ab32b7d9bd2976d58d086f9227cbf274373c7ddb5d26f1f275bf185486bf2af2"}}