{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:ILZLK6LCMENWFZQDUFQDRKCF7M","short_pith_number":"pith:ILZLK6LC","schema_version":"1.0","canonical_sha256":"42f2b57962611b62e603a16038a845fb1f5ec601b59d58b6adfeb653aa08ff99","source":{"kind":"arxiv","id":"1505.06862","version":2},"attestation_state":"computed","paper":{"title":"Detecting Unrealizability of Distributed Fault-tolerant Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner (Saarland University), Leander Tentrup (Saarland University)","submitted_at":"2015-05-26T09:08:26Z","abstract_excerpt":"Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is available in every component, and information transmitted from other components may arrive with a delay or not at all, especially in the presence of faults. The problem of checking the distributed realizability of a temporal specification is, in general, undecidable. Semi-algorithms for synthesis, such as bounded synthesis, are only useful in the positive case, whe"},"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":"1505.06862","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-26T09:08:26Z","cross_cats_sorted":[],"title_canon_sha256":"584424ddc19a2c784a85aac9c4bd8aec709c3928eba0068112bff72d7bafac55","abstract_canon_sha256":"3e01a45c0a8966ca6e4a0c18ff4a0bd85fa0fa9862ba98bcc9fe0c380b089872"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:53:10.696703Z","signature_b64":"ogkfJ1WCnx440EkTN4Wt2yMDRAW+72WZ/FgL7j6KbtcufhvXm2Fx4RL6tzVqAepFofyn3rugQDmm5R6hNTFsBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"42f2b57962611b62e603a16038a845fb1f5ec601b59d58b6adfeb653aa08ff99","last_reissued_at":"2026-05-18T00:53:10.696052Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:53:10.696052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Detecting Unrealizability of Distributed Fault-tolerant Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.LO","authors_text":"Bernd Finkbeiner (Saarland University), Leander Tentrup (Saarland University)","submitted_at":"2015-05-26T09:08:26Z","abstract_excerpt":"Writing formal specifications for distributed systems is difficult. Even simple consistency requirements often turn out to be unrealizable because of the complicated information flow in the distributed system: not all information is available in every component, and information transmitted from other components may arrive with a delay or not at all, especially in the presence of faults. The problem of checking the distributed realizability of a temporal specification is, in general, undecidable. Semi-algorithms for synthesis, such as bounded synthesis, are only useful in the positive case, whe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06862","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1505.06862","created_at":"2026-05-18T00:53:10.696154+00:00"},{"alias_kind":"arxiv_version","alias_value":"1505.06862v2","created_at":"2026-05-18T00:53:10.696154+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06862","created_at":"2026-05-18T00:53:10.696154+00:00"},{"alias_kind":"pith_short_12","alias_value":"ILZLK6LCMENW","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_16","alias_value":"ILZLK6LCMENWFZQD","created_at":"2026-05-18T12:29:25.134429+00:00"},{"alias_kind":"pith_short_8","alias_value":"ILZLK6LC","created_at":"2026-05-18T12:29:25.134429+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/ILZLK6LCMENWFZQDUFQDRKCF7M","json":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M.json","graph_json":"https://pith.science/api/pith-number/ILZLK6LCMENWFZQDUFQDRKCF7M/graph.json","events_json":"https://pith.science/api/pith-number/ILZLK6LCMENWFZQDUFQDRKCF7M/events.json","paper":"https://pith.science/paper/ILZLK6LC"},"agent_actions":{"view_html":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M","download_json":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M.json","view_paper":"https://pith.science/paper/ILZLK6LC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1505.06862&json=true","fetch_graph":"https://pith.science/api/pith-number/ILZLK6LCMENWFZQDUFQDRKCF7M/graph.json","fetch_events":"https://pith.science/api/pith-number/ILZLK6LCMENWFZQDUFQDRKCF7M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/action/storage_attestation","attest_author":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/action/author_attestation","sign_citation":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/action/citation_signature","submit_replication":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/action/replication_record"}},"created_at":"2026-05-18T00:53:10.696154+00:00","updated_at":"2026-05-18T00:53:10.696154+00:00"}