{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:NSB633UZR7EFWTIEPJGF2QHZJK","short_pith_number":"pith:NSB633UZ","schema_version":"1.0","canonical_sha256":"6c83edee998fc85b4d047a4c5d40f94a97bc411becdbd363f05dd7fea6b24315","source":{"kind":"arxiv","id":"2307.01422","version":1},"attestation_state":"computed","paper":{"title":"Generative Flow Networks: a Markov Chain Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Tristan Deleu, Yoshua Bengio","submitted_at":"2023-07-04T01:28:02Z","abstract_excerpt":"While Markov chain Monte Carlo methods (MCMC) provide a general framework to sample from a probability distribution defined up to normalization, they often suffer from slow convergence to the target distribution when the latter is highly multi-modal. Recently, Generative Flow Networks (GFlowNets) have been proposed as an alternative framework to mitigate this issue when samples have a clear compositional structure, by treating sampling as a sequential decision making problem. Although they were initially introduced from the perspective of flow networks, the recent advances of GFlowNets draw mo"},"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":"2307.01422","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-07-04T01:28:02Z","cross_cats_sorted":[],"title_canon_sha256":"98bae421104c75eabd6bf28b4f596a0ca4bfe807a4af054d62d1a9911b5c9702","abstract_canon_sha256":"b65b582d9b477d4768d8ae3b413bf301e32d3c01ae1bad5dfa7612fa78459935"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:27:56.303653Z","signature_b64":"VJ4Up4hPpYIdACAGlstUTmPhUE2FG5btjG7jVxyiscv8L+tO4rjaPRd7T+IDB3J925bjUmcKCdv718T4av+OCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6c83edee998fc85b4d047a4c5d40f94a97bc411becdbd363f05dd7fea6b24315","last_reissued_at":"2026-07-05T06:27:56.303200Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:27:56.303200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generative Flow Networks: a Markov Chain Perspective","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Tristan Deleu, Yoshua Bengio","submitted_at":"2023-07-04T01:28:02Z","abstract_excerpt":"While Markov chain Monte Carlo methods (MCMC) provide a general framework to sample from a probability distribution defined up to normalization, they often suffer from slow convergence to the target distribution when the latter is highly multi-modal. Recently, Generative Flow Networks (GFlowNets) have been proposed as an alternative framework to mitigate this issue when samples have a clear compositional structure, by treating sampling as a sequential decision making problem. Although they were initially introduced from the perspective of flow networks, the recent advances of GFlowNets draw mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2307.01422","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/2307.01422/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":"2307.01422","created_at":"2026-07-05T06:27:56.303260+00:00"},{"alias_kind":"arxiv_version","alias_value":"2307.01422v1","created_at":"2026-07-05T06:27:56.303260+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2307.01422","created_at":"2026-07-05T06:27:56.303260+00:00"},{"alias_kind":"pith_short_12","alias_value":"NSB633UZR7EF","created_at":"2026-07-05T06:27:56.303260+00:00"},{"alias_kind":"pith_short_16","alias_value":"NSB633UZR7EFWTIE","created_at":"2026-07-05T06:27:56.303260+00:00"},{"alias_kind":"pith_short_8","alias_value":"NSB633UZ","created_at":"2026-07-05T06:27:56.303260+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":119,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK","json":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK.json","graph_json":"https://pith.science/api/pith-number/NSB633UZR7EFWTIEPJGF2QHZJK/graph.json","events_json":"https://pith.science/api/pith-number/NSB633UZR7EFWTIEPJGF2QHZJK/events.json","paper":"https://pith.science/paper/NSB633UZ"},"agent_actions":{"view_html":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK","download_json":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK.json","view_paper":"https://pith.science/paper/NSB633UZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2307.01422&json=true","fetch_graph":"https://pith.science/api/pith-number/NSB633UZR7EFWTIEPJGF2QHZJK/graph.json","fetch_events":"https://pith.science/api/pith-number/NSB633UZR7EFWTIEPJGF2QHZJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK/action/storage_attestation","attest_author":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK/action/author_attestation","sign_citation":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK/action/citation_signature","submit_replication":"https://pith.science/pith/NSB633UZR7EFWTIEPJGF2QHZJK/action/replication_record"}},"created_at":"2026-07-05T06:27:56.303260+00:00","updated_at":"2026-07-05T06:27:56.303260+00:00"}