{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:KQAY2DSWQICWOOBQYZDCTPOK5W","short_pith_number":"pith:KQAY2DSW","schema_version":"1.0","canonical_sha256":"54018d0e568205673830c64629bdcaed9559f929b7ffd834e0a44532ce7cc9e4","source":{"kind":"arxiv","id":"2009.08208","version":1},"attestation_state":"computed","paper":{"title":"Finding Subgraphs in Highly Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Keren Censor-Hillel, Victor I. Kolobov","submitted_at":"2020-09-17T11:02:09Z","abstract_excerpt":"In this paper we consider the fundamental problem of finding subgraphs in highly dynamic distributed networks - networks which allow an arbitrary number of links to be inserted / deleted per round. We show that the problems of $k$-clique membership listing (for any $k\\geq 3$), 4-cycle listing and 5-cycle listing can be deterministically solved in $O(1)$-amortized round complexity, even with limited logarithmic-sized messages.\n  To achieve $k$-clique membership listing we introduce a very useful combinatorial structure which we name the robust $2$-hop neighborhood. This is a subset of the 2-hop"},"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":"2009.08208","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2020-09-17T11:02:09Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"22f1b213a5b392f4b45d0b40e33272b29d6f4c85313a2e1d17332ca9b59c624c","abstract_canon_sha256":"2f5491425f0ee085e47f23257f7241289d3ab99342301488d7d79f6fe2355a50"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:36:11.571894Z","signature_b64":"/99lfTqrX0ncrXmG7C25tA7+3B6WTPqNbrO5MmBCml1zv/nIJLVcOWCarg+eDFshmWwW4/CQuu7DpXTu90kkCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"54018d0e568205673830c64629bdcaed9559f929b7ffd834e0a44532ce7cc9e4","last_reissued_at":"2026-07-05T01:36:11.571520Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:36:11.571520Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Finding Subgraphs in Highly Dynamic Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DC","authors_text":"Gregory Schwartzman, Keren Censor-Hillel, Victor I. Kolobov","submitted_at":"2020-09-17T11:02:09Z","abstract_excerpt":"In this paper we consider the fundamental problem of finding subgraphs in highly dynamic distributed networks - networks which allow an arbitrary number of links to be inserted / deleted per round. We show that the problems of $k$-clique membership listing (for any $k\\geq 3$), 4-cycle listing and 5-cycle listing can be deterministically solved in $O(1)$-amortized round complexity, even with limited logarithmic-sized messages.\n  To achieve $k$-clique membership listing we introduce a very useful combinatorial structure which we name the robust $2$-hop neighborhood. This is a subset of the 2-hop"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2009.08208","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2009.08208/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2009.08208","created_at":"2026-07-05T01:36:11.571580+00:00"},{"alias_kind":"arxiv_version","alias_value":"2009.08208v1","created_at":"2026-07-05T01:36:11.571580+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2009.08208","created_at":"2026-07-05T01:36:11.571580+00:00"},{"alias_kind":"pith_short_12","alias_value":"KQAY2DSWQICW","created_at":"2026-07-05T01:36:11.571580+00:00"},{"alias_kind":"pith_short_16","alias_value":"KQAY2DSWQICWOOBQ","created_at":"2026-07-05T01:36:11.571580+00:00"},{"alias_kind":"pith_short_8","alias_value":"KQAY2DSW","created_at":"2026-07-05T01:36:11.571580+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/KQAY2DSWQICWOOBQYZDCTPOK5W","json":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W.json","graph_json":"https://pith.science/api/pith-number/KQAY2DSWQICWOOBQYZDCTPOK5W/graph.json","events_json":"https://pith.science/api/pith-number/KQAY2DSWQICWOOBQYZDCTPOK5W/events.json","paper":"https://pith.science/paper/KQAY2DSW"},"agent_actions":{"view_html":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W","download_json":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W.json","view_paper":"https://pith.science/paper/KQAY2DSW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2009.08208&json=true","fetch_graph":"https://pith.science/api/pith-number/KQAY2DSWQICWOOBQYZDCTPOK5W/graph.json","fetch_events":"https://pith.science/api/pith-number/KQAY2DSWQICWOOBQYZDCTPOK5W/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W/action/storage_attestation","attest_author":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W/action/author_attestation","sign_citation":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W/action/citation_signature","submit_replication":"https://pith.science/pith/KQAY2DSWQICWOOBQYZDCTPOK5W/action/replication_record"}},"created_at":"2026-07-05T01:36:11.571580+00:00","updated_at":"2026-07-05T01:36:11.571580+00:00"}