{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:44EDHEOKIJQNFLP7RK2YAWQEWX","short_pith_number":"pith:44EDHEOK","schema_version":"1.0","canonical_sha256":"e7083391ca4260d2adff8ab5805a04b5c35bbafa28c215ea4cf326f38039ddcf","source":{"kind":"arxiv","id":"2501.17770","version":2},"attestation_state":"computed","paper":{"title":"Generative Unordered Flow for Set-Structured Data Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carola-Bibiane Sch\\\"onlieb, Chaoyu Liu, Yangming Li","submitted_at":"2025-01-29T17:03:44Z","abstract_excerpt":"Flow-based generative models have demonstrated promising performance across a broad spectrum of data modalities (e.g., image and text). However, there are few works exploring their extension to unordered data (e.g., spatial point set), which is not trivial because previous models are mostly designed for vector data that are naturally ordered. In this paper, we present unordered flow, a type of flow-based generative model for set-structured data generation. Specifically, we convert unordered data into an appropriate function representation, and learn the probability measure of such representati"},"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":"2501.17770","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2025-01-29T17:03:44Z","cross_cats_sorted":[],"title_canon_sha256":"ea87803fe1c8f181c50c84247cf3e1fe9a7763d7622bd83252d531dbe6d72639","abstract_canon_sha256":"201b233ad27f31511c188bf3b166c7bad22de330e61bec4e674199811b15fdfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:15:19.118688Z","signature_b64":"VAGCfzi5Z1jtKYx5ZZT2zP0fPQSWYfcWXPMNkQVRpt+auLFb7Jost50sYRYMgt8ZgRmxg3Slrhjuw8tcTMCSCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7083391ca4260d2adff8ab5805a04b5c35bbafa28c215ea4cf326f38039ddcf","last_reissued_at":"2026-07-05T11:15:19.118199Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:15:19.118199Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Unordered Flow for Set-Structured Data Generation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Carola-Bibiane Sch\\\"onlieb, Chaoyu Liu, Yangming Li","submitted_at":"2025-01-29T17:03:44Z","abstract_excerpt":"Flow-based generative models have demonstrated promising performance across a broad spectrum of data modalities (e.g., image and text). However, there are few works exploring their extension to unordered data (e.g., spatial point set), which is not trivial because previous models are mostly designed for vector data that are naturally ordered. In this paper, we present unordered flow, a type of flow-based generative model for set-structured data generation. Specifically, we convert unordered data into an appropriate function representation, and learn the probability measure of such representati"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.17770","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/2501.17770/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":"2501.17770","created_at":"2026-07-05T11:15:19.118254+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.17770v2","created_at":"2026-07-05T11:15:19.118254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.17770","created_at":"2026-07-05T11:15:19.118254+00:00"},{"alias_kind":"pith_short_12","alias_value":"44EDHEOKIJQN","created_at":"2026-07-05T11:15:19.118254+00:00"},{"alias_kind":"pith_short_16","alias_value":"44EDHEOKIJQNFLP7","created_at":"2026-07-05T11:15:19.118254+00:00"},{"alias_kind":"pith_short_8","alias_value":"44EDHEOK","created_at":"2026-07-05T11:15:19.118254+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.08424","citing_title":"Generalized Wasserstein Flow Matching: Transport Plans, Everywhere, All at Once","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX","json":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX.json","graph_json":"https://pith.science/api/pith-number/44EDHEOKIJQNFLP7RK2YAWQEWX/graph.json","events_json":"https://pith.science/api/pith-number/44EDHEOKIJQNFLP7RK2YAWQEWX/events.json","paper":"https://pith.science/paper/44EDHEOK"},"agent_actions":{"view_html":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX","download_json":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX.json","view_paper":"https://pith.science/paper/44EDHEOK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.17770&json=true","fetch_graph":"https://pith.science/api/pith-number/44EDHEOKIJQNFLP7RK2YAWQEWX/graph.json","fetch_events":"https://pith.science/api/pith-number/44EDHEOKIJQNFLP7RK2YAWQEWX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX/action/storage_attestation","attest_author":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX/action/author_attestation","sign_citation":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX/action/citation_signature","submit_replication":"https://pith.science/pith/44EDHEOKIJQNFLP7RK2YAWQEWX/action/replication_record"}},"created_at":"2026-07-05T11:15:19.118254+00:00","updated_at":"2026-07-05T11:15:19.118254+00:00"}