{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:C5IXCCJFWJNCYBRXYHPT222SXD","short_pith_number":"pith:C5IXCCJF","canonical_record":{"source":{"id":"1802.00758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"5ee12a0e24965d37bcd6381ee070c94404c2c0750fe8dd4ac772100d6b60f1ba","abstract_canon_sha256":"5d5d7831192b1f4b031e9622c83b48165dff39d68847146acbc79a718b2c4374"},"schema_version":"1.0"},"canonical_sha256":"1751710925b25a2c0637c1df3d6b52b8ec970418978e8373289b0939712f0316","source":{"kind":"arxiv","id":"1802.00758","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00758","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00758v2","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00758","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"C5IXCCJFWJNC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5IXCCJFWJNCYBRX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5IXCCJF","created_at":"2026-05-18T12:32:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:C5IXCCJFWJNCYBRXYHPT222SXD","target":"record","payload":{"canonical_record":{"source":{"id":"1802.00758","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:29:18Z","cross_cats_sorted":[],"title_canon_sha256":"5ee12a0e24965d37bcd6381ee070c94404c2c0750fe8dd4ac772100d6b60f1ba","abstract_canon_sha256":"5d5d7831192b1f4b031e9622c83b48165dff39d68847146acbc79a718b2c4374"},"schema_version":"1.0"},"canonical_sha256":"1751710925b25a2c0637c1df3d6b52b8ec970418978e8373289b0939712f0316","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:20:44.093244Z","signature_b64":"nNyk3toY5DF26r2BYnpc/KO9FBHPTaZlqptAurYajeb0UJqmedrpviKvseZ7WZu23AizKa7MtFWCn3MC5hUZAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1751710925b25a2c0637c1df3d6b52b8ec970418978e8373289b0939712f0316","last_reissued_at":"2026-05-18T00:20:44.092542Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:20:44.092542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.00758","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-18T00:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"scCBmj67QrRmvvnhBWWkJ9rcJUEf1x2i7Yv6oQPBVvzHFDSFlYlBMa+CTSLDfUaf+DbMBb4UmflatELO575hDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:14:50.790474Z"},"content_sha256":"c5dfae011de0d5e33b974135f7ed46332dd2b1774a8285c1315326b24018f1a9","schema_version":"1.0","event_id":"sha256:c5dfae011de0d5e33b974135f7ed46332dd2b1774a8285c1315326b24018f1a9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:C5IXCCJFWJNCYBRXYHPT222SXD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Strategy Representation by Decision Trees in Reactive Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Jan K\\v{r}et\\'insk\\'y, Krishnendu Chatterjee, Tom\\'a\\v{s} Br\\'azdil, Viktor Toman","submitted_at":"2018-02-02T16:29:18Z","abstract_excerpt":"Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with $\\omega$-regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy repres"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00758","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-18T00:20:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AmlT44YAjXR4QcwHG43qOZes9J5bLwOdhSyN0jC+IxTTsWi6an6bq3kEt45/wlsJpMu4+oWhpqVGqLImEYjFAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T05:14:50.791106Z"},"content_sha256":"812a0ad78c33d2a8840baa27d2d17b8d48d3a48a371e072b715dd8b7ce3dff3b","schema_version":"1.0","event_id":"sha256:812a0ad78c33d2a8840baa27d2d17b8d48d3a48a371e072b715dd8b7ce3dff3b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C5IXCCJFWJNCYBRXYHPT222SXD/bundle.json","state_url":"https://pith.science/pith/C5IXCCJFWJNCYBRXYHPT222SXD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C5IXCCJFWJNCYBRXYHPT222SXD/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-26T05:14:50Z","links":{"resolver":"https://pith.science/pith/C5IXCCJFWJNCYBRXYHPT222SXD","bundle":"https://pith.science/pith/C5IXCCJFWJNCYBRXYHPT222SXD/bundle.json","state":"https://pith.science/pith/C5IXCCJFWJNCYBRXYHPT222SXD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C5IXCCJFWJNCYBRXYHPT222SXD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:C5IXCCJFWJNCYBRXYHPT222SXD","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":"5d5d7831192b1f4b031e9622c83b48165dff39d68847146acbc79a718b2c4374","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:29:18Z","title_canon_sha256":"5ee12a0e24965d37bcd6381ee070c94404c2c0750fe8dd4ac772100d6b60f1ba"},"schema_version":"1.0","source":{"id":"1802.00758","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.00758","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"arxiv_version","alias_value":"1802.00758v2","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.00758","created_at":"2026-05-18T00:20:44Z"},{"alias_kind":"pith_short_12","alias_value":"C5IXCCJFWJNC","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_16","alias_value":"C5IXCCJFWJNCYBRX","created_at":"2026-05-18T12:32:16Z"},{"alias_kind":"pith_short_8","alias_value":"C5IXCCJF","created_at":"2026-05-18T12:32:16Z"}],"graph_snapshots":[{"event_id":"sha256:812a0ad78c33d2a8840baa27d2d17b8d48d3a48a371e072b715dd8b7ce3dff3b","target":"graph","created_at":"2026-05-18T00:20:44Z","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":"Graph games played by two players over finite-state graphs are central in many problems in computer science. In particular, graph games with $\\omega$-regular winning conditions, specified as parity objectives, which can express properties such as safety, liveness, fairness, are the basic framework for verification and synthesis of reactive systems. The decisions for a player at various states of the graph game are represented as strategies. While the algorithmic problem for solving graph games with parity objectives has been widely studied, the most prominent data-structure for strategy repres","authors_text":"Jan K\\v{r}et\\'insk\\'y, Krishnendu Chatterjee, Tom\\'a\\v{s} Br\\'azdil, Viktor Toman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:29:18Z","title":"Strategy Representation by Decision Trees in Reactive Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.00758","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:c5dfae011de0d5e33b974135f7ed46332dd2b1774a8285c1315326b24018f1a9","target":"record","created_at":"2026-05-18T00:20:44Z","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":"5d5d7831192b1f4b031e9622c83b48165dff39d68847146acbc79a718b2c4374","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-02-02T16:29:18Z","title_canon_sha256":"5ee12a0e24965d37bcd6381ee070c94404c2c0750fe8dd4ac772100d6b60f1ba"},"schema_version":"1.0","source":{"id":"1802.00758","kind":"arxiv","version":2}},"canonical_sha256":"1751710925b25a2c0637c1df3d6b52b8ec970418978e8373289b0939712f0316","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1751710925b25a2c0637c1df3d6b52b8ec970418978e8373289b0939712f0316","first_computed_at":"2026-05-18T00:20:44.092542Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:20:44.092542Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nNyk3toY5DF26r2BYnpc/KO9FBHPTaZlqptAurYajeb0UJqmedrpviKvseZ7WZu23AizKa7MtFWCn3MC5hUZAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:20:44.093244Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.00758","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5dfae011de0d5e33b974135f7ed46332dd2b1774a8285c1315326b24018f1a9","sha256:812a0ad78c33d2a8840baa27d2d17b8d48d3a48a371e072b715dd8b7ce3dff3b"],"state_sha256":"8e97fcec5f655b1673b28bec9fc1100a3d3877189b833a48b3810c1e63f590c7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h9Qoo/nlvoLFv7daag6bgBV1ZAf8xpNsbKPu5N36STiMYoL9J8yoQ1oXJlxgSf+bOA1LtXqtCNiJZf/47BmgDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T05:14:50.794716Z","bundle_sha256":"5a8d0c330ba83837289188ed8544b4034682e58a0a1d96b33de54112ab7a7298"}}