{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:OUN6TZS73ZJESTSWAODCN4G57W","short_pith_number":"pith:OUN6TZS7","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"},"canonical_sha256":"751be9e65fde52494e56038626f0ddfd831796be8355be517381ac8b6133fb7e","source":{"kind":"arxiv","id":"2406.01150","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.01150","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"2406.01150v2","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01150","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"OUN6TZS73ZJE","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"pith_short_16","alias_value":"OUN6TZS73ZJESTSW","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"pith_short_8","alias_value":"OUN6TZS7","created_at":"2026-07-05T10:18:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:OUN6TZS73ZJESTSWAODCN4G57W","target":"record","payload":{"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"},"canonical_sha256":"751be9e65fde52494e56038626f0ddfd831796be8355be517381ac8b6133fb7e","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"},"source_kind":"arxiv","source_id":"2406.01150","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QaZl086TuAndzeAJjMdI0rmb+5eCS7qqvBOwBlcJFQUSr1YF6VXOPL/bl/K2ir/jZNNR2EpXzvEPmpIxcjMjAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:17:27.023437Z"},"content_sha256":"bd07592a0fa36eb4ed353cdf17ee621b42e2106e0a9105f4a8ad92f2d7e06ced","schema_version":"1.0","event_id":"sha256:bd07592a0fa36eb4ed353cdf17ee621b42e2106e0a9105f4a8ad92f2d7e06ced"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:OUN6TZS73ZJESTSWAODCN4G57W","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T10:18:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"yl5AuF5gXtgLnC8vEOpLQbPDmrGyGcyzUywmxbQjIch88cSGCSPsbL/zR5fMvKXqjvBLjOoDObwgAIvMCm76Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-24T01:17:27.023932Z"},"content_sha256":"fcb5e838d15b917f5ebf1cff908f7f85121c04afb594c8024910d2607df8e6a4","schema_version":"1.0","event_id":"sha256:fcb5e838d15b917f5ebf1cff908f7f85121c04afb594c8024910d2607df8e6a4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/bundle.json","state_url":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OUN6TZS73ZJESTSWAODCN4G57W/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-24T01:17:27Z","links":{"resolver":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W","bundle":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/bundle.json","state":"https://pith.science/pith/OUN6TZS73ZJESTSWAODCN4G57W/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OUN6TZS73ZJESTSWAODCN4G57W/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:OUN6TZS73ZJESTSWAODCN4G57W","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6b2d321cbe1ca3388a6fbba212caf935fa049a20954a297bd88075785d81a8ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-03T09:44:10Z","title_canon_sha256":"9ca587d99248a3fdf0359107ea18a5361d5cabf365d6f47a5e1a3cc52a060a67"},"schema_version":"1.0","source":{"id":"2406.01150","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2406.01150","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"arxiv_version","alias_value":"2406.01150v2","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2406.01150","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"pith_short_12","alias_value":"OUN6TZS73ZJE","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"pith_short_16","alias_value":"OUN6TZS73ZJESTSW","created_at":"2026-07-05T10:18:37Z"},{"alias_kind":"pith_short_8","alias_value":"OUN6TZS7","created_at":"2026-07-05T10:18:37Z"}],"graph_snapshots":[{"event_id":"sha256:fcb5e838d15b917f5ebf1cff908f7f85121c04afb594c8024910d2607df8e6a4","target":"graph","created_at":"2026-07-05T10:18:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2406.01150/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Can Chang, Haoran He, Huazhe Xu, Ling Pan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-03T09:44:10Z","title":"Looking Backward: Retrospective Backward Synthesis for Goal-Conditioned GFlowNets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2406.01150","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:bd07592a0fa36eb4ed353cdf17ee621b42e2106e0a9105f4a8ad92f2d7e06ced","target":"record","created_at":"2026-07-05T10:18:37Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6b2d321cbe1ca3388a6fbba212caf935fa049a20954a297bd88075785d81a8ae","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2024-06-03T09:44:10Z","title_canon_sha256":"9ca587d99248a3fdf0359107ea18a5361d5cabf365d6f47a5e1a3cc52a060a67"},"schema_version":"1.0","source":{"id":"2406.01150","kind":"arxiv","version":2}},"canonical_sha256":"751be9e65fde52494e56038626f0ddfd831796be8355be517381ac8b6133fb7e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"751be9e65fde52494e56038626f0ddfd831796be8355be517381ac8b6133fb7e","first_computed_at":"2026-07-05T10:18:37.692107Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:18:37.692107Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"U90pjEhmWcaBcKzYsFYJ+hV3Fa9n4UCSVsvMiHUZ0G2oN+VpYVLn4bRttL+9cXNnuhEj+0TCBeF367oXHl/2Bw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:18:37.692552Z","signed_message":"canonical_sha256_bytes"},"source_id":"2406.01150","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bd07592a0fa36eb4ed353cdf17ee621b42e2106e0a9105f4a8ad92f2d7e06ced","sha256:fcb5e838d15b917f5ebf1cff908f7f85121c04afb594c8024910d2607df8e6a4"],"state_sha256":"f5627d66a15b301fd06bb933d6ff717323bd8fcd75699dc34e3060314b9197b0"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4X+c0yyFmpC1jwe0I+vHhddivnpJpZekPlwk4BqYJBDhyxU+LrK2lHwQ/mC4kIo602KyISJy4OveHlCc6jcBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-24T01:17:27.027703Z","bundle_sha256":"48dd27726aa77dbea4f7a5d4a86c9bbfb5ab17a72b65ad5d68a2cec5a45eb43b"}}