{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:MLHOGDX2RPV6IOH6CD5DYQYKBJ","short_pith_number":"pith:MLHOGDX2","schema_version":"1.0","canonical_sha256":"62cee30efa8bebe438fe10fa3c430a0a54e21da4dec75fca71c3fc70512546e3","source":{"kind":"arxiv","id":"1103.6073","version":1},"attestation_state":"computed","paper":{"title":"Colorful Triangle Counting and a MapReduce Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Rasmus Pagh","submitted_at":"2011-03-31T01:26:13Z","abstract_excerpt":"In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated around the true number of triangles. Specifically, if $p \\geq \\max{(\\frac{\\Delta \\log{n}}{t}, \\frac{\\log{n}}{\\sqrt{t}})}$, where $n$, $t$, $\\Delta$ denote the number of vertices in $G$, the number of triangles in $G$, the maximum number of triangles an edge of $G$ is contained, then for any constant $\\epsilon>0$ our unbiased estimate $T$ is concentrated around its expectation, i.e., $ \\Prob{|T - \\Mean{T}| \\geq \\epsilon"},"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":"1103.6073","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-03-31T01:26:13Z","cross_cats_sorted":["cs.DM","cs.SI"],"title_canon_sha256":"24f2ea518a92faf86d1cf7233152ef51b40c8c4ced2160acb850689890b93b4a","abstract_canon_sha256":"0de3c0279479c7785a022de5ec1c8d711f80668dd71aee413d05bbba5bccf5b6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:25.247175Z","signature_b64":"XSEK9jv90SeQwVICRFj0zJXatNiI4TyWFLd2wwK+hq7/Wqz50GLtIyOA565FrXYs8Pmhj32CYg5Cx7WmK98xAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62cee30efa8bebe438fe10fa3c430a0a54e21da4dec75fca71c3fc70512546e3","last_reissued_at":"2026-05-18T04:25:25.246484Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:25.246484Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Colorful Triangle Counting and a MapReduce Implementation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Rasmus Pagh","submitted_at":"2011-03-31T01:26:13Z","abstract_excerpt":"In this note we introduce a new randomized algorithm for counting triangles in graphs. We show that under mild conditions, the estimate of our algorithm is strongly concentrated around the true number of triangles. Specifically, if $p \\geq \\max{(\\frac{\\Delta \\log{n}}{t}, \\frac{\\log{n}}{\\sqrt{t}})}$, where $n$, $t$, $\\Delta$ denote the number of vertices in $G$, the number of triangles in $G$, the maximum number of triangles an edge of $G$ is contained, then for any constant $\\epsilon>0$ our unbiased estimate $T$ is concentrated around its expectation, i.e., $ \\Prob{|T - \\Mean{T}| \\geq \\epsilon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1103.6073","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":"1103.6073","created_at":"2026-05-18T04:25:25.246582+00:00"},{"alias_kind":"arxiv_version","alias_value":"1103.6073v1","created_at":"2026-05-18T04:25:25.246582+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1103.6073","created_at":"2026-05-18T04:25:25.246582+00:00"},{"alias_kind":"pith_short_12","alias_value":"MLHOGDX2RPV6","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_16","alias_value":"MLHOGDX2RPV6IOH6","created_at":"2026-05-18T12:26:34.985390+00:00"},{"alias_kind":"pith_short_8","alias_value":"MLHOGDX2","created_at":"2026-05-18T12:26:34.985390+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/MLHOGDX2RPV6IOH6CD5DYQYKBJ","json":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ.json","graph_json":"https://pith.science/api/pith-number/MLHOGDX2RPV6IOH6CD5DYQYKBJ/graph.json","events_json":"https://pith.science/api/pith-number/MLHOGDX2RPV6IOH6CD5DYQYKBJ/events.json","paper":"https://pith.science/paper/MLHOGDX2"},"agent_actions":{"view_html":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ","download_json":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ.json","view_paper":"https://pith.science/paper/MLHOGDX2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1103.6073&json=true","fetch_graph":"https://pith.science/api/pith-number/MLHOGDX2RPV6IOH6CD5DYQYKBJ/graph.json","fetch_events":"https://pith.science/api/pith-number/MLHOGDX2RPV6IOH6CD5DYQYKBJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ/action/storage_attestation","attest_author":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ/action/author_attestation","sign_citation":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ/action/citation_signature","submit_replication":"https://pith.science/pith/MLHOGDX2RPV6IOH6CD5DYQYKBJ/action/replication_record"}},"created_at":"2026-05-18T04:25:25.246582+00:00","updated_at":"2026-05-18T04:25:25.246582+00:00"}