{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OUN6TZS73ZJESTSWAODCN4G57W","short_pith_number":"pith:OUN6TZS7","schema_version":"1.0","canonical_sha256":"751be9e65fde52494e56038626f0ddfd831796be8355be517381ac8b6133fb7e","source":{"kind":"arxiv","id":"2406.01150","version":2},"attestation_state":"computed","paper":{"title":"Looking Backward: Retrospective Backward Synthesis for Goal-Conditioned GFlowNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Can Chang, Haoran He, Huazhe Xu, Ling Pan","submitted_at":"2024-06-03T09:44:10Z","abstract_excerpt":"Generative Flow Networks (GFlowNets), a new family of probabilistic samplers, have demonstrated remarkable capabilities to generate diverse sets of high-reward candidates, in contrast to standard return maximization approaches (e.g., reinforcement learning) which often converge to a single optimal solution. Recent works have focused on developing goal-conditioned GFlowNets, which aim to train a single GFlowNet capable of achieving different outcomes as the task specifies. However, training such models is challenging due to extremely sparse rewards, particularly in high-dimensional problems. 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":"2406.01150","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-03T09:44:10Z","cross_cats_sorted":[],"title_canon_sha256":"9ca587d99248a3fdf0359107ea18a5361d5cabf365d6f47a5e1a3cc52a060a67","abstract_canon_sha256":"6b2d321cbe1ca3388a6fbba212caf935fa049a20954a297bd88075785d81a8ae"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:18:37.692552Z","signature_b64":"U90pjEhmWcaBcKzYsFYJ+hV3Fa9n4UCSVsvMiHUZ0G2oN+VpYVLn4bRttL+9cXNnuhEj+0TCBeF367oXHl/2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"751be9e65fde52494e56038626f0ddfd831796be8355be517381ac8b6133fb7e","last_reissued_at":"2026-07-05T10:18:37.692107Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:18:37.692107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Looking Backward: Retrospective Backward Synthesis for Goal-Conditioned GFlowNets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Can Chang, Haoran He, Huazhe Xu, Ling Pan","submitted_at":"2024-06-03T09:44:10Z","abstract_excerpt":"Generative Flow Networks (GFlowNets), a new family of probabilistic samplers, have demonstrated remarkable capabilities to generate diverse sets of high-reward candidates, in contrast to standard return maximization approaches (e.g., reinforcement learning) which often converge to a single optimal solution. Recent works have focused on developing goal-conditioned GFlowNets, which aim to train a single GFlowNet capable of achieving different outcomes as the task specifies. However, training such models is challenging due to extremely sparse rewards, particularly in high-dimensional problems. Mo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01150","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/2406.01150/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":"2406.01150","created_at":"2026-07-05T10:18:37.692159+00:00"},{"alias_kind":"arxiv_version","alias_value":"2406.01150v2","created_at":"2026-07-05T10:18:37.692159+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01150","created_at":"2026-07-05T10:18:37.692159+00:00"},{"alias_kind":"pith_short_12","alias_value":"OUN6TZS73ZJE","created_at":"2026-07-05T10:18:37.692159+00:00"},{"alias_kind":"pith_short_16","alias_value":"OUN6TZS73ZJESTSW","created_at":"2026-07-05T10:18:37.692159+00:00"},{"alias_kind":"pith_short_8","alias_value":"OUN6TZS7","created_at":"2026-07-05T10:18:37.692159+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W","json":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W.json","graph_json":"https://pith.science/api/pith-number/OUN6TZS73ZJESTSWAODCN4G57W/graph.json","events_json":"https://pith.science/api/pith-number/OUN6TZS73ZJESTSWAODCN4G57W/events.json","paper":"https://pith.science/paper/OUN6TZS7"},"agent_actions":{"view_html":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W","download_json":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W.json","view_paper":"https://pith.science/paper/OUN6TZS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2406.01150&json=true","fetch_graph":"https://pith.science/api/pith-number/OUN6TZS73ZJESTSWAODCN4G57W/graph.json","fetch_events":"https://pith.science/api/pith-number/OUN6TZS73ZJESTSWAODCN4G57W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/action/storage_attestation","attest_author":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/action/author_attestation","sign_citation":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/action/citation_signature","submit_replication":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/action/replication_record"}},"created_at":"2026-07-05T10:18:37.692159+00:00","updated_at":"2026-07-05T10:18:37.692159+00:00"}