{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ORHGSTJIZ5GDPUBMNLUJABDF2G","short_pith_number":"pith:ORHGSTJI","schema_version":"1.0","canonical_sha256":"744e694d28cf4c37d02c6ae8900465d1afcfa9e359f03c0c29031c4d748514b3","source":{"kind":"arxiv","id":"1706.03996","version":1},"attestation_state":"computed","paper":{"title":"Distributed Subgraph Detection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dennis Olivetti, Ioan Todinca, Ivan Rapaport, Pedro Montealegre, Pierre Fraigniaud","submitted_at":"2017-06-13T11:00:35Z","abstract_excerpt":"In the standard CONGEST model for distributed network computing, it is known that \"global\" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume large bandwidth, for their running-time is $\\Omega(\\mbox{poly}(n))$ rounds in $n$-node networks with constant diameter. Surprisingly, \"local\" tasks such as detecting the presence of a 4-cycle as a subgraph also requires $\\widetilde{\\Omega}(\\sqrt{n})$ rounds, even using randomized algorithms, and the best known upper bound for detecting the presence of a 3-cycle is $\\widetilde{O}(n^{\\frac{2}{3}})$ rounds. The objective of"},"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.03996","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"cs.DC","submitted_at":"2017-06-13T11:00:35Z","cross_cats_sorted":[],"title_canon_sha256":"351751dd587f76d05cbdad5daec73c3952530c53a20fc3769406cb3210cd5fda","abstract_canon_sha256":"04119add4efb567950d506c3ef9a8756a47b28cc4867f69512c559a666a7d551"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:42:24.793948Z","signature_b64":"b2lCS+BnsHRJe2GPiwq++7kTALAXR5FKj8zgYqWu0bltZ2pwLr0tdT772VwD+pmCyFDaDn87ce9c5He4m9nBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"744e694d28cf4c37d02c6ae8900465d1afcfa9e359f03c0c29031c4d748514b3","last_reissued_at":"2026-05-18T00:42:24.793479Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:42:24.793479Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Distributed Subgraph Detection","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Dennis Olivetti, Ioan Todinca, Ivan Rapaport, Pedro Montealegre, Pierre Fraigniaud","submitted_at":"2017-06-13T11:00:35Z","abstract_excerpt":"In the standard CONGEST model for distributed network computing, it is known that \"global\" tasks such as minimum spanning tree, diameter, and all-pairs shortest paths, consume large bandwidth, for their running-time is $\\Omega(\\mbox{poly}(n))$ rounds in $n$-node networks with constant diameter. Surprisingly, \"local\" tasks such as detecting the presence of a 4-cycle as a subgraph also requires $\\widetilde{\\Omega}(\\sqrt{n})$ rounds, even using randomized algorithms, and the best known upper bound for detecting the presence of a 3-cycle is $\\widetilde{O}(n^{\\frac{2}{3}})$ rounds. The objective of"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.03996","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.03996","created_at":"2026-05-18T00:42:24.793550+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.03996v1","created_at":"2026-05-18T00:42:24.793550+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.03996","created_at":"2026-05-18T00:42:24.793550+00:00"},{"alias_kind":"pith_short_12","alias_value":"ORHGSTJIZ5GD","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"ORHGSTJIZ5GDPUBM","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"ORHGSTJI","created_at":"2026-05-18T12:31:34.259226+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/ORHGSTJIZ5GDPUBMNLUJABDF2G","json":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G.json","graph_json":"https://pith.science/api/pith-number/ORHGSTJIZ5GDPUBMNLUJABDF2G/graph.json","events_json":"https://pith.science/api/pith-number/ORHGSTJIZ5GDPUBMNLUJABDF2G/events.json","paper":"https://pith.science/paper/ORHGSTJI"},"agent_actions":{"view_html":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G","download_json":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G.json","view_paper":"https://pith.science/paper/ORHGSTJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.03996&json=true","fetch_graph":"https://pith.science/api/pith-number/ORHGSTJIZ5GDPUBMNLUJABDF2G/graph.json","fetch_events":"https://pith.science/api/pith-number/ORHGSTJIZ5GDPUBMNLUJABDF2G/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G/action/storage_attestation","attest_author":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G/action/author_attestation","sign_citation":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G/action/citation_signature","submit_replication":"https://pith.science/pith/ORHGSTJIZ5GDPUBMNLUJABDF2G/action/replication_record"}},"created_at":"2026-05-18T00:42:24.793550+00:00","updated_at":"2026-05-18T00:42:24.793550+00:00"}