{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:4LO2MYYYSG5D3OTHXHRT2VTUKK","short_pith_number":"pith:4LO2MYYY","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"},"canonical_sha256":"e2dda6631891ba3dba67b9e33d56745293365af076dfc230b273e69a62fc22d1","source":{"kind":"arxiv","id":"1404.5453","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5453","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5453v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5453","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"4LO2MYYYSG5D","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4LO2MYYYSG5D3OTH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4LO2MYYY","created_at":"2026-05-18T12:28:14Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:4LO2MYYYSG5D3OTHXHRT2VTUKK","target":"record","payload":{"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"},"canonical_sha256":"e2dda6631891ba3dba67b9e33d56745293365af076dfc230b273e69a62fc22d1","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"},"source_kind":"arxiv","source_id":"1404.5453","source_version":1,"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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V2q4QyRVb/m7ep1pT81uqc62naPoJMbI2jnLNSNROKI05ZfT4eQ8XChdPrgxy6f+DMZUVRDTmB4XN2W9F6XDAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:12:18.229741Z"},"content_sha256":"cf1d34f355230d537062cdf1a8bf20bb754e2348f0662ac8421344d039c2dd34","schema_version":"1.0","event_id":"sha256:cf1d34f355230d537062cdf1a8bf20bb754e2348f0662ac8421344d039c2dd34"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:4LO2MYYYSG5D3OTHXHRT2VTUKK","target":"graph","payload":{"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"},"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-18T02:53:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8uyHQKJe6Qww8XXdV2eHPehOm+tWXWRLqkTUBBABIcOIsLiaz8VAVmGFRJR9uqK/3vuGmI+vhCE8/5xGHApKCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T17:12:18.230453Z"},"content_sha256":"7ee56468fd11ffebc42a9d01fa0e02d985b161a23c603a5a2cdbb0bdda3cb3a6","schema_version":"1.0","event_id":"sha256:7ee56468fd11ffebc42a9d01fa0e02d985b161a23c603a5a2cdbb0bdda3cb3a6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/bundle.json","state_url":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/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-25T17:12:18Z","links":{"resolver":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK","bundle":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/bundle.json","state":"https://pith.science/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4LO2MYYYSG5D3OTHXHRT2VTUKK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:4LO2MYYYSG5D3OTHXHRT2VTUKK","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":"0569720835ffd601c5eb1bc029f81fc8fd105aaf2a76aa0b3f83f5c6f61f573b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-22T10:48:30Z","title_canon_sha256":"7f32e9be338f3ae932ae26d1e80b3ecab7e272418fe39a182a4c3f411820f3f9"},"schema_version":"1.0","source":{"id":"1404.5453","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.5453","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"arxiv_version","alias_value":"1404.5453v1","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.5453","created_at":"2026-05-18T02:53:31Z"},{"alias_kind":"pith_short_12","alias_value":"4LO2MYYYSG5D","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_16","alias_value":"4LO2MYYYSG5D3OTH","created_at":"2026-05-18T12:28:14Z"},{"alias_kind":"pith_short_8","alias_value":"4LO2MYYY","created_at":"2026-05-18T12:28:14Z"}],"graph_snapshots":[{"event_id":"sha256:7ee56468fd11ffebc42a9d01fa0e02d985b161a23c603a5a2cdbb0bdda3cb3a6","target":"graph","created_at":"2026-05-18T02:53:31Z","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":"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","authors_text":"Krishnendu Chatterjee, Laurent Doyen","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-22T10:48:30Z","title":"Games with a Weak Adversary"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.5453","kind":"arxiv","version":1},"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:cf1d34f355230d537062cdf1a8bf20bb754e2348f0662ac8421344d039c2dd34","target":"record","created_at":"2026-05-18T02:53:31Z","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":"0569720835ffd601c5eb1bc029f81fc8fd105aaf2a76aa0b3f83f5c6f61f573b","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2014-04-22T10:48:30Z","title_canon_sha256":"7f32e9be338f3ae932ae26d1e80b3ecab7e272418fe39a182a4c3f411820f3f9"},"schema_version":"1.0","source":{"id":"1404.5453","kind":"arxiv","version":1}},"canonical_sha256":"e2dda6631891ba3dba67b9e33d56745293365af076dfc230b273e69a62fc22d1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e2dda6631891ba3dba67b9e33d56745293365af076dfc230b273e69a62fc22d1","first_computed_at":"2026-05-18T02:53:31.361690Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:53:31.361690Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AatOEhGUZhu8sFrigFTpnhj1a3bdsTiIYhG+vY2Gg9dVWE6xSNiCwEQhhwHiiATjrM4TklyoJSHUTShzDVj3BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:53:31.362383Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.5453","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf1d34f355230d537062cdf1a8bf20bb754e2348f0662ac8421344d039c2dd34","sha256:7ee56468fd11ffebc42a9d01fa0e02d985b161a23c603a5a2cdbb0bdda3cb3a6"],"state_sha256":"c5deb7dd94c13ba7aee094b339c3f11874fa088c8aa1d5a873f94fa5c3a4b8e4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"+PgKQ/T1kOGvNuQLqwc/OTSWv9PGXV356arsp5OPZRj4oWllNnoPgY8OWYocSb5D/dQxHJMRzNPRO0Y7gh9yBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T17:12:18.234699Z","bundle_sha256":"d6957cbec473f0d4d61715c2c3f878e52c11721ded4620a3b47825be3e9ee221"}}