{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:7LDJVGSNU2V7CLTXFCQPJXFZHP","short_pith_number":"pith:7LDJVGSN","schema_version":"1.0","canonical_sha256":"fac69a9a4da6abf12e7728a0f4dcb93bdb03fd19b77a5bb8820070cb674c65ac","source":{"kind":"arxiv","id":"1604.07564","version":1},"attestation_state":"computed","paper":{"title":"A Retraction Theorem for Distributed Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT","cs.LO"],"primary_cat":"cs.DC","authors_text":"Anup Basil Mathew, Dietmar Berwanger, R. Ramanujam","submitted_at":"2016-04-26T08:32:29Z","abstract_excerpt":"We present a general theorem for distributed synthesis problems in coordination games with $\\omega$-regular objectives of the form: If there exists a winning strategy for the coalition, then there exists an \"essential\" winning strategy, that is obtained by a retraction of the given one. In general, this does not lead to finite-state winning strategies, but when the knowledge of agents remains bounded, we can solve the synthesis problem. Our study is carried out in a setting where objectives are expressed in terms of events that may \\emph{not} be observable. This is natural in games of imperfec"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1604.07564","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-04-26T08:32:29Z","cross_cats_sorted":["cs.FL","cs.GT","cs.LO"],"title_canon_sha256":"222606ad1387f8e6da2c2aa2994c17f7e12a0d249c6d8c49403bf16df8090d53","abstract_canon_sha256":"4505448c4f73b61388a1d0d274bad2e3603ddeb7ee140d3c6b78fd3ee438ff63"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:16:19.479003Z","signature_b64":"5jRdyLXm1l8mGset8ZrRC5fBH+LY8o1NxoDwHL/65q8T7tu+5KST+TkpiY6cye03rqthJdBq9XV+/LyFYYyZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fac69a9a4da6abf12e7728a0f4dcb93bdb03fd19b77a5bb8820070cb674c65ac","last_reissued_at":"2026-05-18T01:16:19.478493Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:16:19.478493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Retraction Theorem for Distributed Synthesis","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.FL","cs.GT","cs.LO"],"primary_cat":"cs.DC","authors_text":"Anup Basil Mathew, Dietmar Berwanger, R. Ramanujam","submitted_at":"2016-04-26T08:32:29Z","abstract_excerpt":"We present a general theorem for distributed synthesis problems in coordination games with $\\omega$-regular objectives of the form: If there exists a winning strategy for the coalition, then there exists an \"essential\" winning strategy, that is obtained by a retraction of the given one. In general, this does not lead to finite-state winning strategies, but when the knowledge of agents remains bounded, we can solve the synthesis problem. Our study is carried out in a setting where objectives are expressed in terms of events that may \\emph{not} be observable. This is natural in games of imperfec"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07564","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1604.07564","created_at":"2026-05-18T01:16:19.478574+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07564v1","created_at":"2026-05-18T01:16:19.478574+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07564","created_at":"2026-05-18T01:16:19.478574+00:00"},{"alias_kind":"pith_short_12","alias_value":"7LDJVGSNU2V7","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_16","alias_value":"7LDJVGSNU2V7CLTX","created_at":"2026-05-18T12:30:04.600751+00:00"},{"alias_kind":"pith_short_8","alias_value":"7LDJVGSN","created_at":"2026-05-18T12:30:04.600751+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP","json":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP.json","graph_json":"https://pith.science/api/pith-number/7LDJVGSNU2V7CLTXFCQPJXFZHP/graph.json","events_json":"https://pith.science/api/pith-number/7LDJVGSNU2V7CLTXFCQPJXFZHP/events.json","paper":"https://pith.science/paper/7LDJVGSN"},"agent_actions":{"view_html":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP","download_json":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP.json","view_paper":"https://pith.science/paper/7LDJVGSN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07564&json=true","fetch_graph":"https://pith.science/api/pith-number/7LDJVGSNU2V7CLTXFCQPJXFZHP/graph.json","fetch_events":"https://pith.science/api/pith-number/7LDJVGSNU2V7CLTXFCQPJXFZHP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP/action/storage_attestation","attest_author":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP/action/author_attestation","sign_citation":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP/action/citation_signature","submit_replication":"https://pith.science/pith/7LDJVGSNU2V7CLTXFCQPJXFZHP/action/replication_record"}},"created_at":"2026-05-18T01:16:19.478574+00:00","updated_at":"2026-05-18T01:16:19.478574+00:00"}