{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:ALLKKDL6MU3ASV3NCH3NR3U7CX","short_pith_number":"pith:ALLKKDL6","canonical_record":{"source":{"id":"1705.05646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T11:11:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3ecf0ae6ce05fa1f81c6c725b4f4e143df582f5ba439f09ca8318ec0676d355f","abstract_canon_sha256":"604e4a0bfa3ab20e371eb76d1dc0b85bb0611d58f3fe21bc33f2f2bd4b315838"},"schema_version":"1.0"},"canonical_sha256":"02d6a50d7e653609576d11f6d8ee9f15c274603b6106bb531a3ac5a4a72d47f4","source":{"kind":"arxiv","id":"1705.05646","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05646","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05646v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05646","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"ALLKKDL6MU3A","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ALLKKDL6MU3ASV3N","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ALLKKDL6","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:ALLKKDL6MU3ASV3NCH3NR3U7CX","target":"record","payload":{"canonical_record":{"source":{"id":"1705.05646","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T11:11:37Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"3ecf0ae6ce05fa1f81c6c725b4f4e143df582f5ba439f09ca8318ec0676d355f","abstract_canon_sha256":"604e4a0bfa3ab20e371eb76d1dc0b85bb0611d58f3fe21bc33f2f2bd4b315838"},"schema_version":"1.0"},"canonical_sha256":"02d6a50d7e653609576d11f6d8ee9f15c274603b6106bb531a3ac5a4a72d47f4","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:44:20.572412Z","signature_b64":"4OurW33Kma6/smmCUHdUgakWQL4h9fJ3DjyrK/nuTX5CzZlWrF4BdC143hDnJ9JbHThjSM6o+rxnGOVAJ9WcAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"02d6a50d7e653609576d11f6d8ee9f15c274603b6106bb531a3ac5a4a72d47f4","last_reissued_at":"2026-05-18T00:44:20.571963Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:44:20.571963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1705.05646","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-18T00:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XsZ7FVVUNU0FyV1wPAf1dKwemhZo1JrlhDb9FtBe9A/7DqQLqph20CiEhWY38e3Lr/1Qkk01wuQRAwqUYyMCAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:15:20.437340Z"},"content_sha256":"43af910362c3c318bbcadb34e060ff5c63a8b457ad9448fdb0331402b1ed3b3d","schema_version":"1.0","event_id":"sha256:43af910362c3c318bbcadb34e060ff5c63a8b457ad9448fdb0331402b1ed3b3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:ALLKKDL6MU3ASV3NCH3NR3U7CX","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Ami Paz, Keren Censor-Hillel, Seri Khoury","submitted_at":"2017-05-16T11:11:37Z","abstract_excerpt":"We present the first super-linear lower bounds for natural graph problems in the CONGEST model, answering a long-standing open question.\n  Specifically, we show that any exact computation of a minimum vertex cover or a maximum independent set requires $\\Omega(n^2/\\log^2{n})$ rounds in the worst case in the CONGEST model, as well as any algorithm for $\\chi$-coloring a graph, where $\\chi$ is the chromatic number of the graph. We further show that such strong lower bounds are not limited to NP-hard problems, by showing two simple graph problems in P which require a quadratic and near-quadratic nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05646","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-18T00:44:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VXoxf5XubIMwzdTKy81LFpfE3XtnN9DGb2ZiM7XCTiaVVWFvj1Hrdjnhff9ZIZijSHF7RMEsEwuJkvqHxyuNBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T18:15:20.437756Z"},"content_sha256":"66d5a0c39faac6d01d8e9a57b6e7a3c3ae5cb5ad88ec739ec490ea6ada30f43e","schema_version":"1.0","event_id":"sha256:66d5a0c39faac6d01d8e9a57b6e7a3c3ae5cb5ad88ec739ec490ea6ada30f43e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ALLKKDL6MU3ASV3NCH3NR3U7CX/bundle.json","state_url":"https://pith.science/pith/ALLKKDL6MU3ASV3NCH3NR3U7CX/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ALLKKDL6MU3ASV3NCH3NR3U7CX/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-31T18:15:20Z","links":{"resolver":"https://pith.science/pith/ALLKKDL6MU3ASV3NCH3NR3U7CX","bundle":"https://pith.science/pith/ALLKKDL6MU3ASV3NCH3NR3U7CX/bundle.json","state":"https://pith.science/pith/ALLKKDL6MU3ASV3NCH3NR3U7CX/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ALLKKDL6MU3ASV3NCH3NR3U7CX/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ALLKKDL6MU3ASV3NCH3NR3U7CX","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":"604e4a0bfa3ab20e371eb76d1dc0b85bb0611d58f3fe21bc33f2f2bd4b315838","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T11:11:37Z","title_canon_sha256":"3ecf0ae6ce05fa1f81c6c725b4f4e143df582f5ba439f09ca8318ec0676d355f"},"schema_version":"1.0","source":{"id":"1705.05646","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.05646","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"arxiv_version","alias_value":"1705.05646v1","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.05646","created_at":"2026-05-18T00:44:20Z"},{"alias_kind":"pith_short_12","alias_value":"ALLKKDL6MU3A","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"ALLKKDL6MU3ASV3N","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"ALLKKDL6","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:66d5a0c39faac6d01d8e9a57b6e7a3c3ae5cb5ad88ec739ec490ea6ada30f43e","target":"graph","created_at":"2026-05-18T00:44:20Z","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":"We present the first super-linear lower bounds for natural graph problems in the CONGEST model, answering a long-standing open question.\n  Specifically, we show that any exact computation of a minimum vertex cover or a maximum independent set requires $\\Omega(n^2/\\log^2{n})$ rounds in the worst case in the CONGEST model, as well as any algorithm for $\\chi$-coloring a graph, where $\\chi$ is the chromatic number of the graph. We further show that such strong lower bounds are not limited to NP-hard problems, by showing two simple graph problems in P which require a quadratic and near-quadratic nu","authors_text":"Ami Paz, Keren Censor-Hillel, Seri Khoury","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T11:11:37Z","title":"Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.05646","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:43af910362c3c318bbcadb34e060ff5c63a8b457ad9448fdb0331402b1ed3b3d","target":"record","created_at":"2026-05-18T00:44:20Z","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":"604e4a0bfa3ab20e371eb76d1dc0b85bb0611d58f3fe21bc33f2f2bd4b315838","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-05-16T11:11:37Z","title_canon_sha256":"3ecf0ae6ce05fa1f81c6c725b4f4e143df582f5ba439f09ca8318ec0676d355f"},"schema_version":"1.0","source":{"id":"1705.05646","kind":"arxiv","version":1}},"canonical_sha256":"02d6a50d7e653609576d11f6d8ee9f15c274603b6106bb531a3ac5a4a72d47f4","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"02d6a50d7e653609576d11f6d8ee9f15c274603b6106bb531a3ac5a4a72d47f4","first_computed_at":"2026-05-18T00:44:20.571963Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:44:20.571963Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"4OurW33Kma6/smmCUHdUgakWQL4h9fJ3DjyrK/nuTX5CzZlWrF4BdC143hDnJ9JbHThjSM6o+rxnGOVAJ9WcAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:44:20.572412Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.05646","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:43af910362c3c318bbcadb34e060ff5c63a8b457ad9448fdb0331402b1ed3b3d","sha256:66d5a0c39faac6d01d8e9a57b6e7a3c3ae5cb5ad88ec739ec490ea6ada30f43e"],"state_sha256":"1bb1c45f3e2f3d1c61f46df1832172f6bf71a359d99ca44b3218082f9a37a22a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kECJ3GfBjqx6+h1Orrsdc8csBmKPLU6GQsBltnuuGFHSUip5IDBuval6O7eCeSS0glyUVLZIrodkGGg0zGBSAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T18:15:20.440347Z","bundle_sha256":"7075a43c39ebbaac5467226e246397e0ba0fa1aed2174b5dae9a6f569fc241aa"}}