{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:G4SLVPJEOYYKJ5OTBFEPY6G2QX","short_pith_number":"pith:G4SLVPJE","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"},"canonical_sha256":"3724babd247630a4f5d30948fc78da85ceb53cbdac117c6ec9effee4427da742","source":{"kind":"arxiv","id":"1905.10284","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10284","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10284v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10284","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4SLVPJEOYYK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G4SLVPJEOYYKJ5OT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G4SLVPJE","created_at":"2026-05-18T12:33:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:G4SLVPJEOYYKJ5OTBFEPY6G2QX","target":"record","payload":{"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"},"canonical_sha256":"3724babd247630a4f5d30948fc78da85ceb53cbdac117c6ec9effee4427da742","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"},"source_kind":"arxiv","source_id":"1905.10284","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"InwwEErXYntGc6nbuWzZ86f5AIrXNpf9zYVL1S2SJUafDaes2w1CuKdgt8B69mFk5hdB4E8AuDuo0/ReQY7HBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:32.761733Z"},"content_sha256":"5da191b81642dd33492bcf68e24f7421761ef0209aa899da9d7482fd1558be52","schema_version":"1.0","event_id":"sha256:5da191b81642dd33492bcf68e24f7421761ef0209aa899da9d7482fd1558be52"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:G4SLVPJEOYYKJ5OTBFEPY6G2QX","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:45:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z/4ZyqaaZt0STIgW80h6Jvzx7WYR2FCmqKroyplTxRb+RqrZXDIFQe9qQWI9T7ZvH39l4+MQF6vVSUaGoFFSCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:09:32.762394Z"},"content_sha256":"096883695e67846470f25262642399ff7800c376fbbdeaa9af0f19018a79c138","schema_version":"1.0","event_id":"sha256:096883695e67846470f25262642399ff7800c376fbbdeaa9af0f19018a79c138"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/bundle.json","state_url":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-31T20:09:32Z","links":{"resolver":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX","bundle":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/bundle.json","state":"https://pith.science/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/G4SLVPJEOYYKJ5OTBFEPY6G2QX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:G4SLVPJEOYYKJ5OTBFEPY6G2QX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"25579a23b64013063889d4096365f21b39a0eb5b3fb2584a18412177940da003","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-24T15:24:23Z","title_canon_sha256":"03a15a7aca8af49912349a1c42fff4631514fd8d90f67e874ba612846aad1c64"},"schema_version":"1.0","source":{"id":"1905.10284","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.10284","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"arxiv_version","alias_value":"1905.10284v1","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.10284","created_at":"2026-05-17T23:45:10Z"},{"alias_kind":"pith_short_12","alias_value":"G4SLVPJEOYYK","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_16","alias_value":"G4SLVPJEOYYKJ5OT","created_at":"2026-05-18T12:33:18Z"},{"alias_kind":"pith_short_8","alias_value":"G4SLVPJE","created_at":"2026-05-18T12:33:18Z"}],"graph_snapshots":[{"event_id":"sha256:096883695e67846470f25262642399ff7800c376fbbdeaa9af0f19018a79c138","target":"graph","created_at":"2026-05-17T23:45:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Ami Paz, Dean Leitersdorf, Keren Censor-Hillel, Michal Dory, Nir Bachrach, Yuval Efron","cross_cats":["cs.DC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-24T15:24:23Z","title":"Hardness of Distributed Optimization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.10284","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:5da191b81642dd33492bcf68e24f7421761ef0209aa899da9d7482fd1558be52","target":"record","created_at":"2026-05-17T23:45:10Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"25579a23b64013063889d4096365f21b39a0eb5b3fb2584a18412177940da003","cross_cats_sorted":["cs.DC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-05-24T15:24:23Z","title_canon_sha256":"03a15a7aca8af49912349a1c42fff4631514fd8d90f67e874ba612846aad1c64"},"schema_version":"1.0","source":{"id":"1905.10284","kind":"arxiv","version":1}},"canonical_sha256":"3724babd247630a4f5d30948fc78da85ceb53cbdac117c6ec9effee4427da742","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3724babd247630a4f5d30948fc78da85ceb53cbdac117c6ec9effee4427da742","first_computed_at":"2026-05-17T23:45:10.711464Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:10.711464Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K3M9TM7jhuH28caOL5VdloDqvmM3VbhTr0qnTUReS6ZRtW+IWoEfOg7I5dXw6PQFwWtfNGpCYSVblbLGz3PgAw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:10.712196Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.10284","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5da191b81642dd33492bcf68e24f7421761ef0209aa899da9d7482fd1558be52","sha256:096883695e67846470f25262642399ff7800c376fbbdeaa9af0f19018a79c138"],"state_sha256":"7deb290a787eb854fb04a7392385845e25baa9ec9c9e645bccfa7b70f58b36c8"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t2Qxi17NacApjgndkO1GNCkr71XTRmLidGsp5c5p/E9tR7F2VIiQTUj22soAg8V834Jhjwe6fW/e7w5v0vyVBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:09:32.765731Z","bundle_sha256":"87a75281f7591fd0a939a159cb8a04e6de3f8954fd07e56ee5723cd35170d5c1"}}