{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:5ND6L62INZYFL7OWIWOFLGVLPA","short_pith_number":"pith:5ND6L62I","canonical_record":{"source":{"id":"1810.02186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-04T13:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"793e25d34844174b029a0af2cd027aa0519e2c63316a115cc967131d9a20aeca","abstract_canon_sha256":"048120fefbc0ee74c172a393d4dcef10c717c125e51de4d0c6431ecf0cc149f0"},"schema_version":"1.0"},"canonical_sha256":"eb47e5fb486e7055fdd6459c559aab78101e1e1649ef3cefbdf73e40195b0039","source":{"kind":"arxiv","id":"1810.02186","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02186","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02186v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02186","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"5ND6L62INZYF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ND6L62INZYFL7OW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ND6L62I","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:5ND6L62INZYFL7OWIWOFLGVLPA","target":"record","payload":{"canonical_record":{"source":{"id":"1810.02186","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-04T13:08:10Z","cross_cats_sorted":[],"title_canon_sha256":"793e25d34844174b029a0af2cd027aa0519e2c63316a115cc967131d9a20aeca","abstract_canon_sha256":"048120fefbc0ee74c172a393d4dcef10c717c125e51de4d0c6431ecf0cc149f0"},"schema_version":"1.0"},"canonical_sha256":"eb47e5fb486e7055fdd6459c559aab78101e1e1649ef3cefbdf73e40195b0039","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:06.004013Z","signature_b64":"xZdVUdRtjCX3vsxLFSJMBsbesAYDORL6znmy3xaUVJNxcljj0LbS6+JwCaaQzHXXMMf3wqeXT6+avZybcPl1Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"eb47e5fb486e7055fdd6459c559aab78101e1e1649ef3cefbdf73e40195b0039","last_reissued_at":"2026-05-18T00:04:06.003262Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:06.003262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.02186","source_version":1,"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gXXM0nHQ1FQE1/MwjQEbGPmrJIFvkg7fFAH4z4tldHa1lcSEU/9y2pMVPeQLZ0c3CGFwlVUr8UmJ+M+A5dZ7AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:59:15.516559Z"},"content_sha256":"5319adb55f5586b7373e59f5287159633984a2f2a6015ad46706af961d904ecd","schema_version":"1.0","event_id":"sha256:5319adb55f5586b7373e59f5287159633984a2f2a6015ad46706af961d904ecd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:5ND6L62INZYFL7OWIWOFLGVLPA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andre Cronje, Byung-Ik Ahn, Hyunjoon Cheon, Jiho Park, Kiyoung Jang, Quan Nguyen, Sang-Min Choi, Yo-Sub Han","submitted_at":"2018-10-04T13:08:10Z","abstract_excerpt":"This paper introduces a new family of consensus protocols, namely \\emph{Lachesis-class} denoted by $\\mathcal{L}$, for distributed networks with guaranteed Byzantine fault tolerance. Each Lachesis protocol $L$ in $\\mathcal{L}$ has complete asynchrony, is leaderless, has no round robin, no proof-of-work, and has eventual consensus.\n  The core concept of our technology is the \\emph{OPERA chain}, generated by the Lachesis protocol. In the most general form, each node in Lachesis has a set of $k$ neighbours of most preference. When receiving transactions a node creates and shares an event block wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02186","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"},"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:04:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G3UVqVR9Fxx0mjMpp1wtao0BgHAMck8M5lF7OR+ATzHdiT6eWP4Y57Fiw78NyFtYIyl/Qck+jmj15K1pzZZ8CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T05:59:15.517218Z"},"content_sha256":"492291fe4efa79b6f1af8744a047ca6fff7c09b48f8b8da0825ba21dd731f824","schema_version":"1.0","event_id":"sha256:492291fe4efa79b6f1af8744a047ca6fff7c09b48f8b8da0825ba21dd731f824"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/5ND6L62INZYFL7OWIWOFLGVLPA/bundle.json","state_url":"https://pith.science/pith/5ND6L62INZYFL7OWIWOFLGVLPA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/5ND6L62INZYFL7OWIWOFLGVLPA/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-06T05:59:15Z","links":{"resolver":"https://pith.science/pith/5ND6L62INZYFL7OWIWOFLGVLPA","bundle":"https://pith.science/pith/5ND6L62INZYFL7OWIWOFLGVLPA/bundle.json","state":"https://pith.science/pith/5ND6L62INZYFL7OWIWOFLGVLPA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/5ND6L62INZYFL7OWIWOFLGVLPA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:5ND6L62INZYFL7OWIWOFLGVLPA","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":"048120fefbc0ee74c172a393d4dcef10c717c125e51de4d0c6431ecf0cc149f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-04T13:08:10Z","title_canon_sha256":"793e25d34844174b029a0af2cd027aa0519e2c63316a115cc967131d9a20aeca"},"schema_version":"1.0","source":{"id":"1810.02186","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.02186","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"arxiv_version","alias_value":"1810.02186v1","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.02186","created_at":"2026-05-18T00:04:06Z"},{"alias_kind":"pith_short_12","alias_value":"5ND6L62INZYF","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"5ND6L62INZYFL7OW","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"5ND6L62I","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:492291fe4efa79b6f1af8744a047ca6fff7c09b48f8b8da0825ba21dd731f824","target":"graph","created_at":"2026-05-18T00:04:06Z","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":"This paper introduces a new family of consensus protocols, namely \\emph{Lachesis-class} denoted by $\\mathcal{L}$, for distributed networks with guaranteed Byzantine fault tolerance. Each Lachesis protocol $L$ in $\\mathcal{L}$ has complete asynchrony, is leaderless, has no round robin, no proof-of-work, and has eventual consensus.\n  The core concept of our technology is the \\emph{OPERA chain}, generated by the Lachesis protocol. In the most general form, each node in Lachesis has a set of $k$ neighbours of most preference. When receiving transactions a node creates and shares an event block wit","authors_text":"Andre Cronje, Byung-Ik Ahn, Hyunjoon Cheon, Jiho Park, Kiyoung Jang, Quan Nguyen, Sang-Min Choi, Yo-Sub Han","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-04T13:08:10Z","title":"OPERA: Reasoning about continuous common knowledge in asynchronous distributed systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.02186","kind":"arxiv","version":1},"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:5319adb55f5586b7373e59f5287159633984a2f2a6015ad46706af961d904ecd","target":"record","created_at":"2026-05-18T00:04:06Z","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":"048120fefbc0ee74c172a393d4dcef10c717c125e51de4d0c6431ecf0cc149f0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2018-10-04T13:08:10Z","title_canon_sha256":"793e25d34844174b029a0af2cd027aa0519e2c63316a115cc967131d9a20aeca"},"schema_version":"1.0","source":{"id":"1810.02186","kind":"arxiv","version":1}},"canonical_sha256":"eb47e5fb486e7055fdd6459c559aab78101e1e1649ef3cefbdf73e40195b0039","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"eb47e5fb486e7055fdd6459c559aab78101e1e1649ef3cefbdf73e40195b0039","first_computed_at":"2026-05-18T00:04:06.003262Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:04:06.003262Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xZdVUdRtjCX3vsxLFSJMBsbesAYDORL6znmy3xaUVJNxcljj0LbS6+JwCaaQzHXXMMf3wqeXT6+avZybcPl1Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:04:06.004013Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.02186","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5319adb55f5586b7373e59f5287159633984a2f2a6015ad46706af961d904ecd","sha256:492291fe4efa79b6f1af8744a047ca6fff7c09b48f8b8da0825ba21dd731f824"],"state_sha256":"f6c79eb31dd672f1a6c9aa7be68792384984914bdcd55046e2dfb5c8854bcb30"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GaQwGaHpwtL1qDZzdRs0+NshyiyC+VD6Q1E5SIp24CLZOR76FjTcyspCahFhdqkxyPTDQebeInfHqlaE1E8KAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T05:59:15.521404Z","bundle_sha256":"af6d97b46d1f21222e470e533251696b9be6de29b0d2ebf59b6f582507ee923c"}}