{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HCI6E6LN7JLYJ2MV25TLRH347E","short_pith_number":"pith:HCI6E6LN","canonical_record":{"source":{"id":"1304.1458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T18:30:28Z","cross_cats_sorted":[],"title_canon_sha256":"9f6dcc8d4c1b5bbc661050ab16b7b1a4393c753fe341542434478b423dfbaf89","abstract_canon_sha256":"477e4b0abe794ccecbea25083f3a1c5b3b218327bf8398a0f005a871b14ef54f"},"schema_version":"1.0"},"canonical_sha256":"3891e2796dfa5784e995d766b89f7cf9190a4db0f59f92c7831f0ecca2b06c4c","source":{"kind":"arxiv","id":"1304.1458","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1458","created_at":"2026-05-18T03:28:56Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1458v1","created_at":"2026-05-18T03:28:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1458","created_at":"2026-05-18T03:28:56Z"},{"alias_kind":"pith_short_12","alias_value":"HCI6E6LN7JLY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HCI6E6LN7JLYJ2MV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HCI6E6LN","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HCI6E6LN7JLYJ2MV25TLRH347E","target":"record","payload":{"canonical_record":{"source":{"id":"1304.1458","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T18:30:28Z","cross_cats_sorted":[],"title_canon_sha256":"9f6dcc8d4c1b5bbc661050ab16b7b1a4393c753fe341542434478b423dfbaf89","abstract_canon_sha256":"477e4b0abe794ccecbea25083f3a1c5b3b218327bf8398a0f005a871b14ef54f"},"schema_version":"1.0"},"canonical_sha256":"3891e2796dfa5784e995d766b89f7cf9190a4db0f59f92c7831f0ecca2b06c4c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:28:56.713181Z","signature_b64":"IJRqv6CWGMfWqqqVmis2tlZ2yUME9iVoxFXN/ZU7pFRxdjsue0Kyp0Iy1I/jxYm+LS8aUyaZIwQ25RygtPCOCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3891e2796dfa5784e995d766b89f7cf9190a4db0f59f92c7831f0ecca2b06c4c","last_reissued_at":"2026-05-18T03:28:56.712498Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:28:56.712498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1304.1458","source_version":1,"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:28:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+Ncemtjcr50wqyI5SBdFzehzJfvVf1e+R7EYJTUHuGCk8ZMhgW5BK9RRO/N4hAG5s+32yMdV5kGWMnTW8laAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:11:51.219750Z"},"content_sha256":"031893616cb7a599fc35cb73bd352ba20c8915d102dab7bc3455bdbe9370459b","schema_version":"1.0","event_id":"sha256:031893616cb7a599fc35cb73bd352ba20c8915d102dab7bc3455bdbe9370459b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HCI6E6LN7JLYJ2MV25TLRH347E","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"How Hard is Counting Triangles in the Streaming Model","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dan Vilenchik, Rafail Ostrovsky, Vladimir Braverman","submitted_at":"2013-04-04T18:30:28Z","abstract_excerpt":"The problem of (approximately) counting the number of triangles in a graph is one of the basic problems in graph theory. In this paper we study the problem in the streaming model. We study the amount of memory required by a randomized algorithm to solve this problem. In case the algorithm is allowed one pass over the stream, we present a best possible lower bound of $\\Omega(m)$ for graphs $G$ with $m$ edges on $n$ vertices. If a constant number of passes is allowed, we show a lower bound of $\\Omega(m/T)$, $T$ the number of triangles. We match, in some sense, this lower bound with a 2-pass $O(m"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1458","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"},"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:28:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nlc64XugaLMbefJ0u+hCCUa7K/SOGL/xEMQ5jzY635YIQmq3OzDphMwIfmghVF2euhveCuw7sP0+WrExcEGhBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:11:51.220427Z"},"content_sha256":"0386845f03affcd49ed759f1558a22d9719cea949d759592c1ce5e0ba9a5ae73","schema_version":"1.0","event_id":"sha256:0386845f03affcd49ed759f1558a22d9719cea949d759592c1ce5e0ba9a5ae73"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HCI6E6LN7JLYJ2MV25TLRH347E/bundle.json","state_url":"https://pith.science/pith/HCI6E6LN7JLYJ2MV25TLRH347E/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HCI6E6LN7JLYJ2MV25TLRH347E/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-26T18:11:51Z","links":{"resolver":"https://pith.science/pith/HCI6E6LN7JLYJ2MV25TLRH347E","bundle":"https://pith.science/pith/HCI6E6LN7JLYJ2MV25TLRH347E/bundle.json","state":"https://pith.science/pith/HCI6E6LN7JLYJ2MV25TLRH347E/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HCI6E6LN7JLYJ2MV25TLRH347E/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HCI6E6LN7JLYJ2MV25TLRH347E","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":"477e4b0abe794ccecbea25083f3a1c5b3b218327bf8398a0f005a871b14ef54f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T18:30:28Z","title_canon_sha256":"9f6dcc8d4c1b5bbc661050ab16b7b1a4393c753fe341542434478b423dfbaf89"},"schema_version":"1.0","source":{"id":"1304.1458","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1304.1458","created_at":"2026-05-18T03:28:56Z"},{"alias_kind":"arxiv_version","alias_value":"1304.1458v1","created_at":"2026-05-18T03:28:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.1458","created_at":"2026-05-18T03:28:56Z"},{"alias_kind":"pith_short_12","alias_value":"HCI6E6LN7JLY","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HCI6E6LN7JLYJ2MV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HCI6E6LN","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:0386845f03affcd49ed759f1558a22d9719cea949d759592c1ce5e0ba9a5ae73","target":"graph","created_at":"2026-05-18T03:28:56Z","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":"The problem of (approximately) counting the number of triangles in a graph is one of the basic problems in graph theory. In this paper we study the problem in the streaming model. We study the amount of memory required by a randomized algorithm to solve this problem. In case the algorithm is allowed one pass over the stream, we present a best possible lower bound of $\\Omega(m)$ for graphs $G$ with $m$ edges on $n$ vertices. If a constant number of passes is allowed, we show a lower bound of $\\Omega(m/T)$, $T$ the number of triangles. We match, in some sense, this lower bound with a 2-pass $O(m","authors_text":"Dan Vilenchik, Rafail Ostrovsky, Vladimir Braverman","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T18:30:28Z","title":"How Hard is Counting Triangles in the Streaming Model"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.1458","kind":"arxiv","version":1},"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:031893616cb7a599fc35cb73bd352ba20c8915d102dab7bc3455bdbe9370459b","target":"record","created_at":"2026-05-18T03:28:56Z","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":"477e4b0abe794ccecbea25083f3a1c5b3b218327bf8398a0f005a871b14ef54f","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-04T18:30:28Z","title_canon_sha256":"9f6dcc8d4c1b5bbc661050ab16b7b1a4393c753fe341542434478b423dfbaf89"},"schema_version":"1.0","source":{"id":"1304.1458","kind":"arxiv","version":1}},"canonical_sha256":"3891e2796dfa5784e995d766b89f7cf9190a4db0f59f92c7831f0ecca2b06c4c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3891e2796dfa5784e995d766b89f7cf9190a4db0f59f92c7831f0ecca2b06c4c","first_computed_at":"2026-05-18T03:28:56.712498Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:28:56.712498Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IJRqv6CWGMfWqqqVmis2tlZ2yUME9iVoxFXN/ZU7pFRxdjsue0Kyp0Iy1I/jxYm+LS8aUyaZIwQ25RygtPCOCA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:28:56.713181Z","signed_message":"canonical_sha256_bytes"},"source_id":"1304.1458","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:031893616cb7a599fc35cb73bd352ba20c8915d102dab7bc3455bdbe9370459b","sha256:0386845f03affcd49ed759f1558a22d9719cea949d759592c1ce5e0ba9a5ae73"],"state_sha256":"15b2b13a2ecf3c912cd7241a7b8f67deb24b6014232f373ccc407c0dc0a845ab"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tG9fon5qhKjxKFwXRiJhzYLCCpFFM9dqM5Pr+lU0cIitgOCXBlDFOBAwToBkwcMhtHOSjWeLgV0UxJ+k0KFkBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:11:51.223134Z","bundle_sha256":"da2b11027feb78d49aac63b43e45799a01664d70ec7f00f809b4074de8d06ac6"}}