{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:73FBP5RDWXEN4OV3TYHXE7DAID","short_pith_number":"pith:73FBP5RD","canonical_record":{"source":{"id":"1706.03107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-09T20:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"cb6eadbb3e6554b69b6b47a454cfec8c94a4745184598279de4949f236034d42","abstract_canon_sha256":"3fe183a66715e3ee5f92b1f088778df50170323e9cb33799577b27174d5428a6"},"schema_version":"1.0"},"canonical_sha256":"feca17f623b5c8de3abb9e0f727c6040fffcf2ab65376e25f2859465e1fb5f46","source":{"kind":"arxiv","id":"1706.03107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03107","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03107v1","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03107","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"73FBP5RDWXEN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"73FBP5RDWXEN4OV3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"73FBP5RD","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:73FBP5RDWXEN4OV3TYHXE7DAID","target":"record","payload":{"canonical_record":{"source":{"id":"1706.03107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-09T20:00:32Z","cross_cats_sorted":[],"title_canon_sha256":"cb6eadbb3e6554b69b6b47a454cfec8c94a4745184598279de4949f236034d42","abstract_canon_sha256":"3fe183a66715e3ee5f92b1f088778df50170323e9cb33799577b27174d5428a6"},"schema_version":"1.0"},"canonical_sha256":"feca17f623b5c8de3abb9e0f727c6040fffcf2ab65376e25f2859465e1fb5f46","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:38.456146Z","signature_b64":"QNv43WoexflQMk47uYVhbb+xMfC1rOeNnBdjG8PD169ceCgFTdzpxV9nqLaQGHJHPk7LkxnqzTD+idJ3VR8NBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"feca17f623b5c8de3abb9e0f727c6040fffcf2ab65376e25f2859465e1fb5f46","last_reissued_at":"2026-05-18T00:42:38.455621Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:38.455621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.03107","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:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7K2srFaSxgB5G/bDayFHsYqrXQJ6f9FwTDtQAuBuaDxvDtCvI4sp/ON6Gz+7CkdonLe7e+l4AcAmP1jRz0fmCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:21:26.593361Z"},"content_sha256":"778fb05823fa5925e3d106b57e38603f04dd9f8e4b02f71a1c4c90fa7dae8321","schema_version":"1.0","event_id":"sha256:778fb05823fa5925e3d106b57e38603f04dd9f8e4b02f71a1c4c90fa7dae8321"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:73FBP5RDWXEN4OV3TYHXE7DAID","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Graph Reconstruction in the Congested Clique","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Ioan Todinca, Ivan Rapaport, Pedro Montealegre, Sebastian Perez-Salazar","submitted_at":"2017-06-09T20:00:32Z","abstract_excerpt":"The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of $n$ nodes. In this paper we consider the situation where the joint input to the nodes is an $n$-node labeled graph $G$, i.e., the local input received by each node is the indicator function of its neighborhood in $G$. Nodes execute an algorithm, communicating with each other in synchronous rounds and their goal is to compute some function that depends on $G$. In every round, each of the $n$ nodes may send up to $n-1$ different $b$-bit messages thr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03107","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:42:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"DD+8kgkESMF4745WQZKOfbxDK0mEyjjpPCunv6/qYMbR6jOS2XPmwHh9E/Kjf9h6WPTKMjbYa70rMCRV3gNLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:21:26.593716Z"},"content_sha256":"4e4a77e80dd207470788f707b41165d0eef4e7e69dd33c1680acb8a8c51bf788","schema_version":"1.0","event_id":"sha256:4e4a77e80dd207470788f707b41165d0eef4e7e69dd33c1680acb8a8c51bf788"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/bundle.json","state_url":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/73FBP5RDWXEN4OV3TYHXE7DAID/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-28T06:21:26Z","links":{"resolver":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID","bundle":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/bundle.json","state":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/state.json","well_known_bundle":"https://pith.science/.well-known/pith/73FBP5RDWXEN4OV3TYHXE7DAID/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:73FBP5RDWXEN4OV3TYHXE7DAID","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":"3fe183a66715e3ee5f92b1f088778df50170323e9cb33799577b27174d5428a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-09T20:00:32Z","title_canon_sha256":"cb6eadbb3e6554b69b6b47a454cfec8c94a4745184598279de4949f236034d42"},"schema_version":"1.0","source":{"id":"1706.03107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.03107","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"arxiv_version","alias_value":"1706.03107v1","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03107","created_at":"2026-05-18T00:42:38Z"},{"alias_kind":"pith_short_12","alias_value":"73FBP5RDWXEN","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"73FBP5RDWXEN4OV3","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"73FBP5RD","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:4e4a77e80dd207470788f707b41165d0eef4e7e69dd33c1680acb8a8c51bf788","target":"graph","created_at":"2026-05-18T00:42:38Z","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":"The congested clique model is a message-passing model of distributed computation where the underlying communication network is the complete graph of $n$ nodes. In this paper we consider the situation where the joint input to the nodes is an $n$-node labeled graph $G$, i.e., the local input received by each node is the indicator function of its neighborhood in $G$. Nodes execute an algorithm, communicating with each other in synchronous rounds and their goal is to compute some function that depends on $G$. In every round, each of the $n$ nodes may send up to $n-1$ different $b$-bit messages thr","authors_text":"Ioan Todinca, Ivan Rapaport, Pedro Montealegre, Sebastian Perez-Salazar","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-09T20:00:32Z","title":"Graph Reconstruction in the Congested Clique"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03107","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:778fb05823fa5925e3d106b57e38603f04dd9f8e4b02f71a1c4c90fa7dae8321","target":"record","created_at":"2026-05-18T00:42:38Z","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":"3fe183a66715e3ee5f92b1f088778df50170323e9cb33799577b27174d5428a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-09T20:00:32Z","title_canon_sha256":"cb6eadbb3e6554b69b6b47a454cfec8c94a4745184598279de4949f236034d42"},"schema_version":"1.0","source":{"id":"1706.03107","kind":"arxiv","version":1}},"canonical_sha256":"feca17f623b5c8de3abb9e0f727c6040fffcf2ab65376e25f2859465e1fb5f46","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"feca17f623b5c8de3abb9e0f727c6040fffcf2ab65376e25f2859465e1fb5f46","first_computed_at":"2026-05-18T00:42:38.455621Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:42:38.455621Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QNv43WoexflQMk47uYVhbb+xMfC1rOeNnBdjG8PD169ceCgFTdzpxV9nqLaQGHJHPk7LkxnqzTD+idJ3VR8NBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:42:38.456146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.03107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:778fb05823fa5925e3d106b57e38603f04dd9f8e4b02f71a1c4c90fa7dae8321","sha256:4e4a77e80dd207470788f707b41165d0eef4e7e69dd33c1680acb8a8c51bf788"],"state_sha256":"8c989024fa403d73097d9c8dc46056a62404e7cff7f1478653809d8a5bfa894b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qE9/2XVEZV+A0TBieKK6FanU2yonz8NcUh6e4YwEsEIwsobQqGB1yy/PDuLNPGFuWp7msNitcdKlSmrugLtMCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:21:26.596040Z","bundle_sha256":"769df1af51afa5d28ae5d9ce64f46683e5b486967c91314ab65b551b8a5f0756"}}