{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:IG4VSPZSGNB2GDCRNBS3JZF5BR","short_pith_number":"pith:IG4VSPZS","schema_version":"1.0","canonical_sha256":"41b9593f323343a30c516865b4e4bd0c604c4c6e6dade16f7438b3b4c37bd6b8","source":{"kind":"arxiv","id":"2512.20063","version":3},"attestation_state":"computed","paper":{"title":"PairFlow: Closed-Form Source-Target Coupling for Few-Step Generation in Discrete Flow Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jisung Hwang, Kyeongmin Yeo, Mingue Park, Minhyuk Sung, Seungwoo Yoo","submitted_at":"2025-12-23T05:31:56Z","abstract_excerpt":"We introduce $\\texttt{PairFlow}$, a lightweight preprocessing step for training Discrete Flow Models (DFMs) to achieve few-step sampling without requiring a pretrained teacher. DFMs have recently emerged as a new class of generative models for discrete data, offering strong performance. However, they suffer from slow sampling due to their iterative nature. Existing acceleration methods largely depend on finetuning, which introduces substantial additional training overhead. $\\texttt{PairFlow}$ addresses this issue with a lightweight preprocessing step. Inspired by ReFlow and its extension to DF"},"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":"2512.20063","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2025-12-23T05:31:56Z","cross_cats_sorted":[],"title_canon_sha256":"bff439350c05f0622acbbb1f4299574fdf756cac9f80c04f497e33c57102e058","abstract_canon_sha256":"74a34ee2b035fefe6003b664c7dd1bb861f12519c2031c9d03569766b8b63ee0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-26T01:03:21.135795Z","signature_b64":"Vn5ME26GAA+67qn4D+vGv7S5Zic7JqT+NYe7vEC2wyG6WsaG4yLm7O+yMxrKPXUklF1pRZH/2T6a7YzSz90OAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41b9593f323343a30c516865b4e4bd0c604c4c6e6dade16f7438b3b4c37bd6b8","last_reissued_at":"2026-05-26T01:03:21.134798Z","signature_status":"signed_v1","first_computed_at":"2026-05-26T01:03:21.134798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PairFlow: Closed-Form Source-Target Coupling for Few-Step Generation in Discrete Flow Models","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Jisung Hwang, Kyeongmin Yeo, Mingue Park, Minhyuk Sung, Seungwoo Yoo","submitted_at":"2025-12-23T05:31:56Z","abstract_excerpt":"We introduce $\\texttt{PairFlow}$, a lightweight preprocessing step for training Discrete Flow Models (DFMs) to achieve few-step sampling without requiring a pretrained teacher. DFMs have recently emerged as a new class of generative models for discrete data, offering strong performance. However, they suffer from slow sampling due to their iterative nature. Existing acceleration methods largely depend on finetuning, which introduces substantial additional training overhead. $\\texttt{PairFlow}$ addresses this issue with a lightweight preprocessing step. Inspired by ReFlow and its extension to DF"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2512.20063","kind":"arxiv","version":3},"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/2512.20063/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":"2512.20063","created_at":"2026-05-26T01:03:21.134932+00:00"},{"alias_kind":"arxiv_version","alias_value":"2512.20063v3","created_at":"2026-05-26T01:03:21.134932+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2512.20063","created_at":"2026-05-26T01:03:21.134932+00:00"},{"alias_kind":"pith_short_12","alias_value":"IG4VSPZSGNB2","created_at":"2026-05-26T01:03:21.134932+00:00"},{"alias_kind":"pith_short_16","alias_value":"IG4VSPZSGNB2GDCR","created_at":"2026-05-26T01:03:21.134932+00:00"},{"alias_kind":"pith_short_8","alias_value":"IG4VSPZS","created_at":"2026-05-26T01:03:21.134932+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.07193","citing_title":"Coupling Models for One-Step Discrete Generation","ref_index":1,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR","json":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR.json","graph_json":"https://pith.science/api/pith-number/IG4VSPZSGNB2GDCRNBS3JZF5BR/graph.json","events_json":"https://pith.science/api/pith-number/IG4VSPZSGNB2GDCRNBS3JZF5BR/events.json","paper":"https://pith.science/paper/IG4VSPZS"},"agent_actions":{"view_html":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR","download_json":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR.json","view_paper":"https://pith.science/paper/IG4VSPZS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2512.20063&json=true","fetch_graph":"https://pith.science/api/pith-number/IG4VSPZSGNB2GDCRNBS3JZF5BR/graph.json","fetch_events":"https://pith.science/api/pith-number/IG4VSPZSGNB2GDCRNBS3JZF5BR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR/action/storage_attestation","attest_author":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR/action/author_attestation","sign_citation":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR/action/citation_signature","submit_replication":"https://pith.science/pith/IG4VSPZSGNB2GDCRNBS3JZF5BR/action/replication_record"}},"created_at":"2026-05-26T01:03:21.134932+00:00","updated_at":"2026-05-26T01:03:21.134932+00:00"}