{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:SMZODKXV4PP4CATQV7XQCZPPVX","short_pith_number":"pith:SMZODKXV","schema_version":"1.0","canonical_sha256":"9332e1aaf5e3dfc10270afef0165efadf57ad41c8fd26ec2b764d584f1d3f02b","source":{"kind":"arxiv","id":"1204.0641","version":5},"attestation_state":"computed","paper":{"title":"Agreement in Directed Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Martin Biely, Peter Robinson, Ulrich Schmid","submitted_at":"2012-04-03T10:00:45Z","abstract_excerpt":"We study distributed computation in synchronous dynamic networks where an omniscient adversary controls the unidirectional communication links. Its behavior is modeled as a sequence of directed graphs representing the active (i.e. timely) communication links per round. We prove that consensus is impossible under some natural weak connectivity assumptions, and introduce vertex-stable root components as a means for circumventing this impossibility. Essentially, we assume that there is a short period of time during which an arbitrary part of the network remains strongly connected, while its inter"},"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":"1204.0641","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-04-03T10:00:45Z","cross_cats_sorted":[],"title_canon_sha256":"62817da4777a53f18ac6007d68e731ef12a46e5d601ebbc9fd54cc8a4a3cdb33","abstract_canon_sha256":"05b32a2255f74030805eb0bb5121e3865d00e09ae1d79d31625aa957ea35155a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:21:16.600030Z","signature_b64":"f9lWQxZbcopyN+nVzZr8Xh+5QRtfR0Y88qOs0UpQuBdiMc3Eof7gr3pc9LZwUDtHKyYTpMxg0vYiIZs+BP4PBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9332e1aaf5e3dfc10270afef0165efadf57ad41c8fd26ec2b764d584f1d3f02b","last_reissued_at":"2026-05-18T02:21:16.599583Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:21:16.599583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Agreement in Directed Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Martin Biely, Peter Robinson, Ulrich Schmid","submitted_at":"2012-04-03T10:00:45Z","abstract_excerpt":"We study distributed computation in synchronous dynamic networks where an omniscient adversary controls the unidirectional communication links. Its behavior is modeled as a sequence of directed graphs representing the active (i.e. timely) communication links per round. We prove that consensus is impossible under some natural weak connectivity assumptions, and introduce vertex-stable root components as a means for circumventing this impossibility. Essentially, we assume that there is a short period of time during which an arbitrary part of the network remains strongly connected, while its inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0641","kind":"arxiv","version":5},"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":"1204.0641","created_at":"2026-05-18T02:21:16.599652+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0641v5","created_at":"2026-05-18T02:21:16.599652+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0641","created_at":"2026-05-18T02:21:16.599652+00:00"},{"alias_kind":"pith_short_12","alias_value":"SMZODKXV4PP4","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_16","alias_value":"SMZODKXV4PP4CATQ","created_at":"2026-05-18T12:27:20.899486+00:00"},{"alias_kind":"pith_short_8","alias_value":"SMZODKXV","created_at":"2026-05-18T12:27:20.899486+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/SMZODKXV4PP4CATQV7XQCZPPVX","json":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX.json","graph_json":"https://pith.science/api/pith-number/SMZODKXV4PP4CATQV7XQCZPPVX/graph.json","events_json":"https://pith.science/api/pith-number/SMZODKXV4PP4CATQV7XQCZPPVX/events.json","paper":"https://pith.science/paper/SMZODKXV"},"agent_actions":{"view_html":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX","download_json":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX.json","view_paper":"https://pith.science/paper/SMZODKXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0641&json=true","fetch_graph":"https://pith.science/api/pith-number/SMZODKXV4PP4CATQV7XQCZPPVX/graph.json","fetch_events":"https://pith.science/api/pith-number/SMZODKXV4PP4CATQV7XQCZPPVX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX/action/storage_attestation","attest_author":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX/action/author_attestation","sign_citation":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX/action/citation_signature","submit_replication":"https://pith.science/pith/SMZODKXV4PP4CATQV7XQCZPPVX/action/replication_record"}},"created_at":"2026-05-18T02:21:16.599652+00:00","updated_at":"2026-05-18T02:21:16.599652+00:00"}