{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:QNCUECNQSRSCEY5OA6MP6T3YJM","short_pith_number":"pith:QNCUECNQ","schema_version":"1.0","canonical_sha256":"83454209b094642263ae0798ff4f784b1d3a63220df7727f85ffc7a537e60a0c","source":{"kind":"arxiv","id":"1601.01587","version":1},"attestation_state":"computed","paper":{"title":"Distributed Synthesis in Continuous Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DC","authors_text":"Holger Hermanns, Jan Kr\\v{c}\\'al, Steen Vester","submitted_at":"2016-01-07T16:30:11Z","abstract_excerpt":"We introduce a formalism modelling communication of distributed agents strictly in continuous-time. Within this framework, we study the problem of synthesising local strategies for individual agents such that a specified set of goal states is reached, or reached with at least a given probability. The flow of time is modelled explicitly based on continuous-time randomness, with two natural implications: First, the non-determinism stemming from interleaving disappears. Second, when we restrict to a subclass of non-urgent models, the quantitative value problem for two players can be solved in EXP"},"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":"1601.01587","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2016-01-07T16:30:11Z","cross_cats_sorted":["cs.LO"],"title_canon_sha256":"a87610e3722ceb420b8a1eb242ee76a06be82e2e76181a4e846ce98a974182b4","abstract_canon_sha256":"b8b297463a59efe9668cf851dd1e8fb16417841bb21d074ee4ebeb21ac68422b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:23:13.277379Z","signature_b64":"o4W7RlOWA1PiSluBxPZWM9Np4iLj/Uux4Nq016IF3mH9CTnHy66yJFlj5/v7uqxJ3au4NfRg0Hrb+gHLIBWhDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83454209b094642263ae0798ff4f784b1d3a63220df7727f85ffc7a537e60a0c","last_reissued_at":"2026-05-18T01:23:13.276596Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:23:13.276596Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Synthesis in Continuous Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LO"],"primary_cat":"cs.DC","authors_text":"Holger Hermanns, Jan Kr\\v{c}\\'al, Steen Vester","submitted_at":"2016-01-07T16:30:11Z","abstract_excerpt":"We introduce a formalism modelling communication of distributed agents strictly in continuous-time. Within this framework, we study the problem of synthesising local strategies for individual agents such that a specified set of goal states is reached, or reached with at least a given probability. The flow of time is modelled explicitly based on continuous-time randomness, with two natural implications: First, the non-determinism stemming from interleaving disappears. Second, when we restrict to a subclass of non-urgent models, the quantitative value problem for two players can be solved in EXP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.01587","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":"1601.01587","created_at":"2026-05-18T01:23:13.276730+00:00"},{"alias_kind":"arxiv_version","alias_value":"1601.01587v1","created_at":"2026-05-18T01:23:13.276730+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.01587","created_at":"2026-05-18T01:23:13.276730+00:00"},{"alias_kind":"pith_short_12","alias_value":"QNCUECNQSRSC","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_16","alias_value":"QNCUECNQSRSCEY5O","created_at":"2026-05-18T12:30:39.010887+00:00"},{"alias_kind":"pith_short_8","alias_value":"QNCUECNQ","created_at":"2026-05-18T12:30:39.010887+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/QNCUECNQSRSCEY5OA6MP6T3YJM","json":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM.json","graph_json":"https://pith.science/api/pith-number/QNCUECNQSRSCEY5OA6MP6T3YJM/graph.json","events_json":"https://pith.science/api/pith-number/QNCUECNQSRSCEY5OA6MP6T3YJM/events.json","paper":"https://pith.science/paper/QNCUECNQ"},"agent_actions":{"view_html":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM","download_json":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM.json","view_paper":"https://pith.science/paper/QNCUECNQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1601.01587&json=true","fetch_graph":"https://pith.science/api/pith-number/QNCUECNQSRSCEY5OA6MP6T3YJM/graph.json","fetch_events":"https://pith.science/api/pith-number/QNCUECNQSRSCEY5OA6MP6T3YJM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM/action/storage_attestation","attest_author":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM/action/author_attestation","sign_citation":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM/action/citation_signature","submit_replication":"https://pith.science/pith/QNCUECNQSRSCEY5OA6MP6T3YJM/action/replication_record"}},"created_at":"2026-05-18T01:23:13.276730+00:00","updated_at":"2026-05-18T01:23:13.276730+00:00"}