{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:BOSNWFGXMLBVFVE6KZH7DR45BZ","short_pith_number":"pith:BOSNWFGX","schema_version":"1.0","canonical_sha256":"0ba4db14d762c352d49e564ff1c79d0e6f0b0d19c83bc7ae5e790573cfd50c92","source":{"kind":"arxiv","id":"2507.00824","version":1},"attestation_state":"computed","paper":{"title":"PANDAS: Peer-to-peer, Adaptive Networking for Data Availability Sampling within Ethereum Consensus Timebounds","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NI","cs.PF"],"primary_cat":"cs.DC","authors_text":"Etienne Rivi\\`ere, Felix Lange, Kaleem Peeroo, Matthieu Pigaglio, Micha{\\l} Kr\\'ol, Onur Ascigil, Ramin Sadre, Sergi Rene, Vladimir Stankovic","submitted_at":"2025-07-01T14:56:37Z","abstract_excerpt":"Layer-2 protocols can assist Ethereum's limited throughput, but globally broadcasting layer-2 data limits their scalability. The Danksharding evolution of Ethereum aims to support the selective distribution of layer-2 data, whose availability in the network is verified using randomized data availability sampling (DAS). Integrating DAS into Ethereum's consensus process is challenging, as pieces of layer-2 data must be disseminated and sampled within four seconds of the beginning of each consensus slot. No existing solution can support dissemination and sampling under such strict time bounds.\n  "},"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":"2507.00824","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2025-07-01T14:56:37Z","cross_cats_sorted":["cs.NI","cs.PF"],"title_canon_sha256":"cf7d30915fe401e83f7577d3ce82cb6bbdd3fad1022360ec52ef064116d3d4b4","abstract_canon_sha256":"ff358f277693e5f83f7b932a2e3a49f73eb75ded5eb6c802aa210a2fa29fc739"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:30:15.197275Z","signature_b64":"0Y7Q3nTKUJ+V39K21PHSC5ZC/pvT7lvp4ZfmFu8g0CsiRw7Ngo/Yg9TlqPu2Uxkp+Zqykf8D2ROnA8fjdmXZDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ba4db14d762c352d49e564ff1c79d0e6f0b0d19c83bc7ae5e790573cfd50c92","last_reissued_at":"2026-07-05T11:30:15.196698Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:30:15.196698Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"PANDAS: Peer-to-peer, Adaptive Networking for Data Availability Sampling within Ethereum Consensus Timebounds","license":"http://creativecommons.org/licenses/by-sa/4.0/","headline":"","cross_cats":["cs.NI","cs.PF"],"primary_cat":"cs.DC","authors_text":"Etienne Rivi\\`ere, Felix Lange, Kaleem Peeroo, Matthieu Pigaglio, Micha{\\l} Kr\\'ol, Onur Ascigil, Ramin Sadre, Sergi Rene, Vladimir Stankovic","submitted_at":"2025-07-01T14:56:37Z","abstract_excerpt":"Layer-2 protocols can assist Ethereum's limited throughput, but globally broadcasting layer-2 data limits their scalability. The Danksharding evolution of Ethereum aims to support the selective distribution of layer-2 data, whose availability in the network is verified using randomized data availability sampling (DAS). Integrating DAS into Ethereum's consensus process is challenging, as pieces of layer-2 data must be disseminated and sampled within four seconds of the beginning of each consensus slot. No existing solution can support dissemination and sampling under such strict time bounds.\n  "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.00824","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/2507.00824/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":"2507.00824","created_at":"2026-07-05T11:30:15.196774+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.00824v1","created_at":"2026-07-05T11:30:15.196774+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.00824","created_at":"2026-07-05T11:30:15.196774+00:00"},{"alias_kind":"pith_short_12","alias_value":"BOSNWFGXMLBV","created_at":"2026-07-05T11:30:15.196774+00:00"},{"alias_kind":"pith_short_16","alias_value":"BOSNWFGXMLBVFVE6","created_at":"2026-07-05T11:30:15.196774+00:00"},{"alias_kind":"pith_short_8","alias_value":"BOSNWFGX","created_at":"2026-07-05T11:30:15.196774+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.16559","citing_title":"Polynomial Multiproofs for Scalable Data Availability Sampling in Blockchain Light Clients","ref_index":8,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ","json":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ.json","graph_json":"https://pith.science/api/pith-number/BOSNWFGXMLBVFVE6KZH7DR45BZ/graph.json","events_json":"https://pith.science/api/pith-number/BOSNWFGXMLBVFVE6KZH7DR45BZ/events.json","paper":"https://pith.science/paper/BOSNWFGX"},"agent_actions":{"view_html":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ","download_json":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ.json","view_paper":"https://pith.science/paper/BOSNWFGX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.00824&json=true","fetch_graph":"https://pith.science/api/pith-number/BOSNWFGXMLBVFVE6KZH7DR45BZ/graph.json","fetch_events":"https://pith.science/api/pith-number/BOSNWFGXMLBVFVE6KZH7DR45BZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ/action/storage_attestation","attest_author":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ/action/author_attestation","sign_citation":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ/action/citation_signature","submit_replication":"https://pith.science/pith/BOSNWFGXMLBVFVE6KZH7DR45BZ/action/replication_record"}},"created_at":"2026-07-05T11:30:15.196774+00:00","updated_at":"2026-07-05T11:30:15.196774+00:00"}