{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:73FBP5RDWXEN4OV3TYHXE7DAID","short_pith_number":"pith:73FBP5RD","schema_version":"1.0","canonical_sha256":"feca17f623b5c8de3abb9e0f727c6040fffcf2ab65376e25f2859465e1fb5f46","source":{"kind":"arxiv","id":"1706.03107","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1706.03107","created_at":"2026-05-18T00:42:38.455722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03107v1","created_at":"2026-05-18T00:42:38.455722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03107","created_at":"2026-05-18T00:42:38.455722+00:00"},{"alias_kind":"pith_short_12","alias_value":"73FBP5RDWXEN","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_16","alias_value":"73FBP5RDWXEN4OV3","created_at":"2026-05-18T12:31:03.183658+00:00"},{"alias_kind":"pith_short_8","alias_value":"73FBP5RD","created_at":"2026-05-18T12:31:03.183658+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/73FBP5RDWXEN4OV3TYHXE7DAID","json":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID.json","graph_json":"https://pith.science/api/pith-number/73FBP5RDWXEN4OV3TYHXE7DAID/graph.json","events_json":"https://pith.science/api/pith-number/73FBP5RDWXEN4OV3TYHXE7DAID/events.json","paper":"https://pith.science/paper/73FBP5RD"},"agent_actions":{"view_html":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID","download_json":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID.json","view_paper":"https://pith.science/paper/73FBP5RD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03107&json=true","fetch_graph":"https://pith.science/api/pith-number/73FBP5RDWXEN4OV3TYHXE7DAID/graph.json","fetch_events":"https://pith.science/api/pith-number/73FBP5RDWXEN4OV3TYHXE7DAID/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/action/timestamp_anchor","attest_storage":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/action/storage_attestation","attest_author":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/action/author_attestation","sign_citation":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/action/citation_signature","submit_replication":"https://pith.science/pith/73FBP5RDWXEN4OV3TYHXE7DAID/action/replication_record"}},"created_at":"2026-05-18T00:42:38.455722+00:00","updated_at":"2026-05-18T00:42:38.455722+00:00"}