{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:CHDAGZO4LIL7QH772RU5FZME2H","short_pith_number":"pith:CHDAGZO4","schema_version":"1.0","canonical_sha256":"11c60365dc5a17f81fffd469d2e584d1d216c891e1f7cb4eba713600ae3a2a93","source":{"kind":"arxiv","id":"1502.05443","version":2},"attestation_state":"computed","paper":{"title":"Influence-Optimistic Local Values for Multiagent Planning --- Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.AI","authors_text":"Frans A. Oliehoek, Matthijs T.J. Spaan, Stefan Witwicki","submitted_at":"2015-02-18T23:42:24Z","abstract_excerpt":"Recent years have seen the development of methods for multiagent planning under uncertainty that scale to tens or even hundreds of agents. However, most of these methods either make restrictive assumptions on the problem domain, or provide approximate solutions without any guarantees on quality. Methods in the former category typically build on heuristic search using upper bounds on the value function. Unfortunately, no techniques exist to compute such upper bounds for problems with non-factored value functions. To allow for meaningful benchmarking through measurable quality guarantees on a ve"},"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":"1502.05443","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.AI","submitted_at":"2015-02-18T23:42:24Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"6590b3302f544e99ce300f110abe6af97bf9d0652932462534f81a3088c9a369","abstract_canon_sha256":"73306a31e33d558227d35dd9300476520c8bff54dd4f29c2df505a92668cf64b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:38.417608Z","signature_b64":"ZZ/qC5WP5lazhuWGwtqgk1v1E8WFPb680SniQ9qYKir+W7jCP0w1jQ8qBcwiblRsabjtqmIxga0xEQkIwfSmAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"11c60365dc5a17f81fffd469d2e584d1d216c891e1f7cb4eba713600ae3a2a93","last_reissued_at":"2026-05-18T01:36:38.417018Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:38.417018Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Influence-Optimistic Local Values for Multiagent Planning --- Extended Version","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.AI","authors_text":"Frans A. Oliehoek, Matthijs T.J. Spaan, Stefan Witwicki","submitted_at":"2015-02-18T23:42:24Z","abstract_excerpt":"Recent years have seen the development of methods for multiagent planning under uncertainty that scale to tens or even hundreds of agents. However, most of these methods either make restrictive assumptions on the problem domain, or provide approximate solutions without any guarantees on quality. Methods in the former category typically build on heuristic search using upper bounds on the value function. Unfortunately, no techniques exist to compute such upper bounds for problems with non-factored value functions. To allow for meaningful benchmarking through measurable quality guarantees on a ve"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.05443","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1502.05443","created_at":"2026-05-18T01:36:38.417117+00:00"},{"alias_kind":"arxiv_version","alias_value":"1502.05443v2","created_at":"2026-05-18T01:36:38.417117+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.05443","created_at":"2026-05-18T01:36:38.417117+00:00"},{"alias_kind":"pith_short_12","alias_value":"CHDAGZO4LIL7","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_16","alias_value":"CHDAGZO4LIL7QH77","created_at":"2026-05-18T12:29:14.074870+00:00"},{"alias_kind":"pith_short_8","alias_value":"CHDAGZO4","created_at":"2026-05-18T12:29:14.074870+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/CHDAGZO4LIL7QH772RU5FZME2H","json":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H.json","graph_json":"https://pith.science/api/pith-number/CHDAGZO4LIL7QH772RU5FZME2H/graph.json","events_json":"https://pith.science/api/pith-number/CHDAGZO4LIL7QH772RU5FZME2H/events.json","paper":"https://pith.science/paper/CHDAGZO4"},"agent_actions":{"view_html":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H","download_json":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H.json","view_paper":"https://pith.science/paper/CHDAGZO4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1502.05443&json=true","fetch_graph":"https://pith.science/api/pith-number/CHDAGZO4LIL7QH772RU5FZME2H/graph.json","fetch_events":"https://pith.science/api/pith-number/CHDAGZO4LIL7QH772RU5FZME2H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H/action/storage_attestation","attest_author":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H/action/author_attestation","sign_citation":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H/action/citation_signature","submit_replication":"https://pith.science/pith/CHDAGZO4LIL7QH772RU5FZME2H/action/replication_record"}},"created_at":"2026-05-18T01:36:38.417117+00:00","updated_at":"2026-05-18T01:36:38.417117+00:00"}