{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:BGG3E3MHV55X5VXE5YQ2EMYQOC","short_pith_number":"pith:BGG3E3MH","schema_version":"1.0","canonical_sha256":"098db26d87af7b7ed6e4ee21a2331070b5bc9fc959f0e9da2aecb077f262e59c","source":{"kind":"arxiv","id":"2606.04687","version":1},"attestation_state":"computed","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 "},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.04687","created_at":"2026-06-04T01:09:25.010712+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04687v1","created_at":"2026-06-04T01:09:25.010712+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04687","created_at":"2026-06-04T01:09:25.010712+00:00"},{"alias_kind":"pith_short_12","alias_value":"BGG3E3MHV55X","created_at":"2026-06-04T01:09:25.010712+00:00"},{"alias_kind":"pith_short_16","alias_value":"BGG3E3MHV55X5VXE","created_at":"2026-06-04T01:09:25.010712+00:00"},{"alias_kind":"pith_short_8","alias_value":"BGG3E3MH","created_at":"2026-06-04T01:09:25.010712+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/BGG3E3MHV55X5VXE5YQ2EMYQOC","json":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC.json","graph_json":"https://pith.science/api/pith-number/BGG3E3MHV55X5VXE5YQ2EMYQOC/graph.json","events_json":"https://pith.science/api/pith-number/BGG3E3MHV55X5VXE5YQ2EMYQOC/events.json","paper":"https://pith.science/paper/BGG3E3MH"},"agent_actions":{"view_html":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC","download_json":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC.json","view_paper":"https://pith.science/paper/BGG3E3MH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04687&json=true","fetch_graph":"https://pith.science/api/pith-number/BGG3E3MHV55X5VXE5YQ2EMYQOC/graph.json","fetch_events":"https://pith.science/api/pith-number/BGG3E3MHV55X5VXE5YQ2EMYQOC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/action/storage_attestation","attest_author":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/action/author_attestation","sign_citation":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/action/citation_signature","submit_replication":"https://pith.science/pith/BGG3E3MHV55X5VXE5YQ2EMYQOC/action/replication_record"}},"created_at":"2026-06-04T01:09:25.010712+00:00","updated_at":"2026-06-04T01:09:25.010712+00:00"}