{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:X4R76VQWS57XVZCVCH3JXH45PH","short_pith_number":"pith:X4R76VQW","schema_version":"1.0","canonical_sha256":"bf23ff5616977f7ae45511f69b9f9d79f41af28ba83e91d84766411ed4d24261","source":{"kind":"arxiv","id":"2103.10028","version":4},"attestation_state":"computed","paper":{"title":"A Dynamic Program for a Team of Two Agents with Nested Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aditya Dave, Andreas A. Malikopoulos","submitted_at":"2021-03-18T05:51:18Z","abstract_excerpt":"In this paper, we investigate a sequential dynamic team problem consisting of two agents with a nested information structure. We use a combination of the person-by-person and prescription approach to derive structural results for optimal control strategies for the team. We then use these structural results to present a dynamic programming (DP) decomposition to derive the optimal control strategies for a finite time horizon. We show that our DP utilizes the nested information structure to simplify the computation of the optimal control laws for the team at the final time step."},"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":"2103.10028","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-03-18T05:51:18Z","cross_cats_sorted":[],"title_canon_sha256":"8d5d2bdfade4b97d7c1889319695d0aa80318c7f07679fa13df57efcb69ebfc2","abstract_canon_sha256":"363ab731c0365906e0e83b632fdfe0d589453384c943322aaff57c60bbe8bc5d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:51:42.707923Z","signature_b64":"zOtd+QOFhHEvyirXj6XQAVJ3q9+d4HwJJ+u4cx8Yy84vRvj/ePc15mE71zbruygWlFws92K+i7pq77vH4SpmCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf23ff5616977f7ae45511f69b9f9d79f41af28ba83e91d84766411ed4d24261","last_reissued_at":"2026-07-05T03:51:42.707501Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:51:42.707501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Dynamic Program for a Team of Two Agents with Nested Information","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Aditya Dave, Andreas A. Malikopoulos","submitted_at":"2021-03-18T05:51:18Z","abstract_excerpt":"In this paper, we investigate a sequential dynamic team problem consisting of two agents with a nested information structure. We use a combination of the person-by-person and prescription approach to derive structural results for optimal control strategies for the team. We then use these structural results to present a dynamic programming (DP) decomposition to derive the optimal control strategies for a finite time horizon. We show that our DP utilizes the nested information structure to simplify the computation of the optimal control laws for the team at the final time step."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2103.10028","kind":"arxiv","version":4},"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/2103.10028/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":"2103.10028","created_at":"2026-07-05T03:51:42.707556+00:00"},{"alias_kind":"arxiv_version","alias_value":"2103.10028v4","created_at":"2026-07-05T03:51:42.707556+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2103.10028","created_at":"2026-07-05T03:51:42.707556+00:00"},{"alias_kind":"pith_short_12","alias_value":"X4R76VQWS57X","created_at":"2026-07-05T03:51:42.707556+00:00"},{"alias_kind":"pith_short_16","alias_value":"X4R76VQWS57XVZCV","created_at":"2026-07-05T03:51:42.707556+00:00"},{"alias_kind":"pith_short_8","alias_value":"X4R76VQW","created_at":"2026-07-05T03:51:42.707556+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/X4R76VQWS57XVZCVCH3JXH45PH","json":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH.json","graph_json":"https://pith.science/api/pith-number/X4R76VQWS57XVZCVCH3JXH45PH/graph.json","events_json":"https://pith.science/api/pith-number/X4R76VQWS57XVZCVCH3JXH45PH/events.json","paper":"https://pith.science/paper/X4R76VQW"},"agent_actions":{"view_html":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH","download_json":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH.json","view_paper":"https://pith.science/paper/X4R76VQW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2103.10028&json=true","fetch_graph":"https://pith.science/api/pith-number/X4R76VQWS57XVZCVCH3JXH45PH/graph.json","fetch_events":"https://pith.science/api/pith-number/X4R76VQWS57XVZCVCH3JXH45PH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH/action/storage_attestation","attest_author":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH/action/author_attestation","sign_citation":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH/action/citation_signature","submit_replication":"https://pith.science/pith/X4R76VQWS57XVZCVCH3JXH45PH/action/replication_record"}},"created_at":"2026-07-05T03:51:42.707556+00:00","updated_at":"2026-07-05T03:51:42.707556+00:00"}