{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:3AHR6DJSHTCOVYB2FPWDEYOVMN","short_pith_number":"pith:3AHR6DJS","canonical_record":{"source":{"id":"2505.17891","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T13:41:39Z","cross_cats_sorted":[],"title_canon_sha256":"5d4adc8e65298db50ebdf3119cf5a4df0f20cea34842c09bcd187111eac354b9","abstract_canon_sha256":"e76348a4a06303c2418c003df8c30432738d763065b113406eb52789ae31e1e1"},"schema_version":"1.0"},"canonical_sha256":"d80f1f0d323cc4eae03a2bec3261d5634a5eaf3cc4da0e3b97613ea0f06bd0f4","source":{"kind":"arxiv","id":"2505.17891","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17891","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17891v1","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17891","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"3AHR6DJSHTCO","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_16","alias_value":"3AHR6DJSHTCOVYB2","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_8","alias_value":"3AHR6DJS","created_at":"2026-07-05T11:08:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:3AHR6DJSHTCOVYB2FPWDEYOVMN","target":"record","payload":{"canonical_record":{"source":{"id":"2505.17891","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T13:41:39Z","cross_cats_sorted":[],"title_canon_sha256":"5d4adc8e65298db50ebdf3119cf5a4df0f20cea34842c09bcd187111eac354b9","abstract_canon_sha256":"e76348a4a06303c2418c003df8c30432738d763065b113406eb52789ae31e1e1"},"schema_version":"1.0"},"canonical_sha256":"d80f1f0d323cc4eae03a2bec3261d5634a5eaf3cc4da0e3b97613ea0f06bd0f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:08:33.404021Z","signature_b64":"Tl27GwHmmYuMRoFIXsRxDPGJ4ySCJaqZyyOstlvnqxJcqAVH1sOnglEWITBnAedFl/Ptp6SXPHI48B4A3i+CCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d80f1f0d323cc4eae03a2bec3261d5634a5eaf3cc4da0e3b97613ea0f06bd0f4","last_reissued_at":"2026-07-05T11:08:33.403583Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:08:33.403583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2505.17891","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-07-05T11:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HfkIjJVmKEHVqRezvPXBTvyuRPYhYMu5Yhe90pn6Ca4aQxNa5kSgBKXH357ytsPlOKNCiUKiOA08uA+fmJ2WBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:39:31.341866Z"},"content_sha256":"37395d332152226c471820e6f663859e98032f29fe64623e5327bae118e74d33","schema_version":"1.0","event_id":"sha256:37395d332152226c471820e6f663859e98032f29fe64623e5327bae118e74d33"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:3AHR6DJSHTCOVYB2FPWDEYOVMN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"DAG-based Consensus with Asymmetric Trust [Extended Version]","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christian Cachin, Ignacio Amores-Sesar, Juan Villacis, Luca Zanolini","submitted_at":"2025-05-23T13:41:39Z","abstract_excerpt":"In protocols with asymmetric trust, each participant is free to make its own individual trust assumptions about others, captured by an asymmetric quorum system. This contrasts with ordinary, symmetric quorum systems and with threshold models, where all participants share the same trust assumption. It is already known how to realize reliable broadcasts, shared-memory emulations, and binary consensus with asymmetric quorums. In this work, we introduce Directed Acyclic Graph (DAG)-based consensus protocols with asymmetric trust. To achieve this, we extend the key building-blocks of the well-known"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17891","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/2505.17891/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-07-05T11:08:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PEP1ziNhmHl9g1BM063u3fAcIuyAPAqYIALx7aM/D1001S1KrRJM5yGTGWVri2E8XtWeYlqG9lbYiZN/KiE6Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-08T23:39:31.342495Z"},"content_sha256":"8dba905a3afa23bc904117fdad45be9e9708fa1e8db05bf9159ddd77b18ee339","schema_version":"1.0","event_id":"sha256:8dba905a3afa23bc904117fdad45be9e9708fa1e8db05bf9159ddd77b18ee339"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3AHR6DJSHTCOVYB2FPWDEYOVMN/bundle.json","state_url":"https://pith.science/pith/3AHR6DJSHTCOVYB2FPWDEYOVMN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3AHR6DJSHTCOVYB2FPWDEYOVMN/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-08-08T23:39:31Z","links":{"resolver":"https://pith.science/pith/3AHR6DJSHTCOVYB2FPWDEYOVMN","bundle":"https://pith.science/pith/3AHR6DJSHTCOVYB2FPWDEYOVMN/bundle.json","state":"https://pith.science/pith/3AHR6DJSHTCOVYB2FPWDEYOVMN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3AHR6DJSHTCOVYB2FPWDEYOVMN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:3AHR6DJSHTCOVYB2FPWDEYOVMN","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":"e76348a4a06303c2418c003df8c30432738d763065b113406eb52789ae31e1e1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T13:41:39Z","title_canon_sha256":"5d4adc8e65298db50ebdf3119cf5a4df0f20cea34842c09bcd187111eac354b9"},"schema_version":"1.0","source":{"id":"2505.17891","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2505.17891","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"arxiv_version","alias_value":"2505.17891v1","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.17891","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_12","alias_value":"3AHR6DJSHTCO","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_16","alias_value":"3AHR6DJSHTCOVYB2","created_at":"2026-07-05T11:08:33Z"},{"alias_kind":"pith_short_8","alias_value":"3AHR6DJS","created_at":"2026-07-05T11:08:33Z"}],"graph_snapshots":[{"event_id":"sha256:8dba905a3afa23bc904117fdad45be9e9708fa1e8db05bf9159ddd77b18ee339","target":"graph","created_at":"2026-07-05T11:08:33Z","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/2505.17891/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"In protocols with asymmetric trust, each participant is free to make its own individual trust assumptions about others, captured by an asymmetric quorum system. This contrasts with ordinary, symmetric quorum systems and with threshold models, where all participants share the same trust assumption. It is already known how to realize reliable broadcasts, shared-memory emulations, and binary consensus with asymmetric quorums. In this work, we introduce Directed Acyclic Graph (DAG)-based consensus protocols with asymmetric trust. To achieve this, we extend the key building-blocks of the well-known","authors_text":"Christian Cachin, Ignacio Amores-Sesar, Juan Villacis, Luca Zanolini","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T13:41:39Z","title":"DAG-based Consensus with Asymmetric Trust [Extended Version]"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.17891","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:37395d332152226c471820e6f663859e98032f29fe64623e5327bae118e74d33","target":"record","created_at":"2026-07-05T11:08:33Z","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":"e76348a4a06303c2418c003df8c30432738d763065b113406eb52789ae31e1e1","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DC","submitted_at":"2025-05-23T13:41:39Z","title_canon_sha256":"5d4adc8e65298db50ebdf3119cf5a4df0f20cea34842c09bcd187111eac354b9"},"schema_version":"1.0","source":{"id":"2505.17891","kind":"arxiv","version":1}},"canonical_sha256":"d80f1f0d323cc4eae03a2bec3261d5634a5eaf3cc4da0e3b97613ea0f06bd0f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d80f1f0d323cc4eae03a2bec3261d5634a5eaf3cc4da0e3b97613ea0f06bd0f4","first_computed_at":"2026-07-05T11:08:33.403583Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:08:33.403583Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Tl27GwHmmYuMRoFIXsRxDPGJ4ySCJaqZyyOstlvnqxJcqAVH1sOnglEWITBnAedFl/Ptp6SXPHI48B4A3i+CCg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:08:33.404021Z","signed_message":"canonical_sha256_bytes"},"source_id":"2505.17891","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:37395d332152226c471820e6f663859e98032f29fe64623e5327bae118e74d33","sha256:8dba905a3afa23bc904117fdad45be9e9708fa1e8db05bf9159ddd77b18ee339"],"state_sha256":"49b7d89f8be78ea539dac822cfdee648299fbc295abb329d860e5092f50a82ea"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"O+iIXeGzG68T90RsmOG1/E9EyClzhtZQPl3YKClH5n7ZbOS5wHcyTA/ps0iqo4GuT389hI6h/xHm2qEb1pzjCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-08T23:39:31.348314Z","bundle_sha256":"3bbc4bc43971f871ecfe827756d74c9c658885a18ae4ba9132c16a24a0be57cc"}}