{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:4LO2MYYYSG5D3OTHXHRT2VTUKK","short_pith_number":"pith:4LO2MYYY","schema_version":"1.0","canonical_sha256":"e2dda6631891ba3dba67b9e33d56745293365af076dfc230b273e69a62fc22d1","source":{"kind":"arxiv","id":"1404.5453","version":1},"attestation_state":"computed","paper":{"title":"Games with a Weak Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Laurent Doyen","submitted_at":"2014-04-22T10:48:30Z","abstract_excerpt":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. Th"},"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":"1404.5453","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-22T10:48:30Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"7f32e9be338f3ae932ae26d1e80b3ecab7e272418fe39a182a4c3f411820f3f9","abstract_canon_sha256":"0569720835ffd601c5eb1bc029f81fc8fd105aaf2a76aa0b3f83f5c6f61f573b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:53:31.362383Z","signature_b64":"AatOEhGUZhu8sFrigFTpnhj1a3bdsTiIYhG+vY2Gg9dVWE6xSNiCwEQhhwHiiATjrM4TklyoJSHUTShzDVj3BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e2dda6631891ba3dba67b9e33d56745293365af076dfc230b273e69a62fc22d1","last_reissued_at":"2026-05-18T02:53:31.361690Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:53:31.361690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Games with a Weak Adversary","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Laurent Doyen","submitted_at":"2014-04-22T10:48:30Z","abstract_excerpt":"We consider multi-player graph games with partial-observation and parity objective. While the decision problem for three-player games with a coalition of the first and second players against the third player is undecidable, we present a decidability result for partial-observation games where the first and third player are in a coalition against the second player, thus where the second player is adversarial but weaker due to partial-observation. We establish tight complexity bounds in the case where player 1 is less informed than player 2, namely 2-EXPTIME-completeness for parity objectives. Th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5453","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":"1404.5453","created_at":"2026-05-18T02:53:31.361820+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.5453v1","created_at":"2026-05-18T02:53:31.361820+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5453","created_at":"2026-05-18T02:53:31.361820+00:00"},{"alias_kind":"pith_short_12","alias_value":"4LO2MYYYSG5D","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_16","alias_value":"4LO2MYYYSG5D3OTH","created_at":"2026-05-18T12:28:14.216126+00:00"},{"alias_kind":"pith_short_8","alias_value":"4LO2MYYY","created_at":"2026-05-18T12:28:14.216126+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/4LO2MYYYSG5D3OTHXHRT2VTUKK","json":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK.json","graph_json":"https://pith.science/api/pith-number/4LO2MYYYSG5D3OTHXHRT2VTUKK/graph.json","events_json":"https://pith.science/api/pith-number/4LO2MYYYSG5D3OTHXHRT2VTUKK/events.json","paper":"https://pith.science/paper/4LO2MYYY"},"agent_actions":{"view_html":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK","download_json":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK.json","view_paper":"https://pith.science/paper/4LO2MYYY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.5453&json=true","fetch_graph":"https://pith.science/api/pith-number/4LO2MYYYSG5D3OTHXHRT2VTUKK/graph.json","fetch_events":"https://pith.science/api/pith-number/4LO2MYYYSG5D3OTHXHRT2VTUKK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/action/storage_attestation","attest_author":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/action/author_attestation","sign_citation":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/action/citation_signature","submit_replication":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/action/replication_record"}},"created_at":"2026-05-18T02:53:31.361820+00:00","updated_at":"2026-05-18T02:53:31.361820+00:00"}