{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:GM22EGV2QVPWBTTOORNPBFKQDP","short_pith_number":"pith:GM22EGV2","schema_version":"1.0","canonical_sha256":"3335a21aba855f60ce6e745af095501bcdff73a8fdeb0194c0f725d15c359c35","source":{"kind":"arxiv","id":"2105.01785","version":2},"attestation_state":"computed","paper":{"title":"An Optimal Algorithm for Triangle Counting in the Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Kallaugher, Rajesh Jayaram","submitted_at":"2021-05-04T22:39:38Z","abstract_excerpt":"We present a new algorithm for approximating the number of triangles in a graph $G$ whose edges arrive as an arbitrary order stream. If $m$ is the number of edges in $G$, $T$ the number of triangles, $\\Delta_E$ the maximum number of triangles which share a single edge, and $\\Delta_V$ the maximum number of triangles which share a single vertex, then our algorithm requires space: \\[ \\widetilde{O}\\left(\\frac{m}{T}\\cdot \\left(\\Delta_E + \\sqrt{\\Delta_V}\\right)\\right) \\] Taken with the $\\Omega\\left(\\frac{m \\Delta_E}{T}\\right)$ lower bound of Braverman, Ostrovsky, and Vilenchik (ICALP 2013), and the "},"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":"2105.01785","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2021-05-04T22:39:38Z","cross_cats_sorted":[],"title_canon_sha256":"00e7dc50bbd55ef3e416ecd53f1a4c9705c5950af571bc3ea53e9002fd040f11","abstract_canon_sha256":"9f81d519d758a6a4e9a392a39c57555c397d1e5b7597fe0ac90b0000a115c395"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:58:06.518911Z","signature_b64":"2u3+ULxVkufJ4vk6pW4+qRJf2riGuGPtQ8v5MqxyzokQ21nypk02t78F89WyaGXTLOdl8JQ5AZr1/UgOdV1VCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3335a21aba855f60ce6e745af095501bcdff73a8fdeb0194c0f725d15c359c35","last_reissued_at":"2026-07-05T02:58:06.518565Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:58:06.518565Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Optimal Algorithm for Triangle Counting in the Stream","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"John Kallaugher, Rajesh Jayaram","submitted_at":"2021-05-04T22:39:38Z","abstract_excerpt":"We present a new algorithm for approximating the number of triangles in a graph $G$ whose edges arrive as an arbitrary order stream. If $m$ is the number of edges in $G$, $T$ the number of triangles, $\\Delta_E$ the maximum number of triangles which share a single edge, and $\\Delta_V$ the maximum number of triangles which share a single vertex, then our algorithm requires space: \\[ \\widetilde{O}\\left(\\frac{m}{T}\\cdot \\left(\\Delta_E + \\sqrt{\\Delta_V}\\right)\\right) \\] Taken with the $\\Omega\\left(\\frac{m \\Delta_E}{T}\\right)$ lower bound of Braverman, Ostrovsky, and Vilenchik (ICALP 2013), and the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2105.01785","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2105.01785/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2105.01785","created_at":"2026-07-05T02:58:06.518627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2105.01785v2","created_at":"2026-07-05T02:58:06.518627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2105.01785","created_at":"2026-07-05T02:58:06.518627+00:00"},{"alias_kind":"pith_short_12","alias_value":"GM22EGV2QVPW","created_at":"2026-07-05T02:58:06.518627+00:00"},{"alias_kind":"pith_short_16","alias_value":"GM22EGV2QVPWBTTO","created_at":"2026-07-05T02:58:06.518627+00:00"},{"alias_kind":"pith_short_8","alias_value":"GM22EGV2","created_at":"2026-07-05T02:58:06.518627+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2607.08517","citing_title":"Quantum Communication Lower Bounds for Search Problems via Matrix Discrepancy","ref_index":17,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP","json":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP.json","graph_json":"https://pith.science/api/pith-number/GM22EGV2QVPWBTTOORNPBFKQDP/graph.json","events_json":"https://pith.science/api/pith-number/GM22EGV2QVPWBTTOORNPBFKQDP/events.json","paper":"https://pith.science/paper/GM22EGV2"},"agent_actions":{"view_html":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP","download_json":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP.json","view_paper":"https://pith.science/paper/GM22EGV2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2105.01785&json=true","fetch_graph":"https://pith.science/api/pith-number/GM22EGV2QVPWBTTOORNPBFKQDP/graph.json","fetch_events":"https://pith.science/api/pith-number/GM22EGV2QVPWBTTOORNPBFKQDP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP/action/storage_attestation","attest_author":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP/action/author_attestation","sign_citation":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP/action/citation_signature","submit_replication":"https://pith.science/pith/GM22EGV2QVPWBTTOORNPBFKQDP/action/replication_record"}},"created_at":"2026-07-05T02:58:06.518627+00:00","updated_at":"2026-07-05T02:58:06.518627+00:00"}