{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ILZLK6LCMENWFZQDUFQDRKCF7M","short_pith_number":"pith:ILZLK6LC","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"},"canonical_sha256":"42f2b57962611b62e603a16038a845fb1f5ec601b59d58b6adfeb653aa08ff99","source":{"kind":"arxiv","id":"1505.06862","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06862","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06862v2","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06862","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"ILZLK6LCMENW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ILZLK6LCMENWFZQD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ILZLK6LC","created_at":"2026-05-18T12:29:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ILZLK6LCMENWFZQDUFQDRKCF7M","target":"record","payload":{"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"},"canonical_sha256":"42f2b57962611b62e603a16038a845fb1f5ec601b59d58b6adfeb653aa08ff99","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"},"source_kind":"arxiv","source_id":"1505.06862","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-18T00:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5EHzn03E0CdKWtOdT5Rbj1i8qP2QTy1D34vtLtuwbNsPEwSq/VMCHRDc/DZ3woSsVL6qUkptPDNZNsFdmwByCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:36:40.227081Z"},"content_sha256":"973734410239ca5c1283089eaf87ac13bbcd8b9bffe0be675f08a18c437c6ab5","schema_version":"1.0","event_id":"sha256:973734410239ca5c1283089eaf87ac13bbcd8b9bffe0be675f08a18c437c6ab5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ILZLK6LCMENWFZQDUFQDRKCF7M","target":"graph","payload":{"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"},"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-18T00:53:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VUSPIfcdr/e+eEExnIFjN/KsEHD4KlZuUVlq2gzkW7EhSxZ/ixwuF/QGmG4IeoA2Zw0UJbnRz8BPdpeSJKpiCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:36:40.227654Z"},"content_sha256":"28b4d9df8acbca02af3cda0e16bf6d7be54cbef6d47f618ca932fa9b7d652840","schema_version":"1.0","event_id":"sha256:28b4d9df8acbca02af3cda0e16bf6d7be54cbef6d47f618ca932fa9b7d652840"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/bundle.json","state_url":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/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-06-07T05:36:40Z","links":{"resolver":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M","bundle":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/bundle.json","state":"https://pith.science/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ILZLK6LCMENWFZQDUFQDRKCF7M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ILZLK6LCMENWFZQDUFQDRKCF7M","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":"3e01a45c0a8966ca6e4a0c18ff4a0bd85fa0fa9862ba98bcc9fe0c380b089872","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-26T09:08:26Z","title_canon_sha256":"584424ddc19a2c784a85aac9c4bd8aec709c3928eba0068112bff72d7bafac55"},"schema_version":"1.0","source":{"id":"1505.06862","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06862","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06862v2","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06862","created_at":"2026-05-18T00:53:10Z"},{"alias_kind":"pith_short_12","alias_value":"ILZLK6LCMENW","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_16","alias_value":"ILZLK6LCMENWFZQD","created_at":"2026-05-18T12:29:25Z"},{"alias_kind":"pith_short_8","alias_value":"ILZLK6LC","created_at":"2026-05-18T12:29:25Z"}],"graph_snapshots":[{"event_id":"sha256:28b4d9df8acbca02af3cda0e16bf6d7be54cbef6d47f618ca932fa9b7d652840","target":"graph","created_at":"2026-05-18T00:53:10Z","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":"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","authors_text":"Bernd Finkbeiner (Saarland University), Leander Tentrup (Saarland University)","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-26T09:08:26Z","title":"Detecting Unrealizability of Distributed Fault-tolerant Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06862","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:973734410239ca5c1283089eaf87ac13bbcd8b9bffe0be675f08a18c437c6ab5","target":"record","created_at":"2026-05-18T00:53:10Z","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":"3e01a45c0a8966ca6e4a0c18ff4a0bd85fa0fa9862ba98bcc9fe0c380b089872","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LO","submitted_at":"2015-05-26T09:08:26Z","title_canon_sha256":"584424ddc19a2c784a85aac9c4bd8aec709c3928eba0068112bff72d7bafac55"},"schema_version":"1.0","source":{"id":"1505.06862","kind":"arxiv","version":2}},"canonical_sha256":"42f2b57962611b62e603a16038a845fb1f5ec601b59d58b6adfeb653aa08ff99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"42f2b57962611b62e603a16038a845fb1f5ec601b59d58b6adfeb653aa08ff99","first_computed_at":"2026-05-18T00:53:10.696052Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:53:10.696052Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ogkfJ1WCnx440EkTN4Wt2yMDRAW+72WZ/FgL7j6KbtcufhvXm2Fx4RL6tzVqAepFofyn3rugQDmm5R6hNTFsBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:53:10.696703Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06862","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:973734410239ca5c1283089eaf87ac13bbcd8b9bffe0be675f08a18c437c6ab5","sha256:28b4d9df8acbca02af3cda0e16bf6d7be54cbef6d47f618ca932fa9b7d652840"],"state_sha256":"ae81c51e3ab08f48995c99066f2ac816dd0663e103fef1741f6e1d01ede48bc1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"e4WutSj51XbebpyLDC1gh188347bCxarnbTH3T/6l/CbNFXAmflQeYCp6tgCJ8lHK/gFkq2JSvIcz/5LZLxFDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:36:40.231132Z","bundle_sha256":"f771862607beb3b4e5fee67b3d8aa72409f24e429a67fd7f2f744a457369f907"}}