{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ZOXLJZH74IU4SWFTU4EEJHHBME","short_pith_number":"pith:ZOXLJZH7","schema_version":"1.0","canonical_sha256":"cbaeb4e4ffe229c958b3a708449ce16136867ba37082421b6349d3671b050cd5","source":{"kind":"arxiv","id":"2311.03092","version":1},"attestation_state":"computed","paper":{"title":"We will DAG you","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Cachin, Ignacio Amores-Sesar","submitted_at":"2023-11-06T13:32:24Z","abstract_excerpt":"DAG-based protocols have been proposed as potential solutions to the latency and throughput limitations of traditional permissionless consensus protocols. However, their adoption has been hindered by security concerns and a lack of a solid foundation to guarantee improvements in both throughput and latency. In this paper, we present a construction that rigorously demonstrates how DAG-based protocols can achieve superior throughput and latency compared to chain-based consensus protocols, all while maintaining the same level of security guarantees."},"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":"2311.03092","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2023-11-06T13:32:24Z","cross_cats_sorted":[],"title_canon_sha256":"d177c36070d5b897a628949bad937da835beda433a62015ff0b345d3e521e34e","abstract_canon_sha256":"0af735d364001a9eecaee0b9957c56a9f175da3ba7b3d34d628ee317df72439f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:09:35.981973Z","signature_b64":"7AbPaJGB5u/Q+7p5pmthn7tWfQJc98TeZknV5f6AJFMZonWE31Fd6oYYh78dNGfWxhSsB0ohL1mBWUmB+CZEBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cbaeb4e4ffe229c958b3a708449ce16136867ba37082421b6349d3671b050cd5","last_reissued_at":"2026-07-05T07:09:35.981413Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:09:35.981413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"We will DAG you","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Cachin, Ignacio Amores-Sesar","submitted_at":"2023-11-06T13:32:24Z","abstract_excerpt":"DAG-based protocols have been proposed as potential solutions to the latency and throughput limitations of traditional permissionless consensus protocols. However, their adoption has been hindered by security concerns and a lack of a solid foundation to guarantee improvements in both throughput and latency. In this paper, we present a construction that rigorously demonstrates how DAG-based protocols can achieve superior throughput and latency compared to chain-based consensus protocols, all while maintaining the same level of security guarantees."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.03092","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/2311.03092/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":"2311.03092","created_at":"2026-07-05T07:09:35.981473+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.03092v1","created_at":"2026-07-05T07:09:35.981473+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.03092","created_at":"2026-07-05T07:09:35.981473+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZOXLJZH74IU4","created_at":"2026-07-05T07:09:35.981473+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZOXLJZH74IU4SWFT","created_at":"2026-07-05T07:09:35.981473+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZOXLJZH7","created_at":"2026-07-05T07:09:35.981473+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.04956","citing_title":"Bullshark on Narwhal: Implementation-level Workflow Analysis of Round-based DAG Consensus in Theory and Practice","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME","json":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME.json","graph_json":"https://pith.science/api/pith-number/ZOXLJZH74IU4SWFTU4EEJHHBME/graph.json","events_json":"https://pith.science/api/pith-number/ZOXLJZH74IU4SWFTU4EEJHHBME/events.json","paper":"https://pith.science/paper/ZOXLJZH7"},"agent_actions":{"view_html":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME","download_json":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME.json","view_paper":"https://pith.science/paper/ZOXLJZH7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.03092&json=true","fetch_graph":"https://pith.science/api/pith-number/ZOXLJZH74IU4SWFTU4EEJHHBME/graph.json","fetch_events":"https://pith.science/api/pith-number/ZOXLJZH74IU4SWFTU4EEJHHBME/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME/action/storage_attestation","attest_author":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME/action/author_attestation","sign_citation":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME/action/citation_signature","submit_replication":"https://pith.science/pith/ZOXLJZH74IU4SWFTU4EEJHHBME/action/replication_record"}},"created_at":"2026-07-05T07:09:35.981473+00:00","updated_at":"2026-07-05T07:09:35.981473+00:00"}