{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:Y3SKBZ3A5WD7ICMO6KMJDXIDA7","short_pith_number":"pith:Y3SKBZ3A","schema_version":"1.0","canonical_sha256":"c6e4a0e760ed87f4098ef29891dd0307d2f4735e1a72600cd7ce2eb22237483c","source":{"kind":"arxiv","id":"1610.02066","version":3},"attestation_state":"computed","paper":{"title":"A Hybrid Sampling Scheme for Triangle Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Price, John Kallaugher","submitted_at":"2016-10-06T21:00:01Z","abstract_excerpt":"We study the problem of estimating the number of triangles in a graph stream. No streaming algorithm can get sublinear space on all graphs, so methods in this area bound the space in terms of parameters of the input graph such as the maximum number of triangles sharing a single edge. We give a sampling algorithm that is additionally parameterized by the maximum number of triangles sharing a single vertex. Our bound matches the best known turnstile results in all graphs, and gets better performance on simple graphs like $G(n, p)$ or a set of independent triangles.\n  We complement the upper boun"},"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":"1610.02066","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-10-06T21:00:01Z","cross_cats_sorted":[],"title_canon_sha256":"eb9bf810f38161ea0e0ccefe6c11517d69b0174382e239895a611d3bbaf57da8","abstract_canon_sha256":"e38505d74161ff7a299e2483f1bff8c7ad402b6c745aeecc493c6a616c9ac164"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:23.043834Z","signature_b64":"/Uh0Vn2t1VxFONhg4JD+qjiW+9j9qQjpqYum1uX64nnJeg3JJJO3mAm7PNWbkvAmjH5N/qEoi+PjRtR/j9QwCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6e4a0e760ed87f4098ef29891dd0307d2f4735e1a72600cd7ce2eb22237483c","last_reissued_at":"2026-05-17T23:48:23.043287Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:23.043287Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Hybrid Sampling Scheme for Triangle Counting","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eric Price, John Kallaugher","submitted_at":"2016-10-06T21:00:01Z","abstract_excerpt":"We study the problem of estimating the number of triangles in a graph stream. No streaming algorithm can get sublinear space on all graphs, so methods in this area bound the space in terms of parameters of the input graph such as the maximum number of triangles sharing a single edge. We give a sampling algorithm that is additionally parameterized by the maximum number of triangles sharing a single vertex. Our bound matches the best known turnstile results in all graphs, and gets better performance on simple graphs like $G(n, p)$ or a set of independent triangles.\n  We complement the upper boun"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1610.02066","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":"1610.02066","created_at":"2026-05-17T23:48:23.043403+00:00"},{"alias_kind":"arxiv_version","alias_value":"1610.02066v3","created_at":"2026-05-17T23:48:23.043403+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1610.02066","created_at":"2026-05-17T23:48:23.043403+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y3SKBZ3A5WD7","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y3SKBZ3A5WD7ICMO","created_at":"2026-05-18T12:30:51.357362+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y3SKBZ3A","created_at":"2026-05-18T12:30:51.357362+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/Y3SKBZ3A5WD7ICMO6KMJDXIDA7","json":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7.json","graph_json":"https://pith.science/api/pith-number/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/graph.json","events_json":"https://pith.science/api/pith-number/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/events.json","paper":"https://pith.science/paper/Y3SKBZ3A"},"agent_actions":{"view_html":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7","download_json":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7.json","view_paper":"https://pith.science/paper/Y3SKBZ3A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1610.02066&json=true","fetch_graph":"https://pith.science/api/pith-number/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/graph.json","fetch_events":"https://pith.science/api/pith-number/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/action/storage_attestation","attest_author":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/action/author_attestation","sign_citation":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/action/citation_signature","submit_replication":"https://pith.science/pith/Y3SKBZ3A5WD7ICMO6KMJDXIDA7/action/replication_record"}},"created_at":"2026-05-17T23:48:23.043403+00:00","updated_at":"2026-05-17T23:48:23.043403+00:00"}