{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:DZPUEXKORGONITBTQNPGPSUGZA","short_pith_number":"pith:DZPUEXKO","schema_version":"1.0","canonical_sha256":"1e5f425d4e899cd44c33835e67ca86c8083caa709db04e5b6573be4803033946","source":{"kind":"arxiv","id":"1402.0590","version":1},"attestation_state":"computed","paper":{"title":"A Survey of Multi-Objective Sequential Decision-Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Diederik Marijn Roijers, Peter Vamplew, Richard Dazeley, Shimon Whiteson","submitted_at":"2014-02-04T01:45:08Z","abstract_excerpt":"Sequential decision-making problems with multiple objectives arise naturally in practice and pose unique challenges for research in decision-theoretic planning and learning, which has largely focused on single-objective settings. This article surveys algorithms designed for sequential decision-making problems with multiple objectives. Though there is a growing body of literature on this subject, little of it makes explicit under what circumstances special methods are needed to solve multi-objective problems. Therefore, we identify three distinct scenarios in which converting such a problem to "},"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":"1402.0590","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2014-02-04T01:45:08Z","cross_cats_sorted":[],"title_canon_sha256":"d7cc2e0f91f21df946e28e848da47b5660c84b8cb75ba08495a46f80d13627be","abstract_canon_sha256":"62cee48eea1640b846ae63819c55107553212f1279e23f12a7196ce05b5d0455"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:00:13.649432Z","signature_b64":"BhOrY8Q916i6zWR5zLF732rBg69+g/uzKrxC5gTLKNn/KS6+GV21ybb9lR9sN5tSLjartOGmXNsSOfrw7hAyDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1e5f425d4e899cd44c33835e67ca86c8083caa709db04e5b6573be4803033946","last_reissued_at":"2026-05-18T03:00:13.648785Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:00:13.648785Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Survey of Multi-Objective Sequential Decision-Making","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.AI","authors_text":"Diederik Marijn Roijers, Peter Vamplew, Richard Dazeley, Shimon Whiteson","submitted_at":"2014-02-04T01:45:08Z","abstract_excerpt":"Sequential decision-making problems with multiple objectives arise naturally in practice and pose unique challenges for research in decision-theoretic planning and learning, which has largely focused on single-objective settings. This article surveys algorithms designed for sequential decision-making problems with multiple objectives. Though there is a growing body of literature on this subject, little of it makes explicit under what circumstances special methods are needed to solve multi-objective problems. Therefore, we identify three distinct scenarios in which converting such a problem to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.0590","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":""},"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":"1402.0590","created_at":"2026-05-18T03:00:13.648914+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.0590v1","created_at":"2026-05-18T03:00:13.648914+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.0590","created_at":"2026-05-18T03:00:13.648914+00:00"},{"alias_kind":"pith_short_12","alias_value":"DZPUEXKORGON","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_16","alias_value":"DZPUEXKORGONITBT","created_at":"2026-05-18T12:28:25.294606+00:00"},{"alias_kind":"pith_short_8","alias_value":"DZPUEXKO","created_at":"2026-05-18T12:28:25.294606+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2605.20164","citing_title":"Not Every Rubric Teaches Equally: Policy-Aware Rubric Rewards for RLVR","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA","json":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA.json","graph_json":"https://pith.science/api/pith-number/DZPUEXKORGONITBTQNPGPSUGZA/graph.json","events_json":"https://pith.science/api/pith-number/DZPUEXKORGONITBTQNPGPSUGZA/events.json","paper":"https://pith.science/paper/DZPUEXKO"},"agent_actions":{"view_html":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA","download_json":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA.json","view_paper":"https://pith.science/paper/DZPUEXKO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.0590&json=true","fetch_graph":"https://pith.science/api/pith-number/DZPUEXKORGONITBTQNPGPSUGZA/graph.json","fetch_events":"https://pith.science/api/pith-number/DZPUEXKORGONITBTQNPGPSUGZA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA/action/storage_attestation","attest_author":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA/action/author_attestation","sign_citation":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA/action/citation_signature","submit_replication":"https://pith.science/pith/DZPUEXKORGONITBTQNPGPSUGZA/action/replication_record"}},"created_at":"2026-05-18T03:00:13.648914+00:00","updated_at":"2026-05-18T03:00:13.648914+00:00"}