{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:G4SLVPJEOYYKJ5OTBFEPY6G2QX","short_pith_number":"pith:G4SLVPJE","schema_version":"1.0","canonical_sha256":"3724babd247630a4f5d30948fc78da85ceb53cbdac117c6ec9effee4427da742","source":{"kind":"arxiv","id":"1905.10284","version":1},"attestation_state":"computed","paper":{"title":"Hardness of Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ami Paz, Dean Leitersdorf, Keren Censor-Hillel, Michal Dory, Nir Bachrach, Yuval Efron","submitted_at":"2019-05-24T15:24:23Z","abstract_excerpt":"This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\\tilde{\\Omega}(n^2)$ lower bounds for cornerstone problems, such as minimum dominating set (MDS), Hamiltonian path, Steiner tree and max-cut. These are almost tight, since all of these problems can be solved optimally in $O(n^2)$ rounds. Moreover, we show that even in bounded-degree graphs and even in simple graphs with maximum degree 5 and logarithmic diameter, it holds that various tasks, such as finding a maximum in"},"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":"1905.10284","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-24T15:24:23Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"03a15a7aca8af49912349a1c42fff4631514fd8d90f67e874ba612846aad1c64","abstract_canon_sha256":"25579a23b64013063889d4096365f21b39a0eb5b3fb2584a18412177940da003"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:10.712196Z","signature_b64":"K3M9TM7jhuH28caOL5VdloDqvmM3VbhTr0qnTUReS6ZRtW+IWoEfOg7I5dXw6PQFwWtfNGpCYSVblbLGz3PgAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3724babd247630a4f5d30948fc78da85ceb53cbdac117c6ec9effee4427da742","last_reissued_at":"2026-05-17T23:45:10.711464Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:10.711464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hardness of Distributed Optimization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Ami Paz, Dean Leitersdorf, Keren Censor-Hillel, Michal Dory, Nir Bachrach, Yuval Efron","submitted_at":"2019-05-24T15:24:23Z","abstract_excerpt":"This paper studies lower bounds for fundamental optimization problems in the CONGEST model. We show that solving problems exactly in this model can be a hard task, by providing $\\tilde{\\Omega}(n^2)$ lower bounds for cornerstone problems, such as minimum dominating set (MDS), Hamiltonian path, Steiner tree and max-cut. These are almost tight, since all of these problems can be solved optimally in $O(n^2)$ rounds. Moreover, we show that even in bounded-degree graphs and even in simple graphs with maximum degree 5 and logarithmic diameter, it holds that various tasks, such as finding a maximum in"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10284","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":"1905.10284","created_at":"2026-05-17T23:45:10.711573+00:00"},{"alias_kind":"arxiv_version","alias_value":"1905.10284v1","created_at":"2026-05-17T23:45:10.711573+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10284","created_at":"2026-05-17T23:45:10.711573+00:00"},{"alias_kind":"pith_short_12","alias_value":"G4SLVPJEOYYK","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"G4SLVPJEOYYKJ5OT","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"G4SLVPJE","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/G4SLVPJEOYYKJ5OTBFEPY6G2QX","json":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX.json","graph_json":"https://pith.science/api/pith-number/G4SLVPJEOYYKJ5OTBFEPY6G2QX/graph.json","events_json":"https://pith.science/api/pith-number/G4SLVPJEOYYKJ5OTBFEPY6G2QX/events.json","paper":"https://pith.science/paper/G4SLVPJE"},"agent_actions":{"view_html":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX","download_json":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX.json","view_paper":"https://pith.science/paper/G4SLVPJE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1905.10284&json=true","fetch_graph":"https://pith.science/api/pith-number/G4SLVPJEOYYKJ5OTBFEPY6G2QX/graph.json","fetch_events":"https://pith.science/api/pith-number/G4SLVPJEOYYKJ5OTBFEPY6G2QX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/action/storage_attestation","attest_author":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/action/author_attestation","sign_citation":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/action/citation_signature","submit_replication":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/action/replication_record"}},"created_at":"2026-05-17T23:45:10.711573+00:00","updated_at":"2026-05-17T23:45:10.711573+00:00"}