{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:BGG3E3MHV55X5VXE5YQ2EMYQOC","short_pith_number":"pith:BGG3E3MH","canonical_record":{"source":{"id":"2606.04687","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-03T10:11:50Z","cross_cats_sorted":[],"title_canon_sha256":"951db97d97aca8844cd5654948e2ba2586910369231b6d59453ebaf9b3b99bbe","abstract_canon_sha256":"eb56a26f98384b433ed49e600bd8b7297c28af97c10e0d072c05a09d3ed9c680"},"schema_version":"1.0"},"canonical_sha256":"098db26d87af7b7ed6e4ee21a2331070b5bc9fc959f0e9da2aecb077f262e59c","source":{"kind":"arxiv","id":"2606.04687","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04687","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04687v1","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04687","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"BGG3E3MHV55X","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"BGG3E3MHV55X5VXE","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"BGG3E3MH","created_at":"2026-06-04T01:09:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:BGG3E3MHV55X5VXE5YQ2EMYQOC","target":"record","payload":{"canonical_record":{"source":{"id":"2606.04687","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-03T10:11:50Z","cross_cats_sorted":[],"title_canon_sha256":"951db97d97aca8844cd5654948e2ba2586910369231b6d59453ebaf9b3b99bbe","abstract_canon_sha256":"eb56a26f98384b433ed49e600bd8b7297c28af97c10e0d072c05a09d3ed9c680"},"schema_version":"1.0"},"canonical_sha256":"098db26d87af7b7ed6e4ee21a2331070b5bc9fc959f0e9da2aecb077f262e59c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:25.011278Z","signature_b64":"VosEAmTVYSM2daTHvBp66mZ1Pl+s6efwSc6E0f7Mmjk8H/8DoYAz4OuLYcDh1BK4WB/63ZKyhBD73PKFyfE2Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"098db26d87af7b7ed6e4ee21a2331070b5bc9fc959f0e9da2aecb077f262e59c","last_reissued_at":"2026-06-04T01:09:25.010636Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:25.010636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.04687","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-06-04T01:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8m5Vem1zP9W5fWb6YeJz1dye3xxYzo75wV438p6aDh6xLG/Eo8p2Hd4ATrjYUVSCJ42KP5PYOsXSm2GTf16gCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:07:24.047336Z"},"content_sha256":"3c2140afce846487a36821235c16a91504aa08d44aa840641dbfc99eca64692d","schema_version":"1.0","event_id":"sha256:3c2140afce846487a36821235c16a91504aa08d44aa840641dbfc99eca64692d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:BGG3E3MHV55X5VXE5YQ2EMYQOC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Clownfish: Scaling DAG-based BFT Consensus via Sparse Edges","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Feifan Wang, Jingfan Yu, Zhixuan Fang, Zixi Cai","submitted_at":"2026-06-03T10:11:50Z","abstract_excerpt":"Directed Acyclic Graph (DAG) based BFT protocols have demonstrated the capability to achieve significantly high throughput in practice. Recent advancements focused on minimizing the good-case latency of these protocols, approaching the theoretical lower bound. However, the high communication complexity inherent in existing DAG-based protocols limits their scalability. This primarily arises because each vertex in the DAG must include a linear number of edges (references) to vertices from previous rounds.\n  We present Clownfish, a partially synchronous DAG-based BFT protocol designed to address "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04687","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.04687/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-06-04T01:09:25Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"YNZU2YK6B/cZEQVnp+oiF8qrXEAeo1mpOtXousL6uXXp0LAzfVx8FjTS5VNMMrBmz1ATrUjBjJXCaLoHdz1sAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T07:07:24.047718Z"},"content_sha256":"3a2098d072e20793a9cb5b5cd8708e581f956836dc893288958e0dc1a80d6b12","schema_version":"1.0","event_id":"sha256:3a2098d072e20793a9cb5b5cd8708e581f956836dc893288958e0dc1a80d6b12"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/bundle.json","state_url":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/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-26T07:07:24Z","links":{"resolver":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC","bundle":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/bundle.json","state":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:BGG3E3MHV55X5VXE5YQ2EMYQOC","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":"eb56a26f98384b433ed49e600bd8b7297c28af97c10e0d072c05a09d3ed9c680","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-03T10:11:50Z","title_canon_sha256":"951db97d97aca8844cd5654948e2ba2586910369231b6d59453ebaf9b3b99bbe"},"schema_version":"1.0","source":{"id":"2606.04687","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.04687","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"arxiv_version","alias_value":"2606.04687v1","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04687","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"pith_short_12","alias_value":"BGG3E3MHV55X","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"pith_short_16","alias_value":"BGG3E3MHV55X5VXE","created_at":"2026-06-04T01:09:25Z"},{"alias_kind":"pith_short_8","alias_value":"BGG3E3MH","created_at":"2026-06-04T01:09:25Z"}],"graph_snapshots":[{"event_id":"sha256:3a2098d072e20793a9cb5b5cd8708e581f956836dc893288958e0dc1a80d6b12","target":"graph","created_at":"2026-06-04T01:09:25Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.04687/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Directed Acyclic Graph (DAG) based BFT protocols have demonstrated the capability to achieve significantly high throughput in practice. Recent advancements focused on minimizing the good-case latency of these protocols, approaching the theoretical lower bound. However, the high communication complexity inherent in existing DAG-based protocols limits their scalability. This primarily arises because each vertex in the DAG must include a linear number of edges (references) to vertices from previous rounds.\n  We present Clownfish, a partially synchronous DAG-based BFT protocol designed to address ","authors_text":"Feifan Wang, Jingfan Yu, Zhixuan Fang, Zixi Cai","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-03T10:11:50Z","title":"Clownfish: Scaling DAG-based BFT Consensus via Sparse Edges"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04687","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:3c2140afce846487a36821235c16a91504aa08d44aa840641dbfc99eca64692d","target":"record","created_at":"2026-06-04T01:09:25Z","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":"eb56a26f98384b433ed49e600bd8b7297c28af97c10e0d072c05a09d3ed9c680","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2026-06-03T10:11:50Z","title_canon_sha256":"951db97d97aca8844cd5654948e2ba2586910369231b6d59453ebaf9b3b99bbe"},"schema_version":"1.0","source":{"id":"2606.04687","kind":"arxiv","version":1}},"canonical_sha256":"098db26d87af7b7ed6e4ee21a2331070b5bc9fc959f0e9da2aecb077f262e59c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"098db26d87af7b7ed6e4ee21a2331070b5bc9fc959f0e9da2aecb077f262e59c","first_computed_at":"2026-06-04T01:09:25.010636Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-04T01:09:25.010636Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VosEAmTVYSM2daTHvBp66mZ1Pl+s6efwSc6E0f7Mmjk8H/8DoYAz4OuLYcDh1BK4WB/63ZKyhBD73PKFyfE2Bw==","signature_status":"signed_v1","signed_at":"2026-06-04T01:09:25.011278Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.04687","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:3c2140afce846487a36821235c16a91504aa08d44aa840641dbfc99eca64692d","sha256:3a2098d072e20793a9cb5b5cd8708e581f956836dc893288958e0dc1a80d6b12"],"state_sha256":"5760481658d613ffa7b775fdcb9d84d114e748d2b79e749783da390584165a4f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mS96s9CijSgyiYBWaO869vQr64UrWb0mjh1uQ6aB5dfvU1IFr4MJhS66XE4AxCp63DnlGwBg7VlIP60dr6PrDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T07:07:24.049721Z","bundle_sha256":"2744562d00ca6257052c442a57f4fa5bdb283faa4b07d5b99516b8a55b99e99a"}}