{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:BWO3BUCEHKORLSYHAADDOOWJXH","short_pith_number":"pith:BWO3BUCE","canonical_record":{"source":{"id":"1204.3283","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-04-15T16:08:44Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"5e455a282c90f985f9f21d62dcfc1fa4ccc1d7e21d92363d2c505658193cc089","abstract_canon_sha256":"ee93797d9908b7ddc0c22dd70854cc8819d6f2b49a01580814cbc0f0124cc052"},"schema_version":"1.0"},"canonical_sha256":"0d9db0d0443a9d15cb070006373ac9b9c2f1cb54d9862bfb94cec88ba146663c","source":{"kind":"arxiv","id":"1204.3283","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3283","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3283v3","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3283","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"BWO3BUCEHKOR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWO3BUCEHKORLSYH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWO3BUCE","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:BWO3BUCEHKORLSYHAADDOOWJXH","target":"record","payload":{"canonical_record":{"source":{"id":"1204.3283","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-04-15T16:08:44Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"5e455a282c90f985f9f21d62dcfc1fa4ccc1d7e21d92363d2c505658193cc089","abstract_canon_sha256":"ee93797d9908b7ddc0c22dd70854cc8819d6f2b49a01580814cbc0f0124cc052"},"schema_version":"1.0"},"canonical_sha256":"0d9db0d0443a9d15cb070006373ac9b9c2f1cb54d9862bfb94cec88ba146663c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:55.836569Z","signature_b64":"OVxemcyiKF39U0TtxAyhuWpxozY/J0NBbjToj15r1b01cgVnBLzHFZROpp8sADP1cCxB6FhaQ9G+w7DtgSxWDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0d9db0d0443a9d15cb070006373ac9b9c2f1cb54d9862bfb94cec88ba146663c","last_reissued_at":"2026-05-18T03:42:55.835953Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:55.835953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.3283","source_version":3,"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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hyo3PkBwXUXpRYcFkF6VT8pdcS73H6iSIgb0VGMTW70WGcaH4al+CGVpIaatiF8EO97nToXl+PG/VbjHuudEDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:12:27.508485Z"},"content_sha256":"16ebcc415c4a99d17d14f6fe794c793fb3ccbdcd2e8c5031d7524c4408fd2809","schema_version":"1.0","event_id":"sha256:16ebcc415c4a99d17d14f6fe794c793fb3ccbdcd2e8c5031d7524c4408fd2809"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:BWO3BUCEHKORLSYHAADDOOWJXH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Automated synthesis of reliable and efficient systems through game theory: a case study","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.GT","authors_text":"Mickael Randour","submitted_at":"2012-04-15T16:08:44Z","abstract_excerpt":"Reactive computer systems bear inherent complexity due to continuous interactions with their environment. While this environment often proves to be uncontrollable, we still want to ensure that critical computer systems will not fail, no matter what they face. Examples are legion: railway traffic, power plants, plane navigation systems, etc. Formal verification of a system may ensure that it satisfies a given specification, but only applies to an already existing model of a system. In this work, we address the problem of synthesis: starting from a specification of the desired behavior, we show "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3283","kind":"arxiv","version":3},"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-18T03:42:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"znGIiFJP8tLBvA1qrg64xJLLUL2iQ9HFQk0Ar4hZrH+Ov+XiURgxv66NpUIFcyXfQr4MXXJ003BmI3o92seEAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-04T18:12:27.508834Z"},"content_sha256":"b66018e3cedc7286d235f96b54f45f0b918111857d886d678badef6b5db77409","schema_version":"1.0","event_id":"sha256:b66018e3cedc7286d235f96b54f45f0b918111857d886d678badef6b5db77409"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BWO3BUCEHKORLSYHAADDOOWJXH/bundle.json","state_url":"https://pith.science/pith/BWO3BUCEHKORLSYHAADDOOWJXH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BWO3BUCEHKORLSYHAADDOOWJXH/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-07-04T18:12:27Z","links":{"resolver":"https://pith.science/pith/BWO3BUCEHKORLSYHAADDOOWJXH","bundle":"https://pith.science/pith/BWO3BUCEHKORLSYHAADDOOWJXH/bundle.json","state":"https://pith.science/pith/BWO3BUCEHKORLSYHAADDOOWJXH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BWO3BUCEHKORLSYHAADDOOWJXH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:BWO3BUCEHKORLSYHAADDOOWJXH","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":"ee93797d9908b7ddc0c22dd70854cc8819d6f2b49a01580814cbc0f0124cc052","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-04-15T16:08:44Z","title_canon_sha256":"5e455a282c90f985f9f21d62dcfc1fa4ccc1d7e21d92363d2c505658193cc089"},"schema_version":"1.0","source":{"id":"1204.3283","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.3283","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"arxiv_version","alias_value":"1204.3283v3","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3283","created_at":"2026-05-18T03:42:55Z"},{"alias_kind":"pith_short_12","alias_value":"BWO3BUCEHKOR","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"BWO3BUCEHKORLSYH","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"BWO3BUCE","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:b66018e3cedc7286d235f96b54f45f0b918111857d886d678badef6b5db77409","target":"graph","created_at":"2026-05-18T03:42:55Z","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":"Reactive computer systems bear inherent complexity due to continuous interactions with their environment. While this environment often proves to be uncontrollable, we still want to ensure that critical computer systems will not fail, no matter what they face. Examples are legion: railway traffic, power plants, plane navigation systems, etc. Formal verification of a system may ensure that it satisfies a given specification, but only applies to an already existing model of a system. In this work, we address the problem of synthesis: starting from a specification of the desired behavior, we show ","authors_text":"Mickael Randour","cross_cats":["cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-04-15T16:08:44Z","title":"Automated synthesis of reliable and efficient systems through game theory: a case study"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3283","kind":"arxiv","version":3},"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:16ebcc415c4a99d17d14f6fe794c793fb3ccbdcd2e8c5031d7524c4408fd2809","target":"record","created_at":"2026-05-18T03:42:55Z","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":"ee93797d9908b7ddc0c22dd70854cc8819d6f2b49a01580814cbc0f0124cc052","cross_cats_sorted":["cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2012-04-15T16:08:44Z","title_canon_sha256":"5e455a282c90f985f9f21d62dcfc1fa4ccc1d7e21d92363d2c505658193cc089"},"schema_version":"1.0","source":{"id":"1204.3283","kind":"arxiv","version":3}},"canonical_sha256":"0d9db0d0443a9d15cb070006373ac9b9c2f1cb54d9862bfb94cec88ba146663c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0d9db0d0443a9d15cb070006373ac9b9c2f1cb54d9862bfb94cec88ba146663c","first_computed_at":"2026-05-18T03:42:55.835953Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:42:55.835953Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OVxemcyiKF39U0TtxAyhuWpxozY/J0NBbjToj15r1b01cgVnBLzHFZROpp8sADP1cCxB6FhaQ9G+w7DtgSxWDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:42:55.836569Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.3283","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:16ebcc415c4a99d17d14f6fe794c793fb3ccbdcd2e8c5031d7524c4408fd2809","sha256:b66018e3cedc7286d235f96b54f45f0b918111857d886d678badef6b5db77409"],"state_sha256":"8ca2dc5451c0388bdee8abbf9dce6c17e1fd82640e1e4b71236791d84520332b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mqhMN74sERKUiNCiQKbY4HQSHbo/qnv78I9lViRqRlKF+Vjovf62DJtEg6XDU5n63Ndw/l0g3XmHcLEH0BouAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-04T18:12:27.510793Z","bundle_sha256":"84574c803564a35297dfbf904ea47686532d9d3daf7e12b64ea07e340a0ad1a0"}}