{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:A3HWWVOH2ADDWQBZ6437YDFYI6","short_pith_number":"pith:A3HWWVOH","schema_version":"1.0","canonical_sha256":"06cf6b55c7d0063b4039f737fc0cb847bbe715f5eba1cf4e08e47b7aa3fc5ac5","source":{"kind":"arxiv","id":"2506.04368","version":2},"attestation_state":"computed","paper":{"title":"Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aayush Gupta, Gopal Pandurangan","submitted_at":"2025-06-04T18:30:47Z","abstract_excerpt":"We address a fundamental problem in Peer-to-Peer (P2P) networks, namely, constructing and maintaining dynamic P2P overlay network topologies with essential properties such as connectivity, low diameter, and high expansion, that are resilient to continuous high churn and the presence of a large number of malicious (Byzantine) nodes. Our main goal is to construct and maintain a sparse (bounded degree) expander topology despite high churn and a large number of Byzantine nodes. Such an expander topology has logarithmic diameter, high expansion, and is robust to churn and the presence of a large nu"},"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":"2506.04368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2025-06-04T18:30:47Z","cross_cats_sorted":[],"title_canon_sha256":"169e8d3e05cdf4b5d72ef8dd89ce0961c13360b158a353dca7bf05337d046e97","abstract_canon_sha256":"421638399f538cfe8a78d267c8cd2aa94bf98e7f049a72a068ec4b27306cd4f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:54:12.308293Z","signature_b64":"jtSB43uJyNKVCOf2YvSF9IedloJGNbmL2EFpGrF/VVtVVKQQMCeKTxBlTkKIMrZ5HTLqBPzTONBbETxuaPxNDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"06cf6b55c7d0063b4039f737fc0cb847bbe715f5eba1cf4e08e47b7aa3fc5ac5","last_reissued_at":"2026-07-05T11:54:12.307834Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:54:12.307834Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Aayush Gupta, Gopal Pandurangan","submitted_at":"2025-06-04T18:30:47Z","abstract_excerpt":"We address a fundamental problem in Peer-to-Peer (P2P) networks, namely, constructing and maintaining dynamic P2P overlay network topologies with essential properties such as connectivity, low diameter, and high expansion, that are resilient to continuous high churn and the presence of a large number of malicious (Byzantine) nodes. Our main goal is to construct and maintain a sparse (bounded degree) expander topology despite high churn and a large number of Byzantine nodes. Such an expander topology has logarithmic diameter, high expansion, and is robust to churn and the presence of a large nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2506.04368","kind":"arxiv","version":2},"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/2506.04368/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":"2506.04368","created_at":"2026-07-05T11:54:12.307894+00:00"},{"alias_kind":"arxiv_version","alias_value":"2506.04368v2","created_at":"2026-07-05T11:54:12.307894+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2506.04368","created_at":"2026-07-05T11:54:12.307894+00:00"},{"alias_kind":"pith_short_12","alias_value":"A3HWWVOH2ADD","created_at":"2026-07-05T11:54:12.307894+00:00"},{"alias_kind":"pith_short_16","alias_value":"A3HWWVOH2ADDWQBZ","created_at":"2026-07-05T11:54:12.307894+00:00"},{"alias_kind":"pith_short_8","alias_value":"A3HWWVOH","created_at":"2026-07-05T11:54:12.307894+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2608.03156","citing_title":"Trust-Aware Topology Learning for Dynamic Decentralized Federated Learning under Adversaries","ref_index":32,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6","json":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6.json","graph_json":"https://pith.science/api/pith-number/A3HWWVOH2ADDWQBZ6437YDFYI6/graph.json","events_json":"https://pith.science/api/pith-number/A3HWWVOH2ADDWQBZ6437YDFYI6/events.json","paper":"https://pith.science/paper/A3HWWVOH"},"agent_actions":{"view_html":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6","download_json":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6.json","view_paper":"https://pith.science/paper/A3HWWVOH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2506.04368&json=true","fetch_graph":"https://pith.science/api/pith-number/A3HWWVOH2ADDWQBZ6437YDFYI6/graph.json","fetch_events":"https://pith.science/api/pith-number/A3HWWVOH2ADDWQBZ6437YDFYI6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6/action/storage_attestation","attest_author":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6/action/author_attestation","sign_citation":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6/action/citation_signature","submit_replication":"https://pith.science/pith/A3HWWVOH2ADDWQBZ6437YDFYI6/action/replication_record"}},"created_at":"2026-07-05T11:54:12.307894+00:00","updated_at":"2026-07-05T11:54:12.307894+00:00"}