{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:EYE2A37OJB4JGTFDSPMIVO54ZH","short_pith_number":"pith:EYE2A37O","schema_version":"1.0","canonical_sha256":"2609a06fee4878934ca393d88abbbcc9f948ffea2f9fed450f355486dab358c9","source":{"kind":"arxiv","id":"1201.6652","version":3},"attestation_state":"computed","paper":{"title":"\"Tri, Tri again\": Finding Triangles and Small Subgraphs in a Distributed Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Danny Dolev, Shir Peled","submitted_at":"2012-01-31T19:02:49Z","abstract_excerpt":"Let G = (V,E) be an n-vertex graph and M_d a d-vertex graph, for some constant d. Is M_d a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log n) bits. A simple deterministic algorithm that requires O(n^((d-2)/d) / log n) communication rounds is presented. For the special case that M_d is a triangle, we present a probabilistic algorithm that requires an expected O(ceil(n^(1/3) / (t^(2/3) + 1))) rounds of communication, where t is the number of triangles in the graph, and O(min{n^(1/3) log^(2/3) n /"},"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":"1201.6652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-31T19:02:49Z","cross_cats_sorted":[],"title_canon_sha256":"c5c76a84a742a86469a964dae20221143d793b961f2753ebb206f11ead371cc1","abstract_canon_sha256":"1c11bb49e95f22a30bc2b457832c59f7e267379c015e0f649346d56b95bc897c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:41:32.229600Z","signature_b64":"aBC+SevCPBdZN8Fix9R4jweQPcJOBpZqhAGvIPc8kllBAiKCjlG+2tl/dhHpPwsUdVUHUpTS8S6Bu1LaXRwPDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2609a06fee4878934ca393d88abbbcc9f948ffea2f9fed450f355486dab358c9","last_reissued_at":"2026-05-18T03:41:32.229087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:41:32.229087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"\"Tri, Tri again\": Finding Triangles and Small Subgraphs in a Distributed Setting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Christoph Lenzen, Danny Dolev, Shir Peled","submitted_at":"2012-01-31T19:02:49Z","abstract_excerpt":"Let G = (V,E) be an n-vertex graph and M_d a d-vertex graph, for some constant d. Is M_d a subgraph of G? We consider this problem in a model where all n processes are connected to all other processes, and each message contains up to O(log n) bits. A simple deterministic algorithm that requires O(n^((d-2)/d) / log n) communication rounds is presented. For the special case that M_d is a triangle, we present a probabilistic algorithm that requires an expected O(ceil(n^(1/3) / (t^(2/3) + 1))) rounds of communication, where t is the number of triangles in the graph, and O(min{n^(1/3) log^(2/3) n /"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6652","kind":"arxiv","version":3},"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":"1201.6652","created_at":"2026-05-18T03:41:32.229161+00:00"},{"alias_kind":"arxiv_version","alias_value":"1201.6652v3","created_at":"2026-05-18T03:41:32.229161+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6652","created_at":"2026-05-18T03:41:32.229161+00:00"},{"alias_kind":"pith_short_12","alias_value":"EYE2A37OJB4J","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_16","alias_value":"EYE2A37OJB4JGTFD","created_at":"2026-05-18T12:27:04.183437+00:00"},{"alias_kind":"pith_short_8","alias_value":"EYE2A37O","created_at":"2026-05-18T12:27:04.183437+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/EYE2A37OJB4JGTFDSPMIVO54ZH","json":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH.json","graph_json":"https://pith.science/api/pith-number/EYE2A37OJB4JGTFDSPMIVO54ZH/graph.json","events_json":"https://pith.science/api/pith-number/EYE2A37OJB4JGTFDSPMIVO54ZH/events.json","paper":"https://pith.science/paper/EYE2A37O"},"agent_actions":{"view_html":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH","download_json":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH.json","view_paper":"https://pith.science/paper/EYE2A37O","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1201.6652&json=true","fetch_graph":"https://pith.science/api/pith-number/EYE2A37OJB4JGTFDSPMIVO54ZH/graph.json","fetch_events":"https://pith.science/api/pith-number/EYE2A37OJB4JGTFDSPMIVO54ZH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/action/storage_attestation","attest_author":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/action/author_attestation","sign_citation":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/action/citation_signature","submit_replication":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/action/replication_record"}},"created_at":"2026-05-18T03:41:32.229161+00:00","updated_at":"2026-05-18T03:41:32.229161+00:00"}