{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:WYGI5FXSMZPHD3TNUGUCKZRWY3","short_pith_number":"pith:WYGI5FXS","schema_version":"1.0","canonical_sha256":"b60c8e96f2665e71ee6da1a8256636c6f790665aa34bbf7f6da07f62a19db301","source":{"kind":"arxiv","id":"1904.11440","version":1},"attestation_state":"computed","paper":{"title":"Distributed Detection of Cliques in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Keren Censor-Hillel, Matthias Bonne","submitted_at":"2019-04-25T16:32:21Z","abstract_excerpt":"This paper provides an in-depth study of the fundamental problems of finding small subgraphs in distributed dynamic networks. While some problems are trivially easy to handle, such as detecting a triangle that emerges after an edge insertion, we show that, perhaps somewhat surprisingly, other problems exhibit a wide range of complexities in terms of the trade-offs between their round and bandwidth complexities. In the case of triangles, which are only affected by the topology of the immediate neighborhood, some end results are:\n  \\begin{itemize}\n  \\item The bandwidth complexity of $1$-round dy"},"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":"1904.11440","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2019-04-25T16:32:21Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"82d27cf7ba33e0a3e99fecf377ee03f91fddb6fd3db1cc169ca61a34456a1e29","abstract_canon_sha256":"8b5d77eb6e0d6c899a5ea14e3d6eda7f1fe3bdf02ae947a2bf83c25785848393"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:47:44.856337Z","signature_b64":"ZcugrvbF8RPEBuFI39Ct5a3sPXiuwQdnjVW0BppDe51MJfZhN1+2PMIZY/DseWOKHtqKk3IPy/k/Wf0CLkRcAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b60c8e96f2665e71ee6da1a8256636c6f790665aa34bbf7f6da07f62a19db301","last_reissued_at":"2026-05-17T23:47:44.855694Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:47:44.855694Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Detection of Cliques in Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Keren Censor-Hillel, Matthias Bonne","submitted_at":"2019-04-25T16:32:21Z","abstract_excerpt":"This paper provides an in-depth study of the fundamental problems of finding small subgraphs in distributed dynamic networks. While some problems are trivially easy to handle, such as detecting a triangle that emerges after an edge insertion, we show that, perhaps somewhat surprisingly, other problems exhibit a wide range of complexities in terms of the trade-offs between their round and bandwidth complexities. In the case of triangles, which are only affected by the topology of the immediate neighborhood, some end results are:\n  \\begin{itemize}\n  \\item The bandwidth complexity of $1$-round dy"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.11440","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":"1904.11440","created_at":"2026-05-17T23:47:44.855826+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.11440v1","created_at":"2026-05-17T23:47:44.855826+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.11440","created_at":"2026-05-17T23:47:44.855826+00:00"},{"alias_kind":"pith_short_12","alias_value":"WYGI5FXSMZPH","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_16","alias_value":"WYGI5FXSMZPHD3TN","created_at":"2026-05-18T12:33:33.725879+00:00"},{"alias_kind":"pith_short_8","alias_value":"WYGI5FXS","created_at":"2026-05-18T12:33:33.725879+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/WYGI5FXSMZPHD3TNUGUCKZRWY3","json":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3.json","graph_json":"https://pith.science/api/pith-number/WYGI5FXSMZPHD3TNUGUCKZRWY3/graph.json","events_json":"https://pith.science/api/pith-number/WYGI5FXSMZPHD3TNUGUCKZRWY3/events.json","paper":"https://pith.science/paper/WYGI5FXS"},"agent_actions":{"view_html":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3","download_json":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3.json","view_paper":"https://pith.science/paper/WYGI5FXS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.11440&json=true","fetch_graph":"https://pith.science/api/pith-number/WYGI5FXSMZPHD3TNUGUCKZRWY3/graph.json","fetch_events":"https://pith.science/api/pith-number/WYGI5FXSMZPHD3TNUGUCKZRWY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3/action/storage_attestation","attest_author":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3/action/author_attestation","sign_citation":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3/action/citation_signature","submit_replication":"https://pith.science/pith/WYGI5FXSMZPHD3TNUGUCKZRWY3/action/replication_record"}},"created_at":"2026-05-17T23:47:44.855826+00:00","updated_at":"2026-05-17T23:47:44.855826+00:00"}