{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:QRENP33AATYVGCWCB22LWITIMV","short_pith_number":"pith:QRENP33A","schema_version":"1.0","canonical_sha256":"8448d7ef6004f1530ac20eb4bb22686565c317a087c4a095286dd10add942076","source":{"kind":"arxiv","id":"2607.11442","version":1},"attestation_state":"computed","paper":{"title":"Velocity Scheduled Flow Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Vitalii Bondar","submitted_at":"2026-07-13T11:50:06Z","abstract_excerpt":"Flow matching trains a neural network to regress the conditional velocity along a linear interpolant between noise and data, and the number of network evaluations~(NFE) sets the cost of sampling. The straight-line interpolant carries an implicit choice: the sample moves at constant speed throughout the trajectory. We relax this choice and introduce Velocity Scheduled Flow Matching~(VSFM), which replaces the conditional target $x_1 - x_0$ with $v(t)(x_1 - x_0)$ for any nonnegative profile $v:[0,1]\\to\\mathbb{R}_{\\geq 0}$ satisfying $\\int_0^1 v\\,dt = 1$. We study six polynomial profiles drawn fro"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2607.11442","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2026-07-13T11:50:06Z","cross_cats_sorted":[],"title_canon_sha256":"bc19216705a813662b4f9fd58b9851b217098dbd5901fefc5ca136a9de421b8c","abstract_canon_sha256":"09a6badb751550915fadfc40dd3771795e2b8d94e0161dd394d8edc92b753711"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-14T02:22:03.040677Z","signature_b64":"b2E5VEX6agBaknbxzNsLXWkauO08uIKjsou/vp73ZCc2u0Ejw77S3n1tYW9S9rpw0phXvaioQ27ZbHA8ZRC1Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8448d7ef6004f1530ac20eb4bb22686565c317a087c4a095286dd10add942076","last_reissued_at":"2026-07-14T02:22:03.039825Z","signature_status":"signed_v1","first_computed_at":"2026-07-14T02:22:03.039825Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Velocity Scheduled Flow Matching","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Vitalii Bondar","submitted_at":"2026-07-13T11:50:06Z","abstract_excerpt":"Flow matching trains a neural network to regress the conditional velocity along a linear interpolant between noise and data, and the number of network evaluations~(NFE) sets the cost of sampling. The straight-line interpolant carries an implicit choice: the sample moves at constant speed throughout the trajectory. We relax this choice and introduce Velocity Scheduled Flow Matching~(VSFM), which replaces the conditional target $x_1 - x_0$ with $v(t)(x_1 - x_0)$ for any nonnegative profile $v:[0,1]\\to\\mathbb{R}_{\\geq 0}$ satisfying $\\int_0^1 v\\,dt = 1$. We study six polynomial profiles drawn fro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.11442","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.11442/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2607.11442","created_at":"2026-07-14T02:22:03.040265+00:00"},{"alias_kind":"arxiv_version","alias_value":"2607.11442v1","created_at":"2026-07-14T02:22:03.040265+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.11442","created_at":"2026-07-14T02:22:03.040265+00:00"},{"alias_kind":"pith_short_12","alias_value":"QRENP33AATYV","created_at":"2026-07-14T02:22:03.040265+00:00"},{"alias_kind":"pith_short_16","alias_value":"QRENP33AATYVGCWC","created_at":"2026-07-14T02:22:03.040265+00:00"},{"alias_kind":"pith_short_8","alias_value":"QRENP33A","created_at":"2026-07-14T02:22:03.040265+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV","json":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV.json","graph_json":"https://pith.science/api/pith-number/QRENP33AATYVGCWCB22LWITIMV/graph.json","events_json":"https://pith.science/api/pith-number/QRENP33AATYVGCWCB22LWITIMV/events.json","paper":"https://pith.science/paper/QRENP33A"},"agent_actions":{"view_html":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV","download_json":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV.json","view_paper":"https://pith.science/paper/QRENP33A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2607.11442&json=true","fetch_graph":"https://pith.science/api/pith-number/QRENP33AATYVGCWCB22LWITIMV/graph.json","fetch_events":"https://pith.science/api/pith-number/QRENP33AATYVGCWCB22LWITIMV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV/action/storage_attestation","attest_author":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV/action/author_attestation","sign_citation":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV/action/citation_signature","submit_replication":"https://pith.science/pith/QRENP33AATYVGCWCB22LWITIMV/action/replication_record"}},"created_at":"2026-07-14T02:22:03.040265+00:00","updated_at":"2026-07-14T02:22:03.040265+00:00"}