{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:RASEEDNEP5DNJ2S6CBWNMIWE4B","short_pith_number":"pith:RASEEDNE","schema_version":"1.0","canonical_sha256":"8824420da47f46d4ea5e106cd622c4e0637195ec0506678dc373026af7d5ba2f","source":{"kind":"arxiv","id":"2505.13751","version":3},"attestation_state":"computed","paper":{"title":"Multiple Proposer Transaction Fee Mechanism Design: Robust Incentives Against Censorship and Bribery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.GT","authors_text":"Aikaterini-Panagiota Stouka, Julian Ma, Thomas Thiery","submitted_at":"2025-05-19T21:53:58Z","abstract_excerpt":"Transaction Fee Mechanism (TFM) design in blockchain protocols has gained significant attention following the pioneering work of Roughgarden [EC' 21], which established a formal framework for analyzing user and block proposer incentives under various Transaction Fee Mechanisms, including Ethereum's current fee mechanism EIP-1559. However, the original TFM framework and follow-up TFM works overlook the critical challenge of censorship resistance-specifically in the presence of an external malicious actor who is willing to bribe the proposer to censor a transaction. In this paper, we extend the "},"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":"2505.13751","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2025-05-19T21:53:58Z","cross_cats_sorted":["cs.CR"],"title_canon_sha256":"3af0ac48d360ee8fe00c9547b246c02f8691cb606ca21696e456ae163b7f4512","abstract_canon_sha256":"50608abb17f3878b9de1214493fb50734d7891a3160d5e5ba1eef89ca5821ef7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:04:06.029585Z","signature_b64":"GqqzDG5X6jELN7b21YX8LpS28xAhLhuNVKjxuYYwDlde28/wo6cpzAYWzxX12fKirv/liO9ZHjyx2671mfnHAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8824420da47f46d4ea5e106cd622c4e0637195ec0506678dc373026af7d5ba2f","last_reissued_at":"2026-06-02T02:04:06.029116Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:04:06.029116Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Multiple Proposer Transaction Fee Mechanism Design: Robust Incentives Against Censorship and Bribery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CR"],"primary_cat":"cs.GT","authors_text":"Aikaterini-Panagiota Stouka, Julian Ma, Thomas Thiery","submitted_at":"2025-05-19T21:53:58Z","abstract_excerpt":"Transaction Fee Mechanism (TFM) design in blockchain protocols has gained significant attention following the pioneering work of Roughgarden [EC' 21], which established a formal framework for analyzing user and block proposer incentives under various Transaction Fee Mechanisms, including Ethereum's current fee mechanism EIP-1559. However, the original TFM framework and follow-up TFM works overlook the critical challenge of censorship resistance-specifically in the presence of an external malicious actor who is willing to bribe the proposer to censor a transaction. In this paper, we extend the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.13751","kind":"arxiv","version":3},"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.13751/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":"2505.13751","created_at":"2026-06-02T02:04:06.029169+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.13751v3","created_at":"2026-06-02T02:04:06.029169+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.13751","created_at":"2026-06-02T02:04:06.029169+00:00"},{"alias_kind":"pith_short_12","alias_value":"RASEEDNEP5DN","created_at":"2026-06-02T02:04:06.029169+00:00"},{"alias_kind":"pith_short_16","alias_value":"RASEEDNEP5DNJ2S6","created_at":"2026-06-02T02:04:06.029169+00:00"},{"alias_kind":"pith_short_8","alias_value":"RASEEDNE","created_at":"2026-06-02T02:04:06.029169+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2605.23677","citing_title":"AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees","ref_index":48,"is_internal_anchor":true},{"citing_arxiv_id":"2510.02947","citing_title":"SoK: Preconfirmations","ref_index":93,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B","json":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B.json","graph_json":"https://pith.science/api/pith-number/RASEEDNEP5DNJ2S6CBWNMIWE4B/graph.json","events_json":"https://pith.science/api/pith-number/RASEEDNEP5DNJ2S6CBWNMIWE4B/events.json","paper":"https://pith.science/paper/RASEEDNE"},"agent_actions":{"view_html":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B","download_json":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B.json","view_paper":"https://pith.science/paper/RASEEDNE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.13751&json=true","fetch_graph":"https://pith.science/api/pith-number/RASEEDNEP5DNJ2S6CBWNMIWE4B/graph.json","fetch_events":"https://pith.science/api/pith-number/RASEEDNEP5DNJ2S6CBWNMIWE4B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B/action/storage_attestation","attest_author":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B/action/author_attestation","sign_citation":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B/action/citation_signature","submit_replication":"https://pith.science/pith/RASEEDNEP5DNJ2S6CBWNMIWE4B/action/replication_record"}},"created_at":"2026-06-02T02:04:06.029169+00:00","updated_at":"2026-06-02T02:04:06.029169+00:00"}