{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:6WPLLP3I7E3EAOEK4H6MB4R6DL","short_pith_number":"pith:6WPLLP3I","canonical_record":{"source":{"id":"1905.07780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-19T17:32:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e6e79b51a2ff796ceb4482963d4a793dd3800df9f6b8a6ea116da2d8b78a732d","abstract_canon_sha256":"65390d1981e953037ef2f2664c5053aa700f78f65389d5308148b9beeaca546d"},"schema_version":"1.0"},"canonical_sha256":"f59eb5bf68f93640388ae1fcc0f23e1af25b7a94c9fec87bb8f86ffd4a513f8d","source":{"kind":"arxiv","id":"1905.07780","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07780","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07780v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07780","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"6WPLLP3I7E3E","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6WPLLP3I7E3EAOEK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6WPLLP3I","created_at":"2026-05-18T12:33:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:6WPLLP3I7E3EAOEK4H6MB4R6DL","target":"record","payload":{"canonical_record":{"source":{"id":"1905.07780","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-19T17:32:04Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e6e79b51a2ff796ceb4482963d4a793dd3800df9f6b8a6ea116da2d8b78a732d","abstract_canon_sha256":"65390d1981e953037ef2f2664c5053aa700f78f65389d5308148b9beeaca546d"},"schema_version":"1.0"},"canonical_sha256":"f59eb5bf68f93640388ae1fcc0f23e1af25b7a94c9fec87bb8f86ffd4a513f8d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:48.505305Z","signature_b64":"ZlJ4v/UgaHxfUDY7NF/IwtaykwV205L8sGUHWk26luxVdk1Xm9gJ+OAhZRy2E0iHeVSyAKIH9BO+gqeREMonBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f59eb5bf68f93640388ae1fcc0f23e1af25b7a94c9fec87bb8f86ffd4a513f8d","last_reissued_at":"2026-05-17T23:45:48.504826Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:48.504826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.07780","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:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4ItQsE1y07mhz3f4Jz0mOwgjT2EAVWyOsjg3vVk2oCMlJ7zLw64FNy2GJGfncAVoNo01MVD9wmIUWGrwkUMAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:51.512195Z"},"content_sha256":"6901edf30025f0731f7d73da55b6f47579212f1f9ae2d33f8b5a4c4f4eca671d","schema_version":"1.0","event_id":"sha256:6901edf30025f0731f7d73da55b6f47579212f1f9ae2d33f8b5a4c4f4eca671d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:6WPLLP3I7E3EAOEK4H6MB4R6DL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DC","authors_text":"Lijie Chen, Ofer Grossman","submitted_at":"2019-05-19T17:32:04Z","abstract_excerpt":"We develop techniques to prove lower bounds for the BCAST(log n) Broadcast Congested Clique model (a distributed message passing model where in each round, each processor can broadcast an O(log n)-sized message to all other processors). Our techniques are built to prove bounds for natural input distributions. So far, all lower bounds for problems in the model relied on constructing specifically tailored graph families for the specific problem at hand, resulting in lower bounds for artificially constructed inputs, instead of natural input distributions.\n  One of our results is a lower bound for"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07780","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:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8dbKpcW753y6JGGzyw7j+L5a0AblizyIXrUCvliFngvtgmSjzH6mmidpfDkN6Lyot4aVhi7minqeTM5HTG1/Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T04:13:51.512649Z"},"content_sha256":"3509fe9dd1d02d06abf90d761ce7e98f72122eda25b5644c9320aed78d871e6b","schema_version":"1.0","event_id":"sha256:3509fe9dd1d02d06abf90d761ce7e98f72122eda25b5644c9320aed78d871e6b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6WPLLP3I7E3EAOEK4H6MB4R6DL/bundle.json","state_url":"https://pith.science/pith/6WPLLP3I7E3EAOEK4H6MB4R6DL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6WPLLP3I7E3EAOEK4H6MB4R6DL/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-25T04:13:51Z","links":{"resolver":"https://pith.science/pith/6WPLLP3I7E3EAOEK4H6MB4R6DL","bundle":"https://pith.science/pith/6WPLLP3I7E3EAOEK4H6MB4R6DL/bundle.json","state":"https://pith.science/pith/6WPLLP3I7E3EAOEK4H6MB4R6DL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6WPLLP3I7E3EAOEK4H6MB4R6DL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:6WPLLP3I7E3EAOEK4H6MB4R6DL","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":"65390d1981e953037ef2f2664c5053aa700f78f65389d5308148b9beeaca546d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-19T17:32:04Z","title_canon_sha256":"e6e79b51a2ff796ceb4482963d4a793dd3800df9f6b8a6ea116da2d8b78a732d"},"schema_version":"1.0","source":{"id":"1905.07780","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.07780","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"arxiv_version","alias_value":"1905.07780v1","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.07780","created_at":"2026-05-17T23:45:48Z"},{"alias_kind":"pith_short_12","alias_value":"6WPLLP3I7E3E","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_16","alias_value":"6WPLLP3I7E3EAOEK","created_at":"2026-05-18T12:33:10Z"},{"alias_kind":"pith_short_8","alias_value":"6WPLLP3I","created_at":"2026-05-18T12:33:10Z"}],"graph_snapshots":[{"event_id":"sha256:3509fe9dd1d02d06abf90d761ce7e98f72122eda25b5644c9320aed78d871e6b","target":"graph","created_at":"2026-05-17T23:45:48Z","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 develop techniques to prove lower bounds for the BCAST(log n) Broadcast Congested Clique model (a distributed message passing model where in each round, each processor can broadcast an O(log n)-sized message to all other processors). Our techniques are built to prove bounds for natural input distributions. So far, all lower bounds for problems in the model relied on constructing specifically tailored graph families for the specific problem at hand, resulting in lower bounds for artificially constructed inputs, instead of natural input distributions.\n  One of our results is a lower bound for","authors_text":"Lijie Chen, Ofer Grossman","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-19T17:32:04Z","title":"Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.07780","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:6901edf30025f0731f7d73da55b6f47579212f1f9ae2d33f8b5a4c4f4eca671d","target":"record","created_at":"2026-05-17T23:45:48Z","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":"65390d1981e953037ef2f2664c5053aa700f78f65389d5308148b9beeaca546d","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-05-19T17:32:04Z","title_canon_sha256":"e6e79b51a2ff796ceb4482963d4a793dd3800df9f6b8a6ea116da2d8b78a732d"},"schema_version":"1.0","source":{"id":"1905.07780","kind":"arxiv","version":1}},"canonical_sha256":"f59eb5bf68f93640388ae1fcc0f23e1af25b7a94c9fec87bb8f86ffd4a513f8d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f59eb5bf68f93640388ae1fcc0f23e1af25b7a94c9fec87bb8f86ffd4a513f8d","first_computed_at":"2026-05-17T23:45:48.504826Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:48.504826Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZlJ4v/UgaHxfUDY7NF/IwtaykwV205L8sGUHWk26luxVdk1Xm9gJ+OAhZRy2E0iHeVSyAKIH9BO+gqeREMonBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:48.505305Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.07780","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6901edf30025f0731f7d73da55b6f47579212f1f9ae2d33f8b5a4c4f4eca671d","sha256:3509fe9dd1d02d06abf90d761ce7e98f72122eda25b5644c9320aed78d871e6b"],"state_sha256":"3bc271bbc95335348a820a5f9bc844a76a07bed897ca4d5a31d2f02c8539953c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1ZnZDWskXxl73lX4ReBalQpzkoYHuiBsBCt5pCShTuhfsMgOlUgocDxbBF3j0Wz2Myrkdqw1y9zOtyJdmZvMCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T04:13:51.516180Z","bundle_sha256":"31ac3854926d9fcd5499ab2b34b00407d88c063b40be53f78396e7f60d3381e1"}}