{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:SI3L6YEKI6KAJWTWPPTWQLHIST","short_pith_number":"pith:SI3L6YEK","canonical_record":{"source":{"id":"1905.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-13T05:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"3ca3cdb1c3b0b3c512f4bcde7cfb89892d5f0db50978b7999524dfb001077743","abstract_canon_sha256":"670cd50b21cfb888c536ef1037ba385cdf599a1d0aa4ba8afb5c35d54942906c"},"schema_version":"1.0"},"canonical_sha256":"9236bf608a479404da767be7682ce894dffaae1a3b0610ad0260ba286bfc20a6","source":{"kind":"arxiv","id":"1905.04867","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04867","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04867v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04867","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"SI3L6YEKI6KA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SI3L6YEKI6KAJWTW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SI3L6YEK","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:SI3L6YEKI6KAJWTWPPTWQLHIST","target":"record","payload":{"canonical_record":{"source":{"id":"1905.04867","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-13T05:30:29Z","cross_cats_sorted":[],"title_canon_sha256":"3ca3cdb1c3b0b3c512f4bcde7cfb89892d5f0db50978b7999524dfb001077743","abstract_canon_sha256":"670cd50b21cfb888c536ef1037ba385cdf599a1d0aa4ba8afb5c35d54942906c"},"schema_version":"1.0"},"canonical_sha256":"9236bf608a479404da767be7682ce894dffaae1a3b0610ad0260ba286bfc20a6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:46:23.263023Z","signature_b64":"9wx5aJuF5uAq7pfo8/9eCKLQFXowcF78dhiXMukQw2eKeRr12qMywEYpdGLemuhf7qCXcebF2IkgMKmpPUlvBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9236bf608a479404da767be7682ce894dffaae1a3b0610ad0260ba286bfc20a6","last_reissued_at":"2026-05-17T23:46:23.262387Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:46:23.262387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.04867","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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4hi2cokglq4wfwFkR1/kdks7uTcFS98mO3ir6hS9i/TcR/g1gLA9SLmsjofbLnnba4hBKKWqwEMJKDD1h4EJBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:28.261752Z"},"content_sha256":"9af4a63ec85652d7dcb730911462fcab9cfa090f0ef0430c6a02184974eb51ab","schema_version":"1.0","event_id":"sha256:9af4a63ec85652d7dcb730911462fcab9cfa090f0ef0430c6a02184974eb51ab"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:SI3L6YEKI6KAJWTWPPTWQLHIST","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"ONLAY: Online Layering for scalable asynchronous BFT system","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Andre Cronje, Quan Nguyen","submitted_at":"2019-05-13T05:30:29Z","abstract_excerpt":"This paper presents a new framework, namely \\emph{\\onlay}, for scalable asynchronous distributed systems. In this framework, we propose a consensus protocol $L_{\\phi}$, which is based on the Lachesis protocol~\\cite{lachesis01}. At the core of $L_{\\phi}$ protocol, it introduces to use layering algorithm to achieve practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). Further, we present new online layering algorithms for the evolutionary DAGs across the nodes. Our new protocol achieves determistic scalable consensus in asynchronous pBFT by using ass"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04867","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-17T23:46:23Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DZPfqGcebZDLr5DVNR99XBt8P2JLTOnvrGggHKqLbtBhRO0YXT8cwl53pSSlyTeV0G8DM4nH8OATdI/Qb1P7CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T16:58:28.262472Z"},"content_sha256":"b0dd99f08dc069c15028e8e8d027e376dc04dec280220938319f52e67facbd8d","schema_version":"1.0","event_id":"sha256:b0dd99f08dc069c15028e8e8d027e376dc04dec280220938319f52e67facbd8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/bundle.json","state_url":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/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-05-25T16:58:28Z","links":{"resolver":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST","bundle":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/bundle.json","state":"https://pith.science/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SI3L6YEKI6KAJWTWPPTWQLHIST/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:SI3L6YEKI6KAJWTWPPTWQLHIST","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":"670cd50b21cfb888c536ef1037ba385cdf599a1d0aa4ba8afb5c35d54942906c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-13T05:30:29Z","title_canon_sha256":"3ca3cdb1c3b0b3c512f4bcde7cfb89892d5f0db50978b7999524dfb001077743"},"schema_version":"1.0","source":{"id":"1905.04867","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.04867","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"arxiv_version","alias_value":"1905.04867v1","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.04867","created_at":"2026-05-17T23:46:23Z"},{"alias_kind":"pith_short_12","alias_value":"SI3L6YEKI6KA","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"SI3L6YEKI6KAJWTW","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"SI3L6YEK","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:b0dd99f08dc069c15028e8e8d027e376dc04dec280220938319f52e67facbd8d","target":"graph","created_at":"2026-05-17T23:46:23Z","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 presents a new framework, namely \\emph{\\onlay}, for scalable asynchronous distributed systems. In this framework, we propose a consensus protocol $L_{\\phi}$, which is based on the Lachesis protocol~\\cite{lachesis01}. At the core of $L_{\\phi}$ protocol, it introduces to use layering algorithm to achieve practical Byzantine fault tolerance (pBFT) in leaderless asynchronous Directed Acyclic Graph (DAG). Further, we present new online layering algorithms for the evolutionary DAGs across the nodes. Our new protocol achieves determistic scalable consensus in asynchronous pBFT by using ass","authors_text":"Andre Cronje, Quan Nguyen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-13T05:30:29Z","title":"ONLAY: Online Layering for scalable asynchronous BFT system"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.04867","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:9af4a63ec85652d7dcb730911462fcab9cfa090f0ef0430c6a02184974eb51ab","target":"record","created_at":"2026-05-17T23:46:23Z","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":"670cd50b21cfb888c536ef1037ba385cdf599a1d0aa4ba8afb5c35d54942906c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-13T05:30:29Z","title_canon_sha256":"3ca3cdb1c3b0b3c512f4bcde7cfb89892d5f0db50978b7999524dfb001077743"},"schema_version":"1.0","source":{"id":"1905.04867","kind":"arxiv","version":1}},"canonical_sha256":"9236bf608a479404da767be7682ce894dffaae1a3b0610ad0260ba286bfc20a6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9236bf608a479404da767be7682ce894dffaae1a3b0610ad0260ba286bfc20a6","first_computed_at":"2026-05-17T23:46:23.262387Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:46:23.262387Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9wx5aJuF5uAq7pfo8/9eCKLQFXowcF78dhiXMukQw2eKeRr12qMywEYpdGLemuhf7qCXcebF2IkgMKmpPUlvBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:46:23.263023Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.04867","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9af4a63ec85652d7dcb730911462fcab9cfa090f0ef0430c6a02184974eb51ab","sha256:b0dd99f08dc069c15028e8e8d027e376dc04dec280220938319f52e67facbd8d"],"state_sha256":"9d62f9502d1e8036a77786fa3133a45a5bb03a9e89edea66ca8b3ce5a2afb6d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sFW6wp0JvXVEb9TTDCLiH43KYBLDZJOnshnJvnkpemxixBHxjY1yiClYvF6cV2tjfsSJsgoCaB/KNCmqUkz+Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T16:58:28.266452Z","bundle_sha256":"e65d973e797bafc184644e085c980726ed990ff810fc26c9363a24ee87091b7a"}}