{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:RIMXZLO7B4S77XZZ4EBMSTWCJB","short_pith_number":"pith:RIMXZLO7","schema_version":"1.0","canonical_sha256":"8a197caddf0f25ffdf39e102c94ec248527ebbee3d5c3bd073fe054c7a5b1179","source":{"kind":"arxiv","id":"2601.14430","version":2},"attestation_state":"computed","paper":{"title":"Meta Flow Maps enable scalable reward alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Abbas Mammadov, Adhi Saravanan, Alvaro Prat, Michael S. Albergo, Peter Potaptchik, Yee Whye Teh","submitted_at":"2026-01-20T19:39:56Z","abstract_excerpt":"Controlling generative models is computationally expensive. This is because optimal alignment with a reward function--whether via inference-time steering or fine-tuning--requires estimating the value function. This task demands access to the conditional posterior $p_{1|t}(x_1|x_t)$, the distribution of clean data $x_1$ consistent with an intermediate state $x_t$, a requirement that typically compels methods to resort to costly trajectory simulations. To address this bottleneck, we introduce Meta Flow Maps (MFMs), a framework extending consistency models and flow maps into the stochastic regime"},"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":"2601.14430","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"stat.ML","submitted_at":"2026-01-20T19:39:56Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"c0a5625a9b9cda274b6eb70ddd863cd8ca3c450907fe0b484b9264ceabb8b180","abstract_canon_sha256":"b2f26fb80637093f930e9805e30559e383cf68748ee742899ea29ade181fd843"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:12:17.722468Z","signature_b64":"WSnBNN5REzCgVSI4rYAIbQ/wSaGw2+l9bBpZ1VWKU5VdZmnhyPC/RwizSvwK3TnZJPk+PMlqz95I75NuEu+5AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8a197caddf0f25ffdf39e102c94ec248527ebbee3d5c3bd073fe054c7a5b1179","last_reissued_at":"2026-06-19T16:12:17.722026Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:12:17.722026Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Meta Flow Maps enable scalable reward alignment","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"stat.ML","authors_text":"Abbas Mammadov, Adhi Saravanan, Alvaro Prat, Michael S. Albergo, Peter Potaptchik, Yee Whye Teh","submitted_at":"2026-01-20T19:39:56Z","abstract_excerpt":"Controlling generative models is computationally expensive. This is because optimal alignment with a reward function--whether via inference-time steering or fine-tuning--requires estimating the value function. This task demands access to the conditional posterior $p_{1|t}(x_1|x_t)$, the distribution of clean data $x_1$ consistent with an intermediate state $x_t$, a requirement that typically compels methods to resort to costly trajectory simulations. To address this bottleneck, we introduce Meta Flow Maps (MFMs), a framework extending consistency models and flow maps into the stochastic regime"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2601.14430","kind":"arxiv","version":2},"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/2601.14430/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":"2601.14430","created_at":"2026-06-19T16:12:17.722084+00:00"},{"alias_kind":"arxiv_version","alias_value":"2601.14430v2","created_at":"2026-06-19T16:12:17.722084+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2601.14430","created_at":"2026-06-19T16:12:17.722084+00:00"},{"alias_kind":"pith_short_12","alias_value":"RIMXZLO7B4S7","created_at":"2026-06-19T16:12:17.722084+00:00"},{"alias_kind":"pith_short_16","alias_value":"RIMXZLO7B4S77XZZ","created_at":"2026-06-19T16:12:17.722084+00:00"},{"alias_kind":"pith_short_8","alias_value":"RIMXZLO7","created_at":"2026-06-19T16:12:17.722084+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":7,"internal_anchor_count":7,"sample":[{"citing_arxiv_id":"2605.28075","citing_title":"Measure-to-measure Regression with Transformers","ref_index":21,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27147","citing_title":"How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10759","citing_title":"Reinforce Adjoint Matching: Scaling RL Post-Training of Diffusion and Flow-Matching Models","ref_index":6,"is_internal_anchor":true},{"citing_arxiv_id":"2605.12416","citing_title":"Aligning Flow Map Policies with Optimal Q-Guidance","ref_index":36,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27147","citing_title":"How to Guide Your Flow: Few-Step Alignment via Flow Map Reward Guidance","ref_index":53,"is_internal_anchor":true},{"citing_arxiv_id":"2604.27443","citing_title":"ABC: Any-Subset Autoregression via Non-Markovian Diffusion Bridges in Continuous Time and Space","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2605.10759","citing_title":"Reinforce Adjoint Matching: Scaling RL Post-Training of Diffusion and Flow-Matching Models","ref_index":38,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB","json":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB.json","graph_json":"https://pith.science/api/pith-number/RIMXZLO7B4S77XZZ4EBMSTWCJB/graph.json","events_json":"https://pith.science/api/pith-number/RIMXZLO7B4S77XZZ4EBMSTWCJB/events.json","paper":"https://pith.science/paper/RIMXZLO7"},"agent_actions":{"view_html":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB","download_json":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB.json","view_paper":"https://pith.science/paper/RIMXZLO7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2601.14430&json=true","fetch_graph":"https://pith.science/api/pith-number/RIMXZLO7B4S77XZZ4EBMSTWCJB/graph.json","fetch_events":"https://pith.science/api/pith-number/RIMXZLO7B4S77XZZ4EBMSTWCJB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB/action/storage_attestation","attest_author":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB/action/author_attestation","sign_citation":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB/action/citation_signature","submit_replication":"https://pith.science/pith/RIMXZLO7B4S77XZZ4EBMSTWCJB/action/replication_record"}},"created_at":"2026-06-19T16:12:17.722084+00:00","updated_at":"2026-06-19T16:12:17.722084+00:00"}