{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:PDKAM4ZPQ2ZK4MTRZHX2RVF44N","short_pith_number":"pith:PDKAM4ZP","schema_version":"1.0","canonical_sha256":"78d406732f86b2ae3271c9efa8d4bce37f918d14c7dad1b10a277ee8f27d1e2a","source":{"kind":"arxiv","id":"2405.18703","version":2},"attestation_state":"computed","paper":{"title":"Bridging the Gap between Partially Observable Stochastic Games and Sparse POMDP Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Tyler Becker, Zachary Sunberg","submitted_at":"2024-05-29T02:27:47Z","abstract_excerpt":"Many real-world decision problems involve the interaction of multiple self-interested agents with limited sensing ability. The partially observable stochastic game (POSG) provides a mathematical framework for modeling these problems, however solving a POSG requires difficult reasoning over two critical factors: (1) information revealed by partial observations and (2) decisions other agents make. In the single agent case, partially observable Markov decision process (POMDP) planning can efficiently address partial observability with particle filtering. In the multi-agent case, extensive form ga"},"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":"2405.18703","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.GT","submitted_at":"2024-05-29T02:27:47Z","cross_cats_sorted":[],"title_canon_sha256":"1c987f89903cacb5bfdbd88c74e0af783da86c6269703327354ccb484750df1d","abstract_canon_sha256":"87f7daaa83c3699e054a48e891991ddd235e01bc6b987360ce0ae6a9929c550d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:27:22.395078Z","signature_b64":"mmBvfSBSvcZaw/Cos0xHTgur/CdGzGKWUtl+aMu+zLReVdTe5BGoXHppX+OTu8/KqCi9AeNaZ7Tk1hSiVDQjDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"78d406732f86b2ae3271c9efa8d4bce37f918d14c7dad1b10a277ee8f27d1e2a","last_reissued_at":"2026-07-05T09:27:22.394613Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:27:22.394613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bridging the Gap between Partially Observable Stochastic Games and Sparse POMDP Methods","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Tyler Becker, Zachary Sunberg","submitted_at":"2024-05-29T02:27:47Z","abstract_excerpt":"Many real-world decision problems involve the interaction of multiple self-interested agents with limited sensing ability. The partially observable stochastic game (POSG) provides a mathematical framework for modeling these problems, however solving a POSG requires difficult reasoning over two critical factors: (1) information revealed by partial observations and (2) decisions other agents make. In the single agent case, partially observable Markov decision process (POMDP) planning can efficiently address partial observability with particle filtering. In the multi-agent case, extensive form ga"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.18703","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/2405.18703/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":"2405.18703","created_at":"2026-07-05T09:27:22.394673+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.18703v2","created_at":"2026-07-05T09:27:22.394673+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.18703","created_at":"2026-07-05T09:27:22.394673+00:00"},{"alias_kind":"pith_short_12","alias_value":"PDKAM4ZPQ2ZK","created_at":"2026-07-05T09:27:22.394673+00:00"},{"alias_kind":"pith_short_16","alias_value":"PDKAM4ZPQ2ZK4MTR","created_at":"2026-07-05T09:27:22.394673+00:00"},{"alias_kind":"pith_short_8","alias_value":"PDKAM4ZP","created_at":"2026-07-05T09:27:22.394673+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2602.01568","citing_title":"Efficiently Solving Mixed-Hierarchy Games with Quasi-Policy Approximations","ref_index":5,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N","json":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N.json","graph_json":"https://pith.science/api/pith-number/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/graph.json","events_json":"https://pith.science/api/pith-number/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/events.json","paper":"https://pith.science/paper/PDKAM4ZP"},"agent_actions":{"view_html":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N","download_json":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N.json","view_paper":"https://pith.science/paper/PDKAM4ZP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.18703&json=true","fetch_graph":"https://pith.science/api/pith-number/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/graph.json","fetch_events":"https://pith.science/api/pith-number/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/action/storage_attestation","attest_author":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/action/author_attestation","sign_citation":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/action/citation_signature","submit_replication":"https://pith.science/pith/PDKAM4ZPQ2ZK4MTRZHX2RVF44N/action/replication_record"}},"created_at":"2026-07-05T09:27:22.394673+00:00","updated_at":"2026-07-05T09:27:22.394673+00:00"}