{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JTOMM3II4RKEH7HMGYL3B5I3C5","short_pith_number":"pith:JTOMM3II","schema_version":"1.0","canonical_sha256":"4cdcc66d08e45443fcec3617b0f51b175acbd9787d1045c10474d9bc7978cc53","source":{"kind":"arxiv","id":"1401.2175","version":2},"attestation_state":"computed","paper":{"title":"A Second Look at Counting Triangles in Graph Streams (revised)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Graham Cormode, Hossein Jowhari","submitted_at":"2014-01-09T21:37:20Z","abstract_excerpt":"In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with $m$ edges and at least $T$ triangles, we show that an extra look over the stream yields a two-pass treaming algorithm that uses $O(\\frac{m}{\\eps^{2.5}\\sqrt{T}}\\polylog(m))$ space and outputs a $(1+\\eps)$ approximation of the number of triangles in the graph. This improves upon the two-pass streaming tester of Braverman, Ostrovsky and Vilenchik, ICALP 2013, which distinguishes between triangle-free graphs and graphs with at least $T$ triangle using $O(\\frac{m}{T^{1/3}})$ space"},"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":"1401.2175","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T21:37:20Z","cross_cats_sorted":[],"title_canon_sha256":"d3c9c69f9117ae9faa8dba56108e14d11c61205afbdaa54fd2feb400f95cc76f","abstract_canon_sha256":"3a8201c563e966a392bc8f04fe86bea6690d1d733ccaed0e3cf9f3ef9326ddce"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:19:22.449980Z","signature_b64":"wc2FIzR5yg9kudjEBB0BWV1Sk+NsZ98coVcT/LjXLF/w0J1dYsTnLANPXalBDEtL+BAnCxiSjxs6OLNvb8F/BQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4cdcc66d08e45443fcec3617b0f51b175acbd9787d1045c10474d9bc7978cc53","last_reissued_at":"2026-05-18T01:19:22.449287Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:19:22.449287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Second Look at Counting Triangles in Graph Streams (revised)","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Graham Cormode, Hossein Jowhari","submitted_at":"2014-01-09T21:37:20Z","abstract_excerpt":"In this paper we present improved results on the problem of counting triangles in edge streamed graphs. For graphs with $m$ edges and at least $T$ triangles, we show that an extra look over the stream yields a two-pass treaming algorithm that uses $O(\\frac{m}{\\eps^{2.5}\\sqrt{T}}\\polylog(m))$ space and outputs a $(1+\\eps)$ approximation of the number of triangles in the graph. This improves upon the two-pass streaming tester of Braverman, Ostrovsky and Vilenchik, ICALP 2013, which distinguishes between triangle-free graphs and graphs with at least $T$ triangle using $O(\\frac{m}{T^{1/3}})$ space"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2175","kind":"arxiv","version":2},"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":"1401.2175","created_at":"2026-05-18T01:19:22.449408+00:00"},{"alias_kind":"arxiv_version","alias_value":"1401.2175v2","created_at":"2026-05-18T01:19:22.449408+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2175","created_at":"2026-05-18T01:19:22.449408+00:00"},{"alias_kind":"pith_short_12","alias_value":"JTOMM3II4RKE","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_16","alias_value":"JTOMM3II4RKEH7HM","created_at":"2026-05-18T12:28:35.611951+00:00"},{"alias_kind":"pith_short_8","alias_value":"JTOMM3II","created_at":"2026-05-18T12:28:35.611951+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/JTOMM3II4RKEH7HMGYL3B5I3C5","json":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5.json","graph_json":"https://pith.science/api/pith-number/JTOMM3II4RKEH7HMGYL3B5I3C5/graph.json","events_json":"https://pith.science/api/pith-number/JTOMM3II4RKEH7HMGYL3B5I3C5/events.json","paper":"https://pith.science/paper/JTOMM3II"},"agent_actions":{"view_html":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5","download_json":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5.json","view_paper":"https://pith.science/paper/JTOMM3II","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1401.2175&json=true","fetch_graph":"https://pith.science/api/pith-number/JTOMM3II4RKEH7HMGYL3B5I3C5/graph.json","fetch_events":"https://pith.science/api/pith-number/JTOMM3II4RKEH7HMGYL3B5I3C5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/action/storage_attestation","attest_author":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/action/author_attestation","sign_citation":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/action/citation_signature","submit_replication":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/action/replication_record"}},"created_at":"2026-05-18T01:19:22.449408+00:00","updated_at":"2026-05-18T01:19:22.449408+00:00"}