{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:WRDAQX43YK2UK6LPHX2CHCK7DN","short_pith_number":"pith:WRDAQX43","schema_version":"1.0","canonical_sha256":"b446085f9bc2b545796f3df423895f1b556060d153b6d2e382f6dfce63c90006","source":{"kind":"arxiv","id":"2302.05793","version":3},"attestation_state":"computed","paper":{"title":"Distributional GFlowNets with Quantile Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Courville, Dinghuai Zhang, Ling Pan, Ricky T. Q. Chen, Yoshua Bengio","submitted_at":"2023-02-11T22:06:17Z","abstract_excerpt":"Generative Flow Networks (GFlowNets) are a new family of probabilistic samplers where an agent learns a stochastic policy for generating complex combinatorial structure through a series of decision-making steps. Despite being inspired from reinforcement learning, the current GFlowNet framework is relatively limited in its applicability and cannot handle stochasticity in the reward function. In this work, we adopt a distributional paradigm for GFlowNets, turning each flow function into a distribution, thus providing more informative learning signals during training. By parameterizing each edge "},"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":"2302.05793","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2023-02-11T22:06:17Z","cross_cats_sorted":["cs.AI","stat.CO","stat.ML"],"title_canon_sha256":"00ee4a4309e552adee41fe424783382b506c44c1687fdfb1084a3e1f8c2fd77e","abstract_canon_sha256":"0da6b6d3f82ee5bf624767027f731d9233359bfdb950d9c459492b524a225e01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:46:15.760961Z","signature_b64":"iyaOE1QxOPX5hjMPAj7Ntn+73iMGZIWO55w1Fvub0auAFy9/gJq5mzxIvtgyrDTY0mrV6pCYXismZDKPwif+Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b446085f9bc2b545796f3df423895f1b556060d153b6d2e382f6dfce63c90006","last_reissued_at":"2026-07-05T07:46:15.760469Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:46:15.760469Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributional GFlowNets with Quantile Flows","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI","stat.CO","stat.ML"],"primary_cat":"cs.LG","authors_text":"Aaron Courville, Dinghuai Zhang, Ling Pan, Ricky T. Q. Chen, Yoshua Bengio","submitted_at":"2023-02-11T22:06:17Z","abstract_excerpt":"Generative Flow Networks (GFlowNets) are a new family of probabilistic samplers where an agent learns a stochastic policy for generating complex combinatorial structure through a series of decision-making steps. Despite being inspired from reinforcement learning, the current GFlowNet framework is relatively limited in its applicability and cannot handle stochasticity in the reward function. In this work, we adopt a distributional paradigm for GFlowNets, turning each flow function into a distribution, thus providing more informative learning signals during training. By parameterizing each edge "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2302.05793","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/2302.05793/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":"2302.05793","created_at":"2026-07-05T07:46:15.760530+00:00"},{"alias_kind":"arxiv_version","alias_value":"2302.05793v3","created_at":"2026-07-05T07:46:15.760530+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2302.05793","created_at":"2026-07-05T07:46:15.760530+00:00"},{"alias_kind":"pith_short_12","alias_value":"WRDAQX43YK2U","created_at":"2026-07-05T07:46:15.760530+00:00"},{"alias_kind":"pith_short_16","alias_value":"WRDAQX43YK2UK6LP","created_at":"2026-07-05T07:46:15.760530+00:00"},{"alias_kind":"pith_short_8","alias_value":"WRDAQX43","created_at":"2026-07-05T07:46:15.760530+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.06272","citing_title":"Your GFlowNet Secretly Learns an Optimal Transport Plan","ref_index":106,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN","json":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN.json","graph_json":"https://pith.science/api/pith-number/WRDAQX43YK2UK6LPHX2CHCK7DN/graph.json","events_json":"https://pith.science/api/pith-number/WRDAQX43YK2UK6LPHX2CHCK7DN/events.json","paper":"https://pith.science/paper/WRDAQX43"},"agent_actions":{"view_html":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN","download_json":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN.json","view_paper":"https://pith.science/paper/WRDAQX43","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2302.05793&json=true","fetch_graph":"https://pith.science/api/pith-number/WRDAQX43YK2UK6LPHX2CHCK7DN/graph.json","fetch_events":"https://pith.science/api/pith-number/WRDAQX43YK2UK6LPHX2CHCK7DN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN/action/storage_attestation","attest_author":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN/action/author_attestation","sign_citation":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN/action/citation_signature","submit_replication":"https://pith.science/pith/WRDAQX43YK2UK6LPHX2CHCK7DN/action/replication_record"}},"created_at":"2026-07-05T07:46:15.760530+00:00","updated_at":"2026-07-05T07:46:15.760530+00:00"}