{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:JDSEE7F6HFTJUIFWLTSYE2BSO2","short_pith_number":"pith:JDSEE7F6","canonical_record":{"source":{"id":"1711.10637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-29T01:24:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"df0bd2f4b0d55ee6f9ce7db58cbb6a48d935e28751f4bc616fa7584bc319501f","abstract_canon_sha256":"518f295d8b9624d25a50dbd54b526a7e9dd56d4cbbab7489f80f8f6e6ed4a379"},"schema_version":"1.0"},"canonical_sha256":"48e4427cbe39669a20b65ce58268327696f0f59bf01dc02ee2d1b6c6fde2fcd6","source":{"kind":"arxiv","id":"1711.10637","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10637","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10637v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10637","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"JDSEE7F6HFTJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JDSEE7F6HFTJUIFW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JDSEE7F6","created_at":"2026-05-18T12:31:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:JDSEE7F6HFTJUIFWLTSYE2BSO2","target":"record","payload":{"canonical_record":{"source":{"id":"1711.10637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-29T01:24:15Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"df0bd2f4b0d55ee6f9ce7db58cbb6a48d935e28751f4bc616fa7584bc319501f","abstract_canon_sha256":"518f295d8b9624d25a50dbd54b526a7e9dd56d4cbbab7489f80f8f6e6ed4a379"},"schema_version":"1.0"},"canonical_sha256":"48e4427cbe39669a20b65ce58268327696f0f59bf01dc02ee2d1b6c6fde2fcd6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:29:17.474029Z","signature_b64":"WR3T/ZhDQZIsgI+TpUTnQIlCFMPTHcSpmBAp/tKYFY00XnSLY1WrSjUZnQe0N4dogJXOve0HMKkMRNF08tmkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"48e4427cbe39669a20b65ce58268327696f0f59bf01dc02ee2d1b6c6fde2fcd6","last_reissued_at":"2026-05-18T00:29:17.473362Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:29:17.473362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1711.10637","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-18T00:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3VrIslZQ1T4zBp52V1/SymjT23lMLp5RNuiYCWhiMgTgrgeH2H72MKW2iAeJs0DBuRuhjbWmj7QaO1XTTnfXCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:22:59.876922Z"},"content_sha256":"af3da086642dab37045b5bf9b83b8801a4bcef1583089e12944f5fc0c7fd956e","schema_version":"1.0","event_id":"sha256:af3da086642dab37045b5bf9b83b8801a4bcef1583089e12944f5fc0c7fd956e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:JDSEE7F6HFTJUIFWLTSYE2BSO2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Symbolic vs. Bounded Synthesis for Petri Games","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"(2) University of Oldenburg), Bernd Finkbeiner (1), Ernst-R\\\"udiger Olderog (2) ((1) Saarland University, Jesko Hecking-Harbusch (1), Manuel Gieseking (2)","submitted_at":"2017-11-29T01:24:15Z","abstract_excerpt":"Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction to a two-player game over a finite graph, which in turn is solved by a fixed point iteration based on binary decision diagrams (BDDs). The bounded synthesis approach encodes the existence of a winning strategy, up to a given bound on the size of the strategy, as a quantified Boolean formula (QBF). In this paper, we report on initial experience with"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10637","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-18T00:29:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OZlenRgsXOlzXJNLvq/BE7M05EvRVo+FbHwixGR7ERFVpv4FDdKHsM44y/PMx5CV2+1k64N8R5lH7AmUVlv1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T01:22:59.877411Z"},"content_sha256":"4db2bb476509790979b46a10aed304237636b7404f485e40858e8a1b7082d1c0","schema_version":"1.0","event_id":"sha256:4db2bb476509790979b46a10aed304237636b7404f485e40858e8a1b7082d1c0"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JDSEE7F6HFTJUIFWLTSYE2BSO2/bundle.json","state_url":"https://pith.science/pith/JDSEE7F6HFTJUIFWLTSYE2BSO2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JDSEE7F6HFTJUIFWLTSYE2BSO2/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-01T01:22:59Z","links":{"resolver":"https://pith.science/pith/JDSEE7F6HFTJUIFWLTSYE2BSO2","bundle":"https://pith.science/pith/JDSEE7F6HFTJUIFWLTSYE2BSO2/bundle.json","state":"https://pith.science/pith/JDSEE7F6HFTJUIFWLTSYE2BSO2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JDSEE7F6HFTJUIFWLTSYE2BSO2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:JDSEE7F6HFTJUIFWLTSYE2BSO2","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":"518f295d8b9624d25a50dbd54b526a7e9dd56d4cbbab7489f80f8f6e6ed4a379","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-29T01:24:15Z","title_canon_sha256":"df0bd2f4b0d55ee6f9ce7db58cbb6a48d935e28751f4bc616fa7584bc319501f"},"schema_version":"1.0","source":{"id":"1711.10637","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1711.10637","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"arxiv_version","alias_value":"1711.10637v1","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.10637","created_at":"2026-05-18T00:29:17Z"},{"alias_kind":"pith_short_12","alias_value":"JDSEE7F6HFTJ","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_16","alias_value":"JDSEE7F6HFTJUIFW","created_at":"2026-05-18T12:31:24Z"},{"alias_kind":"pith_short_8","alias_value":"JDSEE7F6","created_at":"2026-05-18T12:31:24Z"}],"graph_snapshots":[{"event_id":"sha256:4db2bb476509790979b46a10aed304237636b7404f485e40858e8a1b7082d1c0","target":"graph","created_at":"2026-05-18T00:29: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":"Petri games are a multiplayer game model for the automatic synthesis of distributed systems. We compare two fundamentally different approaches for solving Petri games. The symbolic approach decides the existence of a winning strategy via a reduction to a two-player game over a finite graph, which in turn is solved by a fixed point iteration based on binary decision diagrams (BDDs). The bounded synthesis approach encodes the existence of a winning strategy, up to a given bound on the size of the strategy, as a quantified Boolean formula (QBF). In this paper, we report on initial experience with","authors_text":"(2) University of Oldenburg), Bernd Finkbeiner (1), Ernst-R\\\"udiger Olderog (2) ((1) Saarland University, Jesko Hecking-Harbusch (1), Manuel Gieseking (2)","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-29T01:24:15Z","title":"Symbolic vs. Bounded Synthesis for Petri Games"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.10637","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:af3da086642dab37045b5bf9b83b8801a4bcef1583089e12944f5fc0c7fd956e","target":"record","created_at":"2026-05-18T00:29: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":"518f295d8b9624d25a50dbd54b526a7e9dd56d4cbbab7489f80f8f6e6ed4a379","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2017-11-29T01:24:15Z","title_canon_sha256":"df0bd2f4b0d55ee6f9ce7db58cbb6a48d935e28751f4bc616fa7584bc319501f"},"schema_version":"1.0","source":{"id":"1711.10637","kind":"arxiv","version":1}},"canonical_sha256":"48e4427cbe39669a20b65ce58268327696f0f59bf01dc02ee2d1b6c6fde2fcd6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"48e4427cbe39669a20b65ce58268327696f0f59bf01dc02ee2d1b6c6fde2fcd6","first_computed_at":"2026-05-18T00:29:17.473362Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:29:17.473362Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"WR3T/ZhDQZIsgI+TpUTnQIlCFMPTHcSpmBAp/tKYFY00XnSLY1WrSjUZnQe0N4dogJXOve0HMKkMRNF08tmkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:29:17.474029Z","signed_message":"canonical_sha256_bytes"},"source_id":"1711.10637","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af3da086642dab37045b5bf9b83b8801a4bcef1583089e12944f5fc0c7fd956e","sha256:4db2bb476509790979b46a10aed304237636b7404f485e40858e8a1b7082d1c0"],"state_sha256":"888cc326e30c553798eb684c290b4fd326854b79c9cb04e83899f7724e9d8191"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mXqZnbwel/ZNJMblTXybqvNHGJeYfnvc9AqLHxntu5bshKnL/QW+1e9Heq4AN+E5YjXv2VgBQ5AEK2dw/yEFDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T01:22:59.879805Z","bundle_sha256":"b0e736c38db6afac0a617e5a0a69f444b807cb0c878b9a602211ef231e66ab27"}}