{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:KUTSLHMCU5KFASL4C7JQ3WJ5ZR","short_pith_number":"pith:KUTSLHMC","schema_version":"1.0","canonical_sha256":"5527259d82a75450497c17d30dd93dcc4e3415ea7905806b7d74472953ad9ab0","source":{"kind":"arxiv","id":"2208.00940","version":4},"attestation_state":"computed","paper":{"title":"Maximal Extractable Value (MEV) Protection on a DAG","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Dahlia Malkhi, Pawel Szalachowski","submitted_at":"2022-08-01T15:40:17Z","abstract_excerpt":"Many cryptocurrency platforms are vulnerable to Maximal Extractable Value (MEV) attacks, where a malicious consensus leader can inject transactions or change the order of user transactions to maximize its profit. A promising line of research in MEV mitigation is to enhance the Byzantine fault tolerance (BFT) consensus core of blockchains by new functionalities, like hiding transaction contents, such that malicious parties cannot analyze and exploit them until they are ordered. An orthogonal line of research demonstrates excellent performance for BFT protocols designed around Directed Acyclic G"},"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":"2208.00940","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CR","submitted_at":"2022-08-01T15:40:17Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"dd0a967a85360daafbbdb92bd6931fc929ddb1a1061ebd6d7912b91600db9deb","abstract_canon_sha256":"d6f0a9e731f243e346657b8ebafa8d333996f113e64aacd5c2dea2993e5962d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:27:48.643372Z","signature_b64":"ZiHJC0IuMnl3wLhH059ka1wlYMiJwEEWbeqZNQSTbiACus2OkraIq92HTF1DLe3d3HCJohtozY5djQnwOIuJDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5527259d82a75450497c17d30dd93dcc4e3415ea7905806b7d74472953ad9ab0","last_reissued_at":"2026-07-05T05:27:48.642952Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:27:48.642952Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maximal Extractable Value (MEV) Protection on a DAG","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.CR","authors_text":"Dahlia Malkhi, Pawel Szalachowski","submitted_at":"2022-08-01T15:40:17Z","abstract_excerpt":"Many cryptocurrency platforms are vulnerable to Maximal Extractable Value (MEV) attacks, where a malicious consensus leader can inject transactions or change the order of user transactions to maximize its profit. A promising line of research in MEV mitigation is to enhance the Byzantine fault tolerance (BFT) consensus core of blockchains by new functionalities, like hiding transaction contents, such that malicious parties cannot analyze and exploit them until they are ordered. An orthogonal line of research demonstrates excellent performance for BFT protocols designed around Directed Acyclic G"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2208.00940","kind":"arxiv","version":4},"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/2208.00940/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":"2208.00940","created_at":"2026-07-05T05:27:48.642995+00:00"},{"alias_kind":"arxiv_version","alias_value":"2208.00940v4","created_at":"2026-07-05T05:27:48.642995+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2208.00940","created_at":"2026-07-05T05:27:48.642995+00:00"},{"alias_kind":"pith_short_12","alias_value":"KUTSLHMCU5KF","created_at":"2026-07-05T05:27:48.642995+00:00"},{"alias_kind":"pith_short_16","alias_value":"KUTSLHMCU5KFASL4","created_at":"2026-07-05T05:27:48.642995+00:00"},{"alias_kind":"pith_short_8","alias_value":"KUTSLHMC","created_at":"2026-07-05T05:27:48.642995+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.27250","citing_title":"Tilikum: Transaction Fair Ordering on a DAG without Weak Edges","ref_index":40,"is_internal_anchor":false},{"citing_arxiv_id":"2605.23432","citing_title":"Multi-Round Visibility: A Post-Consensus Ordering Layer for DAG-Based BFT","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR","json":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR.json","graph_json":"https://pith.science/api/pith-number/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/graph.json","events_json":"https://pith.science/api/pith-number/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/events.json","paper":"https://pith.science/paper/KUTSLHMC"},"agent_actions":{"view_html":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR","download_json":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR.json","view_paper":"https://pith.science/paper/KUTSLHMC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2208.00940&json=true","fetch_graph":"https://pith.science/api/pith-number/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/graph.json","fetch_events":"https://pith.science/api/pith-number/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/action/storage_attestation","attest_author":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/action/author_attestation","sign_citation":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/action/citation_signature","submit_replication":"https://pith.science/pith/KUTSLHMCU5KFASL4C7JQ3WJ5ZR/action/replication_record"}},"created_at":"2026-07-05T05:27:48.642995+00:00","updated_at":"2026-07-05T05:27:48.642995+00:00"}