{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:LHE7OWR64JYXXLNYL76MII5M5Y","short_pith_number":"pith:LHE7OWR6","canonical_record":{"source":{"id":"1010.2420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-12T15:27:15Z","cross_cats_sorted":["cs.GT","cs.LO"],"title_canon_sha256":"ae9fbbc991b3e70a05722320baa9b4a61933ac3a1236d846f346ac7151089721","abstract_canon_sha256":"6cd65bafff6f2de3aac56f8647a75e976577b6a85d2cb72a080e3e7dea9bac22"},"schema_version":"1.0"},"canonical_sha256":"59c9f75a3ee2717badb85ffcc423acee2f81c937b34415974abe36f1969d6fd3","source":{"kind":"arxiv","id":"1010.2420","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2420","created_at":"2026-05-18T04:03:17Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2420v2","created_at":"2026-05-18T04:03:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2420","created_at":"2026-05-18T04:03:17Z"},{"alias_kind":"pith_short_12","alias_value":"LHE7OWR64JYX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LHE7OWR64JYXXLNY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LHE7OWR6","created_at":"2026-05-18T12:26:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:LHE7OWR64JYXXLNYL76MII5M5Y","target":"record","payload":{"canonical_record":{"source":{"id":"1010.2420","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-12T15:27:15Z","cross_cats_sorted":["cs.GT","cs.LO"],"title_canon_sha256":"ae9fbbc991b3e70a05722320baa9b4a61933ac3a1236d846f346ac7151089721","abstract_canon_sha256":"6cd65bafff6f2de3aac56f8647a75e976577b6a85d2cb72a080e3e7dea9bac22"},"schema_version":"1.0"},"canonical_sha256":"59c9f75a3ee2717badb85ffcc423acee2f81c937b34415974abe36f1969d6fd3","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:17.708575Z","signature_b64":"GcYmPrKbsa5ofJEtQvSPbVqmoF+2LvKZ05zxKTmQ1tOEpxYg1gZr7y/JNZlF3ud9yyUkA0Vk10G05VOg/witCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59c9f75a3ee2717badb85ffcc423acee2f81c937b34415974abe36f1969d6fd3","last_reissued_at":"2026-05-18T04:03:17.707915Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:17.707915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1010.2420","source_version":2,"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-18T04:03:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AlktERfOI/cX87JjvuL54KhjmFOESGugvnQhsVyLjH19p/6Vhkab8e9woZkYF15ws2CWq4q8emLi8oFZret5Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:42:52.773218Z"},"content_sha256":"8710e98f595efd0e41e05ea1033de878303a83317b0a068c5e62e7db63343772","schema_version":"1.0","event_id":"sha256:8710e98f595efd0e41e05ea1033de878303a83317b0a068c5e62e7db63343772"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:LHE7OWR64JYXXLNYL76MII5M5Y","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The surprizing complexity of generalized reachability games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT","cs.LO"],"primary_cat":"cs.CC","authors_text":"Florian Horn (LIAFA), Nathana\\\"el Fijalkow (LIAFA)","submitted_at":"2010-10-12T15:27:15Z","abstract_excerpt":"Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such games is $\\PSPACE$-complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter. Moreover, we consider the memory requirements for both players and give matching upper and lower bounds on the size of winning strategies. In order to allow more efficient algorithms, we consider subclasses of generalized reachability"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2420","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"},"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-18T04:03:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"o6JbFxg2obM07eZtVWGNR9h+zb4LDwOK/Iic2LS0ju8LhXOHZzbbCJZECR9mEwh/IIIBXxL/84xsIUN2zioyBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:42:52.773640Z"},"content_sha256":"a3103718a02d48d86476ec1fc28a4e8f2709ea6cf315ab7fac14443128822ab4","schema_version":"1.0","event_id":"sha256:a3103718a02d48d86476ec1fc28a4e8f2709ea6cf315ab7fac14443128822ab4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHE7OWR64JYXXLNYL76MII5M5Y/bundle.json","state_url":"https://pith.science/pith/LHE7OWR64JYXXLNYL76MII5M5Y/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHE7OWR64JYXXLNYL76MII5M5Y/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-06-01T08:42:52Z","links":{"resolver":"https://pith.science/pith/LHE7OWR64JYXXLNYL76MII5M5Y","bundle":"https://pith.science/pith/LHE7OWR64JYXXLNYL76MII5M5Y/bundle.json","state":"https://pith.science/pith/LHE7OWR64JYXXLNYL76MII5M5Y/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHE7OWR64JYXXLNYL76MII5M5Y/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:LHE7OWR64JYXXLNYL76MII5M5Y","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":"6cd65bafff6f2de3aac56f8647a75e976577b6a85d2cb72a080e3e7dea9bac22","cross_cats_sorted":["cs.GT","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-12T15:27:15Z","title_canon_sha256":"ae9fbbc991b3e70a05722320baa9b4a61933ac3a1236d846f346ac7151089721"},"schema_version":"1.0","source":{"id":"1010.2420","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1010.2420","created_at":"2026-05-18T04:03:17Z"},{"alias_kind":"arxiv_version","alias_value":"1010.2420v2","created_at":"2026-05-18T04:03:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1010.2420","created_at":"2026-05-18T04:03:17Z"},{"alias_kind":"pith_short_12","alias_value":"LHE7OWR64JYX","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_16","alias_value":"LHE7OWR64JYXXLNY","created_at":"2026-05-18T12:26:10Z"},{"alias_kind":"pith_short_8","alias_value":"LHE7OWR6","created_at":"2026-05-18T12:26:10Z"}],"graph_snapshots":[{"event_id":"sha256:a3103718a02d48d86476ec1fc28a4e8f2709ea6cf315ab7fac14443128822ab4","target":"graph","created_at":"2026-05-18T04:03:17Z","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":"Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such games is $\\PSPACE$-complete, although it is fixed-parameter tractable with the number of reachability objectives as parameter. Moreover, we consider the memory requirements for both players and give matching upper and lower bounds on the size of winning strategies. In order to allow more efficient algorithms, we consider subclasses of generalized reachability","authors_text":"Florian Horn (LIAFA), Nathana\\\"el Fijalkow (LIAFA)","cross_cats":["cs.GT","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-12T15:27:15Z","title":"The surprizing complexity of generalized reachability games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1010.2420","kind":"arxiv","version":2},"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:8710e98f595efd0e41e05ea1033de878303a83317b0a068c5e62e7db63343772","target":"record","created_at":"2026-05-18T04:03:17Z","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":"6cd65bafff6f2de3aac56f8647a75e976577b6a85d2cb72a080e3e7dea9bac22","cross_cats_sorted":["cs.GT","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2010-10-12T15:27:15Z","title_canon_sha256":"ae9fbbc991b3e70a05722320baa9b4a61933ac3a1236d846f346ac7151089721"},"schema_version":"1.0","source":{"id":"1010.2420","kind":"arxiv","version":2}},"canonical_sha256":"59c9f75a3ee2717badb85ffcc423acee2f81c937b34415974abe36f1969d6fd3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59c9f75a3ee2717badb85ffcc423acee2f81c937b34415974abe36f1969d6fd3","first_computed_at":"2026-05-18T04:03:17.707915Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:17.707915Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GcYmPrKbsa5ofJEtQvSPbVqmoF+2LvKZ05zxKTmQ1tOEpxYg1gZr7y/JNZlF3ud9yyUkA0Vk10G05VOg/witCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:17.708575Z","signed_message":"canonical_sha256_bytes"},"source_id":"1010.2420","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8710e98f595efd0e41e05ea1033de878303a83317b0a068c5e62e7db63343772","sha256:a3103718a02d48d86476ec1fc28a4e8f2709ea6cf315ab7fac14443128822ab4"],"state_sha256":"77c56ec035dc0afbac75b05fb4f890f317b3955ded71f1d78c697ef33a800d70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f/VpiGs0Dk+bndhI2eHT1lnuvkMdQ3QcQA68e7ikTQT8ita18kAzQod/ZC4DY2dnyQNK6IXp52qB/ebvinMTAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:42:52.775643Z","bundle_sha256":"952fdd080659d990d2cabaaa0a575221994dc1239ba6aaa18e4fa388ceff1d45"}}