{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:E3OJPEBFEFQ2YDT7B7LWFISG4J","short_pith_number":"pith:E3OJPEBF","canonical_record":{"source":{"id":"2204.05036","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T12:09:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"04f19f636359c065508e957fe0169aa8b458bf2d29590f42ac1640b25793acca","abstract_canon_sha256":"be9a4f23faea35029a176ca5e9f31fa48503f8579948b94012149fb13cabe1f7"},"schema_version":"1.0"},"canonical_sha256":"26dc9790252161ac0e7f0fd762a246e270e819b9dcc7ab4e346c296ceee46114","source":{"kind":"arxiv","id":"2204.05036","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.05036","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"2204.05036v1","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05036","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"E3OJPEBFEFQ2","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"E3OJPEBFEFQ2YDT7","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"E3OJPEBF","created_at":"2026-07-05T04:13:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:E3OJPEBFEFQ2YDT7B7LWFISG4J","target":"record","payload":{"canonical_record":{"source":{"id":"2204.05036","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T12:09:51Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"04f19f636359c065508e957fe0169aa8b458bf2d29590f42ac1640b25793acca","abstract_canon_sha256":"be9a4f23faea35029a176ca5e9f31fa48503f8579948b94012149fb13cabe1f7"},"schema_version":"1.0"},"canonical_sha256":"26dc9790252161ac0e7f0fd762a246e270e819b9dcc7ab4e346c296ceee46114","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:13:16.826451Z","signature_b64":"MkpLUiTOeeIJChblXnqy1hbiw4fG3dEqZU6Yc+GFdVTO8UtznKFjVMDfHjz+SzWTpaS1ZfJmNitSlxQjMZ8jCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"26dc9790252161ac0e7f0fd762a246e270e819b9dcc7ab4e346c296ceee46114","last_reissued_at":"2026-07-05T04:13:16.826002Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:13:16.826002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2204.05036","source_version":1,"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-05T04:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Ara7WzRGCinrbN1YYpvs0cYLoMYhRB1gxmoloNYtGUstl89flL2BaGA87aHaGRhpnTlPRgLdAc01hN4m4qq8Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:24:58.355357Z"},"content_sha256":"bf98ad27cc5a8751c60b1a402e89fcc7a9847e61552b6875a9a29375712e31c1","schema_version":"1.0","event_id":"sha256:bf98ad27cc5a8751c60b1a402e89fcc7a9847e61552b6875a9a29375712e31c1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:E3OJPEBFEFQ2YDT7B7LWFISG4J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Pareto Conditioned Networks","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Ann Now\\'e, Eugenio Bargiacchi, Mathieu Reymond","submitted_at":"2022-04-11T12:09:51Z","abstract_excerpt":"In multi-objective optimization, learning all the policies that reach Pareto-efficient solutions is an expensive process. The set of optimal policies can grow exponentially with the number of objectives, and recovering all solutions requires an exhaustive exploration of the entire state space. We propose Pareto Conditioned Networks (PCN), a method that uses a single neural network to encompass all non-dominated policies. PCN associates every past transition with its episode's return. It trains the network such that, when conditioned on this same return, it should reenact said transition. In do"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.05036","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/2204.05036/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-05T04:13:16Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IJUeKpeZVmYkkxLOzXTTOmrr0VFoHSRUWyPecDppZVinPaXMAMRP0u3eYTNXIVkuyZntiQdHeSzMuRHzJ7qQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:24:58.355768Z"},"content_sha256":"cf4256fc5a506eab42386de924747dee7f41794f4709b7a6de86a221db9bb9c9","schema_version":"1.0","event_id":"sha256:cf4256fc5a506eab42386de924747dee7f41794f4709b7a6de86a221db9bb9c9"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E3OJPEBFEFQ2YDT7B7LWFISG4J/bundle.json","state_url":"https://pith.science/pith/E3OJPEBFEFQ2YDT7B7LWFISG4J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E3OJPEBFEFQ2YDT7B7LWFISG4J/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-07-07T07:24:58Z","links":{"resolver":"https://pith.science/pith/E3OJPEBFEFQ2YDT7B7LWFISG4J","bundle":"https://pith.science/pith/E3OJPEBFEFQ2YDT7B7LWFISG4J/bundle.json","state":"https://pith.science/pith/E3OJPEBFEFQ2YDT7B7LWFISG4J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E3OJPEBFEFQ2YDT7B7LWFISG4J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:E3OJPEBFEFQ2YDT7B7LWFISG4J","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":"be9a4f23faea35029a176ca5e9f31fa48503f8579948b94012149fb13cabe1f7","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T12:09:51Z","title_canon_sha256":"04f19f636359c065508e957fe0169aa8b458bf2d29590f42ac1640b25793acca"},"schema_version":"1.0","source":{"id":"2204.05036","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2204.05036","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"arxiv_version","alias_value":"2204.05036v1","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2204.05036","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"pith_short_12","alias_value":"E3OJPEBFEFQ2","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"pith_short_16","alias_value":"E3OJPEBFEFQ2YDT7","created_at":"2026-07-05T04:13:16Z"},{"alias_kind":"pith_short_8","alias_value":"E3OJPEBF","created_at":"2026-07-05T04:13:16Z"}],"graph_snapshots":[{"event_id":"sha256:cf4256fc5a506eab42386de924747dee7f41794f4709b7a6de86a221db9bb9c9","target":"graph","created_at":"2026-07-05T04:13:16Z","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/2204.05036/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In multi-objective optimization, learning all the policies that reach Pareto-efficient solutions is an expensive process. The set of optimal policies can grow exponentially with the number of objectives, and recovering all solutions requires an exhaustive exploration of the entire state space. We propose Pareto Conditioned Networks (PCN), a method that uses a single neural network to encompass all non-dominated policies. PCN associates every past transition with its episode's return. It trains the network such that, when conditioned on this same return, it should reenact said transition. In do","authors_text":"Ann Now\\'e, Eugenio Bargiacchi, Mathieu Reymond","cross_cats":["cs.AI"],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T12:09:51Z","title":"Pareto Conditioned Networks"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2204.05036","kind":"arxiv","version":1},"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:bf98ad27cc5a8751c60b1a402e89fcc7a9847e61552b6875a9a29375712e31c1","target":"record","created_at":"2026-07-05T04:13:16Z","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":"be9a4f23faea35029a176ca5e9f31fa48503f8579948b94012149fb13cabe1f7","cross_cats_sorted":["cs.AI"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2022-04-11T12:09:51Z","title_canon_sha256":"04f19f636359c065508e957fe0169aa8b458bf2d29590f42ac1640b25793acca"},"schema_version":"1.0","source":{"id":"2204.05036","kind":"arxiv","version":1}},"canonical_sha256":"26dc9790252161ac0e7f0fd762a246e270e819b9dcc7ab4e346c296ceee46114","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"26dc9790252161ac0e7f0fd762a246e270e819b9dcc7ab4e346c296ceee46114","first_computed_at":"2026-07-05T04:13:16.826002Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:13:16.826002Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkpLUiTOeeIJChblXnqy1hbiw4fG3dEqZU6Yc+GFdVTO8UtznKFjVMDfHjz+SzWTpaS1ZfJmNitSlxQjMZ8jCg==","signature_status":"signed_v1","signed_at":"2026-07-05T04:13:16.826451Z","signed_message":"canonical_sha256_bytes"},"source_id":"2204.05036","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bf98ad27cc5a8751c60b1a402e89fcc7a9847e61552b6875a9a29375712e31c1","sha256:cf4256fc5a506eab42386de924747dee7f41794f4709b7a6de86a221db9bb9c9"],"state_sha256":"9386f68fe4d76e2d3f51d5bc2d25c920ad726ccf9a67d0e4027ef9ad8b61d6d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EiMM4LjuTE8K/hCY7UCjZ6Aksvcz1nvdhWgNrEuM8kK8n7XUbC15LWgO92WoCt/AgCCUAQBOpn3WVMqd439qCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:24:58.358396Z","bundle_sha256":"20307842549fe1ca25493f5d0fea0b5a78d9f3cfab8aef34a0b3efe939ce99c7"}}