{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:OGCS5MB65EJ3AWE72HHHW7HVQ4","short_pith_number":"pith:OGCS5MB6","schema_version":"1.0","canonical_sha256":"71852eb03ee913b0589fd1ce7b7cf5871203ccb76f44a2d848fdd74ea99b05dc","source":{"kind":"arxiv","id":"1804.03454","version":1},"attestation_state":"computed","paper":{"title":"Coverability: Realizability Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Nir Piterman","submitted_at":"2018-04-10T11:12:49Z","abstract_excerpt":"We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability with no further specifications, where we have to show that the nondeterminism of the produced system is sufficient to produce all the words required in the output language. We show a counting argument on a deterministic automaton representing the language to be covered that allows to produce such a system. We then turn to the case of coverability with addit"},"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":"1804.03454","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2018-04-10T11:12:49Z","cross_cats_sorted":[],"title_canon_sha256":"a710735950cd5aad1bea76af1e40b32c99daa0123875ba3e3e5e713cd21b2bae","abstract_canon_sha256":"17743610ec6c8f24a6a357f298435b4fe7ffad0656fbd8d62ad71cc96de8b805"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:48.174048Z","signature_b64":"sK1H6hMXBGgcsw3kNy/e2Zp9xpTKM7A/fz8hu1+K0Tt04hJigtQIg3ngUq3udwnaPU3SkzRFdcsoQ9/ZxENTAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"71852eb03ee913b0589fd1ce7b7cf5871203ccb76f44a2d848fdd74ea99b05dc","last_reissued_at":"2026-05-18T00:18:48.173445Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:48.173445Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Coverability: Realizability Lower Bounds","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Krishnendu Chatterjee, Nir Piterman","submitted_at":"2018-04-10T11:12:49Z","abstract_excerpt":"We introduce the problem of temporal coverability for realizability and synthesis. Namely, given a language of words that must be covered by a produced system, how to automatically produce such a system. We consider the case of coverability with no further specifications, where we have to show that the nondeterminism of the produced system is sufficient to produce all the words required in the output language. We show a counting argument on a deterministic automaton representing the language to be covered that allows to produce such a system. We then turn to the case of coverability with addit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03454","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":"1804.03454","created_at":"2026-05-18T00:18:48.173545+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03454v1","created_at":"2026-05-18T00:18:48.173545+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03454","created_at":"2026-05-18T00:18:48.173545+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGCS5MB65EJ3","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGCS5MB65EJ3AWE7","created_at":"2026-05-18T12:32:43.782077+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGCS5MB6","created_at":"2026-05-18T12:32:43.782077+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/OGCS5MB65EJ3AWE72HHHW7HVQ4","json":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4.json","graph_json":"https://pith.science/api/pith-number/OGCS5MB65EJ3AWE72HHHW7HVQ4/graph.json","events_json":"https://pith.science/api/pith-number/OGCS5MB65EJ3AWE72HHHW7HVQ4/events.json","paper":"https://pith.science/paper/OGCS5MB6"},"agent_actions":{"view_html":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4","download_json":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4.json","view_paper":"https://pith.science/paper/OGCS5MB6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03454&json=true","fetch_graph":"https://pith.science/api/pith-number/OGCS5MB65EJ3AWE72HHHW7HVQ4/graph.json","fetch_events":"https://pith.science/api/pith-number/OGCS5MB65EJ3AWE72HHHW7HVQ4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4/action/storage_attestation","attest_author":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4/action/author_attestation","sign_citation":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4/action/citation_signature","submit_replication":"https://pith.science/pith/OGCS5MB65EJ3AWE72HHHW7HVQ4/action/replication_record"}},"created_at":"2026-05-18T00:18:48.173545+00:00","updated_at":"2026-05-18T00:18:48.173545+00:00"}