{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:EYE2A37OJB4JGTFDSPMIVO54ZH","short_pith_number":"pith:EYE2A37O","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"},"canonical_sha256":"2609a06fee4878934ca393d88abbbcc9f948ffea2f9fed450f355486dab358c9","source":{"kind":"arxiv","id":"1201.6652","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6652","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6652v3","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6652","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"pith_short_12","alias_value":"EYE2A37OJB4J","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EYE2A37OJB4JGTFD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EYE2A37O","created_at":"2026-05-18T12:27:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:EYE2A37OJB4JGTFDSPMIVO54ZH","target":"record","payload":{"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"},"canonical_sha256":"2609a06fee4878934ca393d88abbbcc9f948ffea2f9fed450f355486dab358c9","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"},"source_kind":"arxiv","source_id":"1201.6652","source_version":3,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FvtBYW+yNuIIS1ZHhaFLtnlZ3BfaJT3CrURf80+6N7uL5ahZ1w9nSY4r/47AmOMdd73drd1fK1/ANgObUdWLBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:10:54.556647Z"},"content_sha256":"08b9da8c8ebc5d6bf6fc802804ff8f15efc63f80ac543aff5afc9bd1f38b8c2a","schema_version":"1.0","event_id":"sha256:08b9da8c8ebc5d6bf6fc802804ff8f15efc63f80ac543aff5afc9bd1f38b8c2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:EYE2A37OJB4JGTFDSPMIVO54ZH","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:41:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KnhRqZ4+ylTyKdLg54gQtl3OkeQus89fs65jmOffA0rIK/OxvU6d4jy14HeCT1oYLvQTiMHTKyy65jrN1U5JBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T00:10:54.557381Z"},"content_sha256":"7d10fd3dcdc374df44b73df883bc2640414ee85ac894678c28592cae3adc7b09","schema_version":"1.0","event_id":"sha256:7d10fd3dcdc374df44b73df883bc2640414ee85ac894678c28592cae3adc7b09"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/bundle.json","state_url":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T00:10:54Z","links":{"resolver":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH","bundle":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/bundle.json","state":"https://pith.science/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EYE2A37OJB4JGTFDSPMIVO54ZH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:EYE2A37OJB4JGTFDSPMIVO54ZH","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"1c11bb49e95f22a30bc2b457832c59f7e267379c015e0f649346d56b95bc897c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-31T19:02:49Z","title_canon_sha256":"c5c76a84a742a86469a964dae20221143d793b961f2753ebb206f11ead371cc1"},"schema_version":"1.0","source":{"id":"1201.6652","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1201.6652","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"arxiv_version","alias_value":"1201.6652v3","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1201.6652","created_at":"2026-05-18T03:41:32Z"},{"alias_kind":"pith_short_12","alias_value":"EYE2A37OJB4J","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_16","alias_value":"EYE2A37OJB4JGTFD","created_at":"2026-05-18T12:27:04Z"},{"alias_kind":"pith_short_8","alias_value":"EYE2A37O","created_at":"2026-05-18T12:27:04Z"}],"graph_snapshots":[{"event_id":"sha256:7d10fd3dcdc374df44b73df883bc2640414ee85ac894678c28592cae3adc7b09","target":"graph","created_at":"2026-05-18T03:41:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 /","authors_text":"Christoph Lenzen, Danny Dolev, Shir Peled","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-31T19:02:49Z","title":"\"Tri, Tri again\": Finding Triangles and Small Subgraphs in a Distributed Setting"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1201.6652","kind":"arxiv","version":3},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:08b9da8c8ebc5d6bf6fc802804ff8f15efc63f80ac543aff5afc9bd1f38b8c2a","target":"record","created_at":"2026-05-18T03:41:32Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"1c11bb49e95f22a30bc2b457832c59f7e267379c015e0f649346d56b95bc897c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-01-31T19:02:49Z","title_canon_sha256":"c5c76a84a742a86469a964dae20221143d793b961f2753ebb206f11ead371cc1"},"schema_version":"1.0","source":{"id":"1201.6652","kind":"arxiv","version":3}},"canonical_sha256":"2609a06fee4878934ca393d88abbbcc9f948ffea2f9fed450f355486dab358c9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2609a06fee4878934ca393d88abbbcc9f948ffea2f9fed450f355486dab358c9","first_computed_at":"2026-05-18T03:41:32.229087Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:41:32.229087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"aBC+SevCPBdZN8Fix9R4jweQPcJOBpZqhAGvIPc8kllBAiKCjlG+2tl/dhHpPwsUdVUHUpTS8S6Bu1LaXRwPDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:41:32.229600Z","signed_message":"canonical_sha256_bytes"},"source_id":"1201.6652","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:08b9da8c8ebc5d6bf6fc802804ff8f15efc63f80ac543aff5afc9bd1f38b8c2a","sha256:7d10fd3dcdc374df44b73df883bc2640414ee85ac894678c28592cae3adc7b09"],"state_sha256":"d9e31d24778ada51de76d19b86ecb4828fc2c7835e1fb39e210663460622d70e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q+bfSdNf2/wIUnYKdAv5KMOt3WA1nTZuklgYaHQBcTIsFlRA83dM5gZvp3koqdj/zGzBlkuBaFJN90zWOq+NAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T00:10:54.561333Z","bundle_sha256":"37a816c29e576f08cd5d60f0aa2a0d2b38696cff0099410469421d03d3e51afd"}}