{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:BXLKENHKMSIQ5HUQOED6ORLW2B","short_pith_number":"pith:BXLKENHK","canonical_record":{"source":{"id":"1802.01772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-06T03:02:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"157a52dee13e88054ff96497bef044a935fbe5f3c2ea294c4a14f4bd1ed803ac","abstract_canon_sha256":"6be719ac0a6a8088bc5eec37c130ae5455eb43ac154d09145378ee59e7b2bbd4"},"schema_version":"1.0"},"canonical_sha256":"0dd6a234ea64910e9e907107e74576d04085a627fd8bcafe1d4c991ebba36472","source":{"kind":"arxiv","id":"1802.01772","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01772","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01772v2","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01772","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"BXLKENHKMSIQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BXLKENHKMSIQ5HUQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BXLKENHK","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:BXLKENHKMSIQ5HUQOED6ORLW2B","target":"record","payload":{"canonical_record":{"source":{"id":"1802.01772","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-06T03:02:22Z","cross_cats_sorted":["cs.AI"],"title_canon_sha256":"157a52dee13e88054ff96497bef044a935fbe5f3c2ea294c4a14f4bd1ed803ac","abstract_canon_sha256":"6be719ac0a6a8088bc5eec37c130ae5455eb43ac154d09145378ee59e7b2bbd4"},"schema_version":"1.0"},"canonical_sha256":"0dd6a234ea64910e9e907107e74576d04085a627fd8bcafe1d4c991ebba36472","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:02.078356Z","signature_b64":"WnRCbUEDswLqaW2nkhlglP0g1u63zt75dakH67hMU8VPLWgVx/dxEnJooVGIF/qsjE3jRNXUywGbD4JZz5r4BA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0dd6a234ea64910e9e907107e74576d04085a627fd8bcafe1d4c991ebba36472","last_reissued_at":"2026-05-17T23:48:02.077652Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:02.077652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.01772","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-05-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GLZct+l8MkRWnwKdABIjI+Jjcr1X8YX5mlu+wQhyFOfZMZrQ0Paw/dRm2VZcdFQdgviYNf1LSUL6xNNoeZeNAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:18:35.560599Z"},"content_sha256":"a9a080721371c1e4ae91a1cacebc16bb4fbcf1273054b39ca7c84042a4fad14b","schema_version":"1.0","event_id":"sha256:a9a080721371c1e4ae91a1cacebc16bb4fbcf1273054b39ca7c84042a4fad14b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:BXLKENHKMSIQ5HUQOED6ORLW2B","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Decomposition Methods with Deep Corrections for Reinforcement Learning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.AI"],"primary_cat":"cs.LG","authors_text":"Alireza Nakhaei, Kikuo Fujimura, Kyle Julian, Maxime Bouton, Mykel J. Kochenderfer","submitted_at":"2018-02-06T03:02:22Z","abstract_excerpt":"Decomposition methods have been proposed to approximate solutions to large sequential decision making problems. In contexts where an agent interacts with multiple entities, utility decomposition can be used to separate the global objective into local tasks considering each individual entity independently. An arbitrator is then responsible for combining the individual utilities and selecting an action in real time to solve the global problem. Although these techniques can perform well empirically, they rely on strong assumptions of independence between the local tasks and sacrifice the optimali"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01772","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":""},"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-05-17T23:48:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kouc4EXhhaLKFHdJb6hXvm+5FPPwy1RCT3qLRuGdIBDbSGw0uKLtrC10kBH7hbbudN9V+HrY2zTxWqXPodUNAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T22:18:35.561296Z"},"content_sha256":"270d0705d55e41cdf2618339157cc31f4bd69f31d948e988e213140806479b7a","schema_version":"1.0","event_id":"sha256:270d0705d55e41cdf2618339157cc31f4bd69f31d948e988e213140806479b7a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BXLKENHKMSIQ5HUQOED6ORLW2B/bundle.json","state_url":"https://pith.science/pith/BXLKENHKMSIQ5HUQOED6ORLW2B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BXLKENHKMSIQ5HUQOED6ORLW2B/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-05-26T22:18:35Z","links":{"resolver":"https://pith.science/pith/BXLKENHKMSIQ5HUQOED6ORLW2B","bundle":"https://pith.science/pith/BXLKENHKMSIQ5HUQOED6ORLW2B/bundle.json","state":"https://pith.science/pith/BXLKENHKMSIQ5HUQOED6ORLW2B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BXLKENHKMSIQ5HUQOED6ORLW2B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:BXLKENHKMSIQ5HUQOED6ORLW2B","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":"6be719ac0a6a8088bc5eec37c130ae5455eb43ac154d09145378ee59e7b2bbd4","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-06T03:02:22Z","title_canon_sha256":"157a52dee13e88054ff96497bef044a935fbe5f3c2ea294c4a14f4bd1ed803ac"},"schema_version":"1.0","source":{"id":"1802.01772","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.01772","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.01772v2","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.01772","created_at":"2026-05-17T23:48:02Z"},{"alias_kind":"pith_short_12","alias_value":"BXLKENHKMSIQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"BXLKENHKMSIQ5HUQ","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"BXLKENHK","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:270d0705d55e41cdf2618339157cc31f4bd69f31d948e988e213140806479b7a","target":"graph","created_at":"2026-05-17T23:48:02Z","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"},"paper":{"abstract_excerpt":"Decomposition methods have been proposed to approximate solutions to large sequential decision making problems. In contexts where an agent interacts with multiple entities, utility decomposition can be used to separate the global objective into local tasks considering each individual entity independently. An arbitrator is then responsible for combining the individual utilities and selecting an action in real time to solve the global problem. Although these techniques can perform well empirically, they rely on strong assumptions of independence between the local tasks and sacrifice the optimali","authors_text":"Alireza Nakhaei, Kikuo Fujimura, Kyle Julian, Maxime Bouton, Mykel J. Kochenderfer","cross_cats":["cs.AI"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-06T03:02:22Z","title":"Decomposition Methods with Deep Corrections for Reinforcement Learning"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.01772","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:a9a080721371c1e4ae91a1cacebc16bb4fbcf1273054b39ca7c84042a4fad14b","target":"record","created_at":"2026-05-17T23:48:02Z","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":"6be719ac0a6a8088bc5eec37c130ae5455eb43ac154d09145378ee59e7b2bbd4","cross_cats_sorted":["cs.AI"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2018-02-06T03:02:22Z","title_canon_sha256":"157a52dee13e88054ff96497bef044a935fbe5f3c2ea294c4a14f4bd1ed803ac"},"schema_version":"1.0","source":{"id":"1802.01772","kind":"arxiv","version":2}},"canonical_sha256":"0dd6a234ea64910e9e907107e74576d04085a627fd8bcafe1d4c991ebba36472","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0dd6a234ea64910e9e907107e74576d04085a627fd8bcafe1d4c991ebba36472","first_computed_at":"2026-05-17T23:48:02.077652Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:02.077652Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WnRCbUEDswLqaW2nkhlglP0g1u63zt75dakH67hMU8VPLWgVx/dxEnJooVGIF/qsjE3jRNXUywGbD4JZz5r4BA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:02.078356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.01772","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9a080721371c1e4ae91a1cacebc16bb4fbcf1273054b39ca7c84042a4fad14b","sha256:270d0705d55e41cdf2618339157cc31f4bd69f31d948e988e213140806479b7a"],"state_sha256":"ab110ce98bf0daaed725f0f54a361b8994c3e1c0e03de57a12f17ef8640083a5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qnLuZRlmdaUOp1L0ahHuBNuRxIUmS09aoS3iRlzuEBzlNBLTP5m8JPm274GE+GJcLuVSmN333EI3BuW6L/yNBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T22:18:35.565267Z","bundle_sha256":"fb3a01184e35c7efda4375f64a5c56c6b327d8ad659c5c89fed229894afb2203"}}