{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:7KRHROQ5CRDENOX43HD5KI4P4C","short_pith_number":"pith:7KRHROQ5","canonical_record":{"source":{"id":"1112.1783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-12-08T09:07:53Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e99b4ffece6b4e998252fa7bceb0b3499d09cf810f3caa525968089338013dee","abstract_canon_sha256":"16f4fab5730b43933049009d58ea97125cb14c3511052f2bafd97ba21a9a28d5"},"schema_version":"1.0"},"canonical_sha256":"faa278ba1d144646bafcd9c7d5238fe0b444476bf05d8c422b2ed9807b62fe1a","source":{"kind":"arxiv","id":"1112.1783","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1783","created_at":"2026-05-18T04:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1783v2","created_at":"2026-05-18T04:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1783","created_at":"2026-05-18T04:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"7KRHROQ5CRDE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7KRHROQ5CRDENOX4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7KRHROQ5","created_at":"2026-05-18T12:26:22Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:7KRHROQ5CRDENOX43HD5KI4P4C","target":"record","payload":{"canonical_record":{"source":{"id":"1112.1783","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-12-08T09:07:53Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"e99b4ffece6b4e998252fa7bceb0b3499d09cf810f3caa525968089338013dee","abstract_canon_sha256":"16f4fab5730b43933049009d58ea97125cb14c3511052f2bafd97ba21a9a28d5"},"schema_version":"1.0"},"canonical_sha256":"faa278ba1d144646bafcd9c7d5238fe0b444476bf05d8c422b2ed9807b62fe1a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:03:45.014641Z","signature_b64":"EeXo34RjCr2I3CLJXHUc4fw5UCiFmHwh2CXg1/XHzKfnXGQgNwYsPGExbHu+oqjKIan1T7wmkkV4TbEK/K1BBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"faa278ba1d144646bafcd9c7d5238fe0b444476bf05d8c422b2ed9807b62fe1a","last_reissued_at":"2026-05-18T04:03:45.014098Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:03:45.014098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.1783","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oO7MclP+f1lifWiBgLptMH7/sKI8V+sMnWqxcBkaSFt+LJOx/zkcDg6ZFJRtKo8dJrnsTOFhRu8cruBnJxJqAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:13:06.437886Z"},"content_sha256":"f50d9ef58866f58ec9d4a46ef2d8aaa30ff30a9a86c40597d228ff6ea19b83e4","schema_version":"1.0","event_id":"sha256:f50d9ef58866f58ec9d4a46ef2d8aaa30ff30a9a86c40597d228ff6ea19b83e4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:7KRHROQ5CRDENOX43HD5KI4P4C","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Distributed Priority Synthesis and its Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.LO","authors_text":"Alois Knoll, Chih-Hong Cheng, Christian Buckl, Harald Ruess, Rongjie Yan, Saddek Bensalem","submitted_at":"2011-12-08T09:07:53Z","abstract_excerpt":"Given a set of interacting components with non-deterministic variable update and given safety requirements, the goal of priority synthesis is to restrict, by means of priorities, the set of possible interactions in such a way as to guarantee the given safety conditions for all possible runs. In distributed priority synthesis we are interested in obtaining local sets of priorities, which are deployed in terms of local component controllers sharing intended next moves between components in local neighborhoods only. These possible communication paths between local controllers are specified by mea"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1783","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:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vGvIcHZXABYPrr1oYcdeKBpzRU1V4lEr18o0vyO47wdGumcCj1Ya73IaOcQiNKcrqDoOiflm6h9S0wjF9yM+Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T09:13:06.438556Z"},"content_sha256":"ab50f40da30af1d02f56dc22af2bfae1f4e36309013a3cdd12b1b653397a5cf2","schema_version":"1.0","event_id":"sha256:ab50f40da30af1d02f56dc22af2bfae1f4e36309013a3cdd12b1b653397a5cf2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7KRHROQ5CRDENOX43HD5KI4P4C/bundle.json","state_url":"https://pith.science/pith/7KRHROQ5CRDENOX43HD5KI4P4C/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7KRHROQ5CRDENOX43HD5KI4P4C/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-31T09:13:06Z","links":{"resolver":"https://pith.science/pith/7KRHROQ5CRDENOX43HD5KI4P4C","bundle":"https://pith.science/pith/7KRHROQ5CRDENOX43HD5KI4P4C/bundle.json","state":"https://pith.science/pith/7KRHROQ5CRDENOX43HD5KI4P4C/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7KRHROQ5CRDENOX43HD5KI4P4C/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:7KRHROQ5CRDENOX43HD5KI4P4C","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":"16f4fab5730b43933049009d58ea97125cb14c3511052f2bafd97ba21a9a28d5","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-12-08T09:07:53Z","title_canon_sha256":"e99b4ffece6b4e998252fa7bceb0b3499d09cf810f3caa525968089338013dee"},"schema_version":"1.0","source":{"id":"1112.1783","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.1783","created_at":"2026-05-18T04:03:45Z"},{"alias_kind":"arxiv_version","alias_value":"1112.1783v2","created_at":"2026-05-18T04:03:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.1783","created_at":"2026-05-18T04:03:45Z"},{"alias_kind":"pith_short_12","alias_value":"7KRHROQ5CRDE","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_16","alias_value":"7KRHROQ5CRDENOX4","created_at":"2026-05-18T12:26:22Z"},{"alias_kind":"pith_short_8","alias_value":"7KRHROQ5","created_at":"2026-05-18T12:26:22Z"}],"graph_snapshots":[{"event_id":"sha256:ab50f40da30af1d02f56dc22af2bfae1f4e36309013a3cdd12b1b653397a5cf2","target":"graph","created_at":"2026-05-18T04:03:45Z","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":"Given a set of interacting components with non-deterministic variable update and given safety requirements, the goal of priority synthesis is to restrict, by means of priorities, the set of possible interactions in such a way as to guarantee the given safety conditions for all possible runs. In distributed priority synthesis we are interested in obtaining local sets of priorities, which are deployed in terms of local component controllers sharing intended next moves between components in local neighborhoods only. These possible communication paths between local controllers are specified by mea","authors_text":"Alois Knoll, Chih-Hong Cheng, Christian Buckl, Harald Ruess, Rongjie Yan, Saddek Bensalem","cross_cats":["cs.GT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-12-08T09:07:53Z","title":"Distributed Priority Synthesis and its Applications"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.1783","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:f50d9ef58866f58ec9d4a46ef2d8aaa30ff30a9a86c40597d228ff6ea19b83e4","target":"record","created_at":"2026-05-18T04:03:45Z","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":"16f4fab5730b43933049009d58ea97125cb14c3511052f2bafd97ba21a9a28d5","cross_cats_sorted":["cs.GT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2011-12-08T09:07:53Z","title_canon_sha256":"e99b4ffece6b4e998252fa7bceb0b3499d09cf810f3caa525968089338013dee"},"schema_version":"1.0","source":{"id":"1112.1783","kind":"arxiv","version":2}},"canonical_sha256":"faa278ba1d144646bafcd9c7d5238fe0b444476bf05d8c422b2ed9807b62fe1a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"faa278ba1d144646bafcd9c7d5238fe0b444476bf05d8c422b2ed9807b62fe1a","first_computed_at":"2026-05-18T04:03:45.014098Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:03:45.014098Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EeXo34RjCr2I3CLJXHUc4fw5UCiFmHwh2CXg1/XHzKfnXGQgNwYsPGExbHu+oqjKIan1T7wmkkV4TbEK/K1BBw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:03:45.014641Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.1783","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f50d9ef58866f58ec9d4a46ef2d8aaa30ff30a9a86c40597d228ff6ea19b83e4","sha256:ab50f40da30af1d02f56dc22af2bfae1f4e36309013a3cdd12b1b653397a5cf2"],"state_sha256":"6155c6c688d651f5fe00c276698e476fb30d6413c48fc1411487a084d8ab58c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3vx0E20WkigfbPVa7Y0NDI9PobszjejyAgBaRQEq8u1J9nNSu6l4D2xeBGjB462JuK0LWaHSvX/TpvjrAcATDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T09:13:06.442032Z","bundle_sha256":"7c63d4f918cca1f33894d54afe325c97f6a0060246408c892ecdcd7715ce0769"}}