{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:SCW3C4P2WRSU4GSHHLHYWBGQXY","short_pith_number":"pith:SCW3C4P2","schema_version":"1.0","canonical_sha256":"90adb171fab4654e1a473acf8b04d0be168d5c34329e6d1f5771848f97941e84","source":{"kind":"arxiv","id":"1711.06920","version":1},"attestation_state":"computed","paper":{"title":"Superlinear Lower Bounds for Distributed Subgraph Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Orr Fischer, Rotem Oshman, Tzlil Gonen","submitted_at":"2017-11-18T19:14:28Z","abstract_excerpt":"In the distributed subgraph-freeness problem, we are given a graph $H$, and asked to determine whether the network graph contains $H$ as a subgraph or not. Subgraph-freeness is an extremely local problem: if the network had no bandwidth constraints, we could detect any subgraph $H$ in $|H|$ rounds, by having each node of the network learn its entire $|H|$-neighborhood. However, when bandwidth is limited, the problem becomes harder.\n  Upper and lower bounds in the presence of congestion have been established for several classes of subgraphs, including cycles, trees, and more complicated subgrap"},"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":"1711.06920","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-11-18T19:14:28Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"8b8f7d6565eb4c3baead1137c4c81dd50ed40e7f7709da24c1aa15dfdd693bc8","abstract_canon_sha256":"855aa1e92d081436b65d429b1beca8c717dc56b54fb2dd418e1454fbd97c4d6a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:30:15.187796Z","signature_b64":"9F6qyp/8rvuHdOWipMBXdOsy9sL/9u00RQ7slH2WuOZsHb6IPq5w5FOpwzUsUa2n9hpBg9tKfIZkFM7GB0zmBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"90adb171fab4654e1a473acf8b04d0be168d5c34329e6d1f5771848f97941e84","last_reissued_at":"2026-05-18T00:30:15.187057Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:30:15.187057Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Superlinear Lower Bounds for Distributed Subgraph Detection","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"cs.DS","authors_text":"Orr Fischer, Rotem Oshman, Tzlil Gonen","submitted_at":"2017-11-18T19:14:28Z","abstract_excerpt":"In the distributed subgraph-freeness problem, we are given a graph $H$, and asked to determine whether the network graph contains $H$ as a subgraph or not. Subgraph-freeness is an extremely local problem: if the network had no bandwidth constraints, we could detect any subgraph $H$ in $|H|$ rounds, by having each node of the network learn its entire $|H|$-neighborhood. However, when bandwidth is limited, the problem becomes harder.\n  Upper and lower bounds in the presence of congestion have been established for several classes of subgraphs, including cycles, trees, and more complicated subgrap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.06920","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":"1711.06920","created_at":"2026-05-18T00:30:15.187175+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.06920v1","created_at":"2026-05-18T00:30:15.187175+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.06920","created_at":"2026-05-18T00:30:15.187175+00:00"},{"alias_kind":"pith_short_12","alias_value":"SCW3C4P2WRSU","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_16","alias_value":"SCW3C4P2WRSU4GSH","created_at":"2026-05-18T12:31:43.269735+00:00"},{"alias_kind":"pith_short_8","alias_value":"SCW3C4P2","created_at":"2026-05-18T12:31:43.269735+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/SCW3C4P2WRSU4GSHHLHYWBGQXY","json":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY.json","graph_json":"https://pith.science/api/pith-number/SCW3C4P2WRSU4GSHHLHYWBGQXY/graph.json","events_json":"https://pith.science/api/pith-number/SCW3C4P2WRSU4GSHHLHYWBGQXY/events.json","paper":"https://pith.science/paper/SCW3C4P2"},"agent_actions":{"view_html":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY","download_json":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY.json","view_paper":"https://pith.science/paper/SCW3C4P2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.06920&json=true","fetch_graph":"https://pith.science/api/pith-number/SCW3C4P2WRSU4GSHHLHYWBGQXY/graph.json","fetch_events":"https://pith.science/api/pith-number/SCW3C4P2WRSU4GSHHLHYWBGQXY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/action/storage_attestation","attest_author":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/action/author_attestation","sign_citation":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/action/citation_signature","submit_replication":"https://pith.science/pith/SCW3C4P2WRSU4GSHHLHYWBGQXY/action/replication_record"}},"created_at":"2026-05-18T00:30:15.187175+00:00","updated_at":"2026-05-18T00:30:15.187175+00:00"}