{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NIZTTHUBSJSFZF757AHTEEPZZE","short_pith_number":"pith:NIZTTHUB","schema_version":"1.0","canonical_sha256":"6a33399e8192645c97fdf80f3211f9c9317ea4bde060dbef4b7a8935971e7d67","source":{"kind":"arxiv","id":"1212.2264","version":3},"attestation_state":"computed","paper":{"title":"A space efficient streaming algorithm for triangle counting using the birthday paradox","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Ali Pinar, C. Seshadhri, Madhav Jha","submitted_at":"2012-12-11T01:02:12Z","abstract_excerpt":"We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a stream of edges. Our procedure is based on the classic probabilistic result, the birthday paradox. When the transitivity is constant and there are more edges than wedges (common properties for social networks), we can prove that our algorithm requires $O(\\sqrt{n})$ space ($n$ is the number of vertices) to provide accurate estimates. We run a detailed set of experiments on a variety of real graphs and demonstrate tha"},"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":"1212.2264","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2012-12-11T01:02:12Z","cross_cats_sorted":["cs.DM","cs.SI"],"title_canon_sha256":"a252f1c62af6d9c2b81124c58c512ebe84ee5befcbaa4d6f550c11ea38660c7e","abstract_canon_sha256":"fff231099d28d97401b660b45ea88a0c860bd91ca3fe979349fb9fa5486c4685"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:35.758150Z","signature_b64":"97PyNaQjsuZMQhq9KFrfymftDZWv6K8jSK3K/m/TpBh5a1H+jEYUlzo7IOaP3Jnjf7NKCSXbEDA9KMLGPAgzDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a33399e8192645c97fdf80f3211f9c9317ea4bde060dbef4b7a8935971e7d67","last_reissued_at":"2026-05-18T03:05:35.757600Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:35.757600Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A space efficient streaming algorithm for triangle counting using the birthday paradox","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.SI"],"primary_cat":"cs.DS","authors_text":"Ali Pinar, C. Seshadhri, Madhav Jha","submitted_at":"2012-12-11T01:02:12Z","abstract_excerpt":"We design a space efficient algorithm that approximates the transitivity (global clustering coefficient) and total triangle count with only a single pass through a graph given as a stream of edges. Our procedure is based on the classic probabilistic result, the birthday paradox. When the transitivity is constant and there are more edges than wedges (common properties for social networks), we can prove that our algorithm requires $O(\\sqrt{n})$ space ($n$ is the number of vertices) to provide accurate estimates. We run a detailed set of experiments on a variety of real graphs and demonstrate tha"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.2264","kind":"arxiv","version":3},"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":"1212.2264","created_at":"2026-05-18T03:05:35.757669+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.2264v3","created_at":"2026-05-18T03:05:35.757669+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.2264","created_at":"2026-05-18T03:05:35.757669+00:00"},{"alias_kind":"pith_short_12","alias_value":"NIZTTHUBSJSF","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NIZTTHUBSJSFZF75","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NIZTTHUB","created_at":"2026-05-18T12:27:16.716162+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/NIZTTHUBSJSFZF757AHTEEPZZE","json":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE.json","graph_json":"https://pith.science/api/pith-number/NIZTTHUBSJSFZF757AHTEEPZZE/graph.json","events_json":"https://pith.science/api/pith-number/NIZTTHUBSJSFZF757AHTEEPZZE/events.json","paper":"https://pith.science/paper/NIZTTHUB"},"agent_actions":{"view_html":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE","download_json":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE.json","view_paper":"https://pith.science/paper/NIZTTHUB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.2264&json=true","fetch_graph":"https://pith.science/api/pith-number/NIZTTHUBSJSFZF757AHTEEPZZE/graph.json","fetch_events":"https://pith.science/api/pith-number/NIZTTHUBSJSFZF757AHTEEPZZE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE/action/storage_attestation","attest_author":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE/action/author_attestation","sign_citation":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE/action/citation_signature","submit_replication":"https://pith.science/pith/NIZTTHUBSJSFZF757AHTEEPZZE/action/replication_record"}},"created_at":"2026-05-18T03:05:35.757669+00:00","updated_at":"2026-05-18T03:05:35.757669+00:00"}