{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GRUEPBGZTHT67E7TXREMOD5D4W","short_pith_number":"pith:GRUEPBGZ","schema_version":"1.0","canonical_sha256":"34684784d999e7ef93f3bc48c70fa3e5971c8e90e7f339e472f1f7dfbfd5d6e0","source":{"kind":"arxiv","id":"1904.04341","version":1},"attestation_state":"computed","paper":{"title":"Distributed Edge Connectivity in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Mohit Daga, Monika Henzinger, Thatchaphol Saranurak","submitted_at":"2019-04-08T20:23:20Z","abstract_excerpt":"We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\\tilde O(n^{1-1/353}D^{1/353}+n^{1-1/706})$ time to compute $\\lambda$ and a cut of cardinality $\\lambda$ with high probability, where $n$ and $D$ are the number of nodes and the diameter of the network, respectively, and $\\tilde O$ hides polylogarithmic factors. This running time is sublinear in $n$ (i.e. $\\tilde O(n^{1-\\epsilon})$) whenever $D$ is. Previous sublinear-time d"},"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":"1904.04341","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-04-08T20:23:20Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"4be18a5f1be6a5fcd2aa7223ebd71021d7a5f569066499216fe18de832b19298","abstract_canon_sha256":"94dab72a0590dcd377671db1020b6f81ee96254610b40bbd343b7fe1f0f53dfd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:59.236311Z","signature_b64":"tu/AZ6Da/7m6f57LG05sYAcm5gd13NYBeEkfr7zlFrbBkpLHzYdtq4OXxC5DvhyhA4TocL8D49bL7soh4qEHDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34684784d999e7ef93f3bc48c70fa3e5971c8e90e7f339e472f1f7dfbfd5d6e0","last_reissued_at":"2026-05-17T23:48:59.235720Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:59.235720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Edge Connectivity in Sublinear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Danupon Nanongkai, Mohit Daga, Monika Henzinger, Thatchaphol Saranurak","submitted_at":"2019-04-08T20:23:20Z","abstract_excerpt":"We present the first sublinear-time algorithm for a distributed message-passing network sto compute its edge connectivity $\\lambda$ exactly in the CONGEST model, as long as there are no parallel edges. Our algorithm takes $\\tilde O(n^{1-1/353}D^{1/353}+n^{1-1/706})$ time to compute $\\lambda$ and a cut of cardinality $\\lambda$ with high probability, where $n$ and $D$ are the number of nodes and the diameter of the network, respectively, and $\\tilde O$ hides polylogarithmic factors. This running time is sublinear in $n$ (i.e. $\\tilde O(n^{1-\\epsilon})$) whenever $D$ is. Previous sublinear-time d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.04341","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":"1904.04341","created_at":"2026-05-17T23:48:59.235850+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.04341v1","created_at":"2026-05-17T23:48:59.235850+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.04341","created_at":"2026-05-17T23:48:59.235850+00:00"},{"alias_kind":"pith_short_12","alias_value":"GRUEPBGZTHT6","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GRUEPBGZTHT67E7T","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GRUEPBGZ","created_at":"2026-05-18T12:33:18.533446+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/GRUEPBGZTHT67E7TXREMOD5D4W","json":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W.json","graph_json":"https://pith.science/api/pith-number/GRUEPBGZTHT67E7TXREMOD5D4W/graph.json","events_json":"https://pith.science/api/pith-number/GRUEPBGZTHT67E7TXREMOD5D4W/events.json","paper":"https://pith.science/paper/GRUEPBGZ"},"agent_actions":{"view_html":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W","download_json":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W.json","view_paper":"https://pith.science/paper/GRUEPBGZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.04341&json=true","fetch_graph":"https://pith.science/api/pith-number/GRUEPBGZTHT67E7TXREMOD5D4W/graph.json","fetch_events":"https://pith.science/api/pith-number/GRUEPBGZTHT67E7TXREMOD5D4W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W/action/storage_attestation","attest_author":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W/action/author_attestation","sign_citation":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W/action/citation_signature","submit_replication":"https://pith.science/pith/GRUEPBGZTHT67E7TXREMOD5D4W/action/replication_record"}},"created_at":"2026-05-17T23:48:59.235850+00:00","updated_at":"2026-05-17T23:48:59.235850+00:00"}