{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:JTOMM3II4RKEH7HMGYL3B5I3C5","short_pith_number":"pith:JTOMM3II","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"},"canonical_sha256":"4cdcc66d08e45443fcec3617b0f51b175acbd9787d1045c10474d9bc7978cc53","source":{"kind":"arxiv","id":"1401.2175","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2175","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2175v2","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2175","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"JTOMM3II4RKE","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTOMM3II4RKEH7HM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTOMM3II","created_at":"2026-05-18T12:28:35Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:JTOMM3II4RKEH7HMGYL3B5I3C5","target":"record","payload":{"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"},"canonical_sha256":"4cdcc66d08e45443fcec3617b0f51b175acbd9787d1045c10474d9bc7978cc53","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"},"source_kind":"arxiv","source_id":"1401.2175","source_version":2,"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-18T01:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7NyYBdpsyGyuWqHHIwvKg9Cp6Up88iVy3CVSaxoYev1nYrocuy6oRS6mQu/LCURUJIxfH7G3yiHxPKLDLQg+Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:37:07.942526Z"},"content_sha256":"f25721aa4d7f84e0b9203e000c28596a4101f0d8800c428bd1a01ac08dc3d19d","schema_version":"1.0","event_id":"sha256:f25721aa4d7f84e0b9203e000c28596a4101f0d8800c428bd1a01ac08dc3d19d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:JTOMM3II4RKEH7HMGYL3B5I3C5","target":"graph","payload":{"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"},"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-18T01:19:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jc0EDtSTFTg5TUw4+i8wUm5VD+vhFDqp7xaFJgkTKGIpgJviPM6SN2C4k4vAv3Nj+mOAdEoRIGRrk7ZFzE6FBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T03:37:07.942880Z"},"content_sha256":"5b6628cdf8b134243f5ce58f575bb753b8b1e17c0ee2d6a79cd9d1bdc15d1629","schema_version":"1.0","event_id":"sha256:5b6628cdf8b134243f5ce58f575bb753b8b1e17c0ee2d6a79cd9d1bdc15d1629"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/bundle.json","state_url":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/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-28T03:37:07Z","links":{"resolver":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5","bundle":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/bundle.json","state":"https://pith.science/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JTOMM3II4RKEH7HMGYL3B5I3C5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:JTOMM3II4RKEH7HMGYL3B5I3C5","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":"3a8201c563e966a392bc8f04fe86bea6690d1d733ccaed0e3cf9f3ef9326ddce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T21:37:20Z","title_canon_sha256":"d3c9c69f9117ae9faa8dba56108e14d11c61205afbdaa54fd2feb400f95cc76f"},"schema_version":"1.0","source":{"id":"1401.2175","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.2175","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"arxiv_version","alias_value":"1401.2175v2","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.2175","created_at":"2026-05-18T01:19:22Z"},{"alias_kind":"pith_short_12","alias_value":"JTOMM3II4RKE","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_16","alias_value":"JTOMM3II4RKEH7HM","created_at":"2026-05-18T12:28:35Z"},{"alias_kind":"pith_short_8","alias_value":"JTOMM3II","created_at":"2026-05-18T12:28:35Z"}],"graph_snapshots":[{"event_id":"sha256:5b6628cdf8b134243f5ce58f575bb753b8b1e17c0ee2d6a79cd9d1bdc15d1629","target":"graph","created_at":"2026-05-18T01:19:22Z","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":"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","authors_text":"Graham Cormode, Hossein Jowhari","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T21:37:20Z","title":"A Second Look at Counting Triangles in Graph Streams (revised)"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.2175","kind":"arxiv","version":2},"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:f25721aa4d7f84e0b9203e000c28596a4101f0d8800c428bd1a01ac08dc3d19d","target":"record","created_at":"2026-05-18T01:19:22Z","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":"3a8201c563e966a392bc8f04fe86bea6690d1d733ccaed0e3cf9f3ef9326ddce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-01-09T21:37:20Z","title_canon_sha256":"d3c9c69f9117ae9faa8dba56108e14d11c61205afbdaa54fd2feb400f95cc76f"},"schema_version":"1.0","source":{"id":"1401.2175","kind":"arxiv","version":2}},"canonical_sha256":"4cdcc66d08e45443fcec3617b0f51b175acbd9787d1045c10474d9bc7978cc53","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4cdcc66d08e45443fcec3617b0f51b175acbd9787d1045c10474d9bc7978cc53","first_computed_at":"2026-05-18T01:19:22.449287Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:19:22.449287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wc2FIzR5yg9kudjEBB0BWV1Sk+NsZ98coVcT/LjXLF/w0J1dYsTnLANPXalBDEtL+BAnCxiSjxs6OLNvb8F/BQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:19:22.449980Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.2175","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f25721aa4d7f84e0b9203e000c28596a4101f0d8800c428bd1a01ac08dc3d19d","sha256:5b6628cdf8b134243f5ce58f575bb753b8b1e17c0ee2d6a79cd9d1bdc15d1629"],"state_sha256":"e8134e93e944b74ae7405ea00175aed9f7ffdfbba9a7831a6e6d2d9208c08acf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tT3yL0Cy+P9XYxoguh9ox4lRIQ/6/SwaJZompEBiNH5+SXGF80wovhNWBDhyQjZU6z8IlELlC009g2+6UYsGAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T03:37:07.944849Z","bundle_sha256":"040c24b014f83446705808dac3a0990d0568b0109f69650a15080c18f0789e85"}}