{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AX4O35YTSLUDQNFJCX3OJAVOH6","short_pith_number":"pith:AX4O35YT","schema_version":"1.0","canonical_sha256":"05f8edf71392e83834a915f6e482ae3fa01702ff36772c30b0178dd55fbbf92c","source":{"kind":"arxiv","id":"1510.07768","version":1},"attestation_state":"computed","paper":{"title":"Expanders via Local Edge Flips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.PR"],"primary_cat":"cs.DS","authors_text":"Aditya Bhaskara, Lorenzo Orecchia, Silvio Lattanzi, Vahab Mirrokni, Zeyuan Allen-Zhu","submitted_at":"2015-10-27T04:13:17Z","abstract_excerpt":"Designing distributed and scalable algorithms to improve network connectivity is a central topic in peer-to-peer networks. In this paper we focus on the following well-known problem: given an $n$-node $d$-regular network for $d=\\Omega(\\log n)$, we want to design a decentralized, local algorithm that transforms the graph into one that has good connectivity properties (low diameter, expansion, etc.) without affecting the sparsity of the graph. To this end, Mahlmann and Schindelhauer introduced the random \"flip\" transformation, where in each time step, a random pair of vertices that have an edge "},"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":"1510.07768","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-27T04:13:17Z","cross_cats_sorted":["cs.DC","cs.NI","math.PR"],"title_canon_sha256":"42f1d65b0f6e9f33cb1667aa0555e37f29476ec7d7d9547bc5eadbcf74173e67","abstract_canon_sha256":"8378de8ebd3b500d8de086a90d3779a31ed9d5a6eef7e743533fc3089ed4eb58"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:29:12.676333Z","signature_b64":"uRMLMwJJJrYvlEzdR1DBgdvsLAioSA9hCB0fbZhoQKyfhxqDtQfy3RwDftOk7eGXAKm61P8h3S84V+LHiMhLCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05f8edf71392e83834a915f6e482ae3fa01702ff36772c30b0178dd55fbbf92c","last_reissued_at":"2026-05-18T01:29:12.675763Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:29:12.675763Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Expanders via Local Edge Flips","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC","cs.NI","math.PR"],"primary_cat":"cs.DS","authors_text":"Aditya Bhaskara, Lorenzo Orecchia, Silvio Lattanzi, Vahab Mirrokni, Zeyuan Allen-Zhu","submitted_at":"2015-10-27T04:13:17Z","abstract_excerpt":"Designing distributed and scalable algorithms to improve network connectivity is a central topic in peer-to-peer networks. In this paper we focus on the following well-known problem: given an $n$-node $d$-regular network for $d=\\Omega(\\log n)$, we want to design a decentralized, local algorithm that transforms the graph into one that has good connectivity properties (low diameter, expansion, etc.) without affecting the sparsity of the graph. To this end, Mahlmann and Schindelhauer introduced the random \"flip\" transformation, where in each time step, a random pair of vertices that have an edge "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.07768","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":""},"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":"1510.07768","created_at":"2026-05-18T01:29:12.675849+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.07768v1","created_at":"2026-05-18T01:29:12.675849+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.07768","created_at":"2026-05-18T01:29:12.675849+00:00"},{"alias_kind":"pith_short_12","alias_value":"AX4O35YTSLUD","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AX4O35YTSLUDQNFJ","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AX4O35YT","created_at":"2026-05-18T12:29:10.953037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6","json":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6.json","graph_json":"https://pith.science/api/pith-number/AX4O35YTSLUDQNFJCX3OJAVOH6/graph.json","events_json":"https://pith.science/api/pith-number/AX4O35YTSLUDQNFJCX3OJAVOH6/events.json","paper":"https://pith.science/paper/AX4O35YT"},"agent_actions":{"view_html":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6","download_json":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6.json","view_paper":"https://pith.science/paper/AX4O35YT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.07768&json=true","fetch_graph":"https://pith.science/api/pith-number/AX4O35YTSLUDQNFJCX3OJAVOH6/graph.json","fetch_events":"https://pith.science/api/pith-number/AX4O35YTSLUDQNFJCX3OJAVOH6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6/action/storage_attestation","attest_author":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6/action/author_attestation","sign_citation":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6/action/citation_signature","submit_replication":"https://pith.science/pith/AX4O35YTSLUDQNFJCX3OJAVOH6/action/replication_record"}},"created_at":"2026-05-18T01:29:12.675849+00:00","updated_at":"2026-05-18T01:29:12.675849+00:00"}