{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:C63VJ6IWHROAEXZSLVXOHSFHJU","short_pith_number":"pith:C63VJ6IW","canonical_record":{"source":{"id":"1204.0077","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-31T06:04:02Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"5cbd48c18f976ec0bba8c48fb1f0d33350fc6ec12e14215b1765038550d5af37","abstract_canon_sha256":"c0c07fa6ca222755a6274ffc39b0145b36a512d47ace5192bfb2b2c8c3c233dd"},"schema_version":"1.0"},"canonical_sha256":"17b754f9163c5c025f325d6ee3c8a74d09f287ca702bd7b9bfb2572567bc855c","source":{"kind":"arxiv","id":"1204.0077","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0077","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0077v3","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0077","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"C63VJ6IWHROA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C63VJ6IWHROAEXZS","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C63VJ6IW","created_at":"2026-05-18T12:27:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:C63VJ6IWHROAEXZSLVXOHSFHJU","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0077","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-31T06:04:02Z","cross_cats_sorted":["cs.SY"],"title_canon_sha256":"5cbd48c18f976ec0bba8c48fb1f0d33350fc6ec12e14215b1765038550d5af37","abstract_canon_sha256":"c0c07fa6ca222755a6274ffc39b0145b36a512d47ace5192bfb2b2c8c3c233dd"},"schema_version":"1.0"},"canonical_sha256":"17b754f9163c5c025f325d6ee3c8a74d09f287ca702bd7b9bfb2572567bc855c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:33:37.869643Z","signature_b64":"NejUvk+gECjugxSFbaKN5/U/ZZrlEMiDSA5gQwelYxJp9TtE6Qvkv1CouINaWQg/N1VSHtz8jGCRQdD7ect0Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"17b754f9163c5c025f325d6ee3c8a74d09f287ca702bd7b9bfb2572567bc855c","last_reissued_at":"2026-05-18T03:33:37.868927Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:33:37.868927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0077","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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nzTGumxLJQHypGtVqWXYYfUjQPkRg69Hxi3eMrWHldTWuSHWc3Hh7VGaeq/BaZrv3Df2FxBFe9rQSkH+l5MUAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:13:49.586562Z"},"content_sha256":"6fcc16c4be1166edec7fed2ab45c83361177a021ce1125b3081392b42ccbc4a3","schema_version":"1.0","event_id":"sha256:6fcc16c4be1166edec7fed2ab45c83361177a021ce1125b3081392b42ccbc4a3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:C63VJ6IWHROAEXZSLVXOHSFHJU","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asynchronous Games over Tree Architectures","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY"],"primary_cat":"cs.FL","authors_text":"Anca Muscholl (LaBRI), Blaise Genest (INRIA - Irisa), Hugo Gimbert (LaBRI), Igor Walukiewicz (LaBRI)","submitted_at":"2012-03-31T06:04:02Z","abstract_excerpt":"We consider the task of controlling in a distributed way a Zielonka asynchronous automaton. Every process of a controller has access to its causal past to determine the next set of actions it proposes to play. An action can be played only if every process controlling this action proposes to play it. We consider reachability objectives: every process should reach its set of final states. We show that this control problem is decidable for tree architectures, where every process can communicate with its parent, its children, and with the environment. The complexity of our algorithm is l-fold expo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0077","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:33:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5Ezsm5OnLgXeJl/aIXyt3ptgN6ty18eSZIGOl0s1MWDqp72Qou3hVM6H/glAvRMzSGv7hvIjQlEa1QJ2hh5vCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T04:13:49.587206Z"},"content_sha256":"78c370227fdf1b55eadb7733a1bc63c31d6d0ee3f8b34d13513bde9984db98f2","schema_version":"1.0","event_id":"sha256:78c370227fdf1b55eadb7733a1bc63c31d6d0ee3f8b34d13513bde9984db98f2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/C63VJ6IWHROAEXZSLVXOHSFHJU/bundle.json","state_url":"https://pith.science/pith/C63VJ6IWHROAEXZSLVXOHSFHJU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/C63VJ6IWHROAEXZSLVXOHSFHJU/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-31T04:13:49Z","links":{"resolver":"https://pith.science/pith/C63VJ6IWHROAEXZSLVXOHSFHJU","bundle":"https://pith.science/pith/C63VJ6IWHROAEXZSLVXOHSFHJU/bundle.json","state":"https://pith.science/pith/C63VJ6IWHROAEXZSLVXOHSFHJU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/C63VJ6IWHROAEXZSLVXOHSFHJU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:C63VJ6IWHROAEXZSLVXOHSFHJU","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":"c0c07fa6ca222755a6274ffc39b0145b36a512d47ace5192bfb2b2c8c3c233dd","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-31T06:04:02Z","title_canon_sha256":"5cbd48c18f976ec0bba8c48fb1f0d33350fc6ec12e14215b1765038550d5af37"},"schema_version":"1.0","source":{"id":"1204.0077","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0077","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0077v3","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0077","created_at":"2026-05-18T03:33:37Z"},{"alias_kind":"pith_short_12","alias_value":"C63VJ6IWHROA","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_16","alias_value":"C63VJ6IWHROAEXZS","created_at":"2026-05-18T12:27:01Z"},{"alias_kind":"pith_short_8","alias_value":"C63VJ6IW","created_at":"2026-05-18T12:27:01Z"}],"graph_snapshots":[{"event_id":"sha256:78c370227fdf1b55eadb7733a1bc63c31d6d0ee3f8b34d13513bde9984db98f2","target":"graph","created_at":"2026-05-18T03:33:37Z","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 the task of controlling in a distributed way a Zielonka asynchronous automaton. Every process of a controller has access to its causal past to determine the next set of actions it proposes to play. An action can be played only if every process controlling this action proposes to play it. We consider reachability objectives: every process should reach its set of final states. We show that this control problem is decidable for tree architectures, where every process can communicate with its parent, its children, and with the environment. The complexity of our algorithm is l-fold expo","authors_text":"Anca Muscholl (LaBRI), Blaise Genest (INRIA - Irisa), Hugo Gimbert (LaBRI), Igor Walukiewicz (LaBRI)","cross_cats":["cs.SY"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-31T06:04:02Z","title":"Asynchronous Games over Tree Architectures"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0077","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:6fcc16c4be1166edec7fed2ab45c83361177a021ce1125b3081392b42ccbc4a3","target":"record","created_at":"2026-05-18T03:33:37Z","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":"c0c07fa6ca222755a6274ffc39b0145b36a512d47ace5192bfb2b2c8c3c233dd","cross_cats_sorted":["cs.SY"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.FL","submitted_at":"2012-03-31T06:04:02Z","title_canon_sha256":"5cbd48c18f976ec0bba8c48fb1f0d33350fc6ec12e14215b1765038550d5af37"},"schema_version":"1.0","source":{"id":"1204.0077","kind":"arxiv","version":3}},"canonical_sha256":"17b754f9163c5c025f325d6ee3c8a74d09f287ca702bd7b9bfb2572567bc855c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"17b754f9163c5c025f325d6ee3c8a74d09f287ca702bd7b9bfb2572567bc855c","first_computed_at":"2026-05-18T03:33:37.868927Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:33:37.868927Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NejUvk+gECjugxSFbaKN5/U/ZZrlEMiDSA5gQwelYxJp9TtE6Qvkv1CouINaWQg/N1VSHtz8jGCRQdD7ect0Bg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:33:37.869643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0077","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6fcc16c4be1166edec7fed2ab45c83361177a021ce1125b3081392b42ccbc4a3","sha256:78c370227fdf1b55eadb7733a1bc63c31d6d0ee3f8b34d13513bde9984db98f2"],"state_sha256":"5e3a58b6cbae1e3cd9ce9cfbcf1e35135d9cf8c39745895c1770325c28316ff7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BwnCdnD2gAf8bjX9bEbeF1b64dkCw7XJeVWG9leNxq5bXzn2baNBrA0wnmWw5hF0JvHY8XU+tXZ1Rt/11+loBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T04:13:49.591034Z","bundle_sha256":"5ff3d9865212724bf104fe92decb3ce318d3ec2f170686095c57999b7f3f80f1"}}