{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:E2K3CYKIZEUXHC2WEZYQ4PWXFC","short_pith_number":"pith:E2K3CYKI","canonical_record":{"source":{"id":"1506.02434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-08T10:52:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"68b44fcaed6c4b7fcbd0353bae319ef2e5fbe9be32829fef0b6f4df5227a2741","abstract_canon_sha256":"01ca7eedcfc7946ca9dd2b2c968b2395103451546ed1e72c8564988e98cecf11"},"schema_version":"1.0"},"canonical_sha256":"2695b16148c929738b5626710e3ed728bef1c1e5ed34224427ff1f195d63c0ec","source":{"kind":"arxiv","id":"1506.02434","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02434","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02434v1","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02434","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"E2K3CYKIZEUX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2K3CYKIZEUXHC2W","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2K3CYKI","created_at":"2026-05-18T12:29:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:E2K3CYKIZEUXHC2WEZYQ4PWXFC","target":"record","payload":{"canonical_record":{"source":{"id":"1506.02434","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-08T10:52:00Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"68b44fcaed6c4b7fcbd0353bae319ef2e5fbe9be32829fef0b6f4df5227a2741","abstract_canon_sha256":"01ca7eedcfc7946ca9dd2b2c968b2395103451546ed1e72c8564988e98cecf11"},"schema_version":"1.0"},"canonical_sha256":"2695b16148c929738b5626710e3ed728bef1c1e5ed34224427ff1f195d63c0ec","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:55:51.112797Z","signature_b64":"NcdyqofZn6EZ8zqOtrwGr9+R064FJVEbRNh/XX5Cle0gEmJTyfhTxiF62Wqj6G09DeTi1eOIigpWXeyomC52DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2695b16148c929738b5626710e3ed728bef1c1e5ed34224427ff1f195d63c0ec","last_reissued_at":"2026-05-18T01:55:51.112051Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:55:51.112051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.02434","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-18T01:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDKnLZ0AqYDan5+0yQF+Q/SlWDl4QqBCXF0G6Wa099DhKq0yobZUVkwTIPRQoPE8jZSyZvG42KMH1d0zgFu2DA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:26:50.968801Z"},"content_sha256":"60cc685021f880c2f48b7339fa668759e636c3b3fde5af2aa724ff96bad5d53a","schema_version":"1.0","event_id":"sha256:60cc685021f880c2f48b7339fa668759e636c3b3fde5af2aa724ff96bad5d53a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:E2K3CYKIZEUXHC2WEZYQ4PWXFC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen","submitted_at":"2015-06-08T10:52:00Z","abstract_excerpt":"We consider finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02434","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-18T01:55:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t4x+kLr0sDw6poCAyIxidu01mQCtqGWKkGkqkI+TMTGZf1j8cSqme8RgeMjHVrwukoM2nyqHJdKz3xFrijjiAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T19:26:50.969285Z"},"content_sha256":"e3a6ce462d5976f0278fdf68ddadc359c48ac8a8947b3abf3b4b2b21467d4f7e","schema_version":"1.0","event_id":"sha256:e3a6ce462d5976f0278fdf68ddadc359c48ac8a8947b3abf3b4b2b21467d4f7e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/E2K3CYKIZEUXHC2WEZYQ4PWXFC/bundle.json","state_url":"https://pith.science/pith/E2K3CYKIZEUXHC2WEZYQ4PWXFC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/E2K3CYKIZEUXHC2WEZYQ4PWXFC/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-25T19:26:50Z","links":{"resolver":"https://pith.science/pith/E2K3CYKIZEUXHC2WEZYQ4PWXFC","bundle":"https://pith.science/pith/E2K3CYKIZEUXHC2WEZYQ4PWXFC/bundle.json","state":"https://pith.science/pith/E2K3CYKIZEUXHC2WEZYQ4PWXFC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/E2K3CYKIZEUXHC2WEZYQ4PWXFC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:E2K3CYKIZEUXHC2WEZYQ4PWXFC","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":"01ca7eedcfc7946ca9dd2b2c968b2395103451546ed1e72c8564988e98cecf11","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-08T10:52:00Z","title_canon_sha256":"68b44fcaed6c4b7fcbd0353bae319ef2e5fbe9be32829fef0b6f4df5227a2741"},"schema_version":"1.0","source":{"id":"1506.02434","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.02434","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"arxiv_version","alias_value":"1506.02434v1","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.02434","created_at":"2026-05-18T01:55:51Z"},{"alias_kind":"pith_short_12","alias_value":"E2K3CYKIZEUX","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_16","alias_value":"E2K3CYKIZEUXHC2W","created_at":"2026-05-18T12:29:17Z"},{"alias_kind":"pith_short_8","alias_value":"E2K3CYKI","created_at":"2026-05-18T12:29:17Z"}],"graph_snapshots":[{"event_id":"sha256:e3a6ce462d5976f0278fdf68ddadc359c48ac8a8947b3abf3b4b2b21467d4f7e","target":"graph","created_at":"2026-05-18T01:55:51Z","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 finite-state concurrent stochastic games, played by k>=2 players for an infinite number of rounds, where in every round, each player simultaneously and independently of the other players chooses an action, whereafter the successor state is determined by a probability distribution given by the current state and the chosen actions. We consider reachability objectives that given a target set of states require that some state in the target is visited, and the dual safety objectives that given a target set require that only states in the target set are visited. We are interested in the ","authors_text":"Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-08T10:52:00Z","title":"Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.02434","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:60cc685021f880c2f48b7339fa668759e636c3b3fde5af2aa724ff96bad5d53a","target":"record","created_at":"2026-05-18T01:55:51Z","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":"01ca7eedcfc7946ca9dd2b2c968b2395103451546ed1e72c8564988e98cecf11","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2015-06-08T10:52:00Z","title_canon_sha256":"68b44fcaed6c4b7fcbd0353bae319ef2e5fbe9be32829fef0b6f4df5227a2741"},"schema_version":"1.0","source":{"id":"1506.02434","kind":"arxiv","version":1}},"canonical_sha256":"2695b16148c929738b5626710e3ed728bef1c1e5ed34224427ff1f195d63c0ec","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2695b16148c929738b5626710e3ed728bef1c1e5ed34224427ff1f195d63c0ec","first_computed_at":"2026-05-18T01:55:51.112051Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:55:51.112051Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NcdyqofZn6EZ8zqOtrwGr9+R064FJVEbRNh/XX5Cle0gEmJTyfhTxiF62Wqj6G09DeTi1eOIigpWXeyomC52DQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:55:51.112797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.02434","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60cc685021f880c2f48b7339fa668759e636c3b3fde5af2aa724ff96bad5d53a","sha256:e3a6ce462d5976f0278fdf68ddadc359c48ac8a8947b3abf3b4b2b21467d4f7e"],"state_sha256":"d21a63e158f0c0290a2cd986a1901ef965600eefc60d80bf993be1d84b950ca3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BbMa0QxqMDpPco+NQwoL0gLxH7mX0b0ButNdMTG/JdNTdBcw1EBthEuM+iwL2vMM9IBxrEQWOON9w0aT3jKcBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T19:26:50.972013Z","bundle_sha256":"acdde95a78cd67cb5068cb9d5911e6bedc455d13e470dafc9d74dab056b7a64d"}}