{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:4VCKY5WTPSUSPM2QQ7NCZFVC6D","short_pith_number":"pith:4VCKY5WT","schema_version":"1.0","canonical_sha256":"e544ac76d37ca927b35087da2c96a2f0f0494b25e983617e1fa060f370cd4889","source":{"kind":"arxiv","id":"2409.15205","version":1},"attestation_state":"computed","paper":{"title":"Fast and Accurate Triangle Counting in Graph Streams Using Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Cristian Boldrin, Fabio Vandin","submitted_at":"2024-09-23T16:52:11Z","abstract_excerpt":"In this work, we present the first efficient and practical algorithm for estimating the number of triangles in a graph stream using predictions. Our algorithm combines waiting room sampling and reservoir sampling with a predictor for the heaviness of edges, that is, the number of triangles in which an edge is involved. As a result, our algorithm is fast, provides guarantees on the amount of memory used, and exploits the additional information provided by the predictor to produce highly accurate estimates. We also propose a simple and domain-independent predictor, based on the degree of nodes, "},"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":"2409.15205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2024-09-23T16:52:11Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"016d499bd62bcfe4ac6197fe6d6856c4a6126e2d18a9d54d4e224d55d4917152","abstract_canon_sha256":"ed7334db9d2a6319a3d9c9b75b2863c94c14244e84043ddc513d0533f1aa336e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:10:37.616861Z","signature_b64":"7m6izYZL+bn/v7FrApydRZ+GrIgsEJJ1PSeAd2oO7Iziw8L78og+1hP3Li8bvIGtF7KXjVxgyCXwWYpGSX+bBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e544ac76d37ca927b35087da2c96a2f0f0494b25e983617e1fa060f370cd4889","last_reissued_at":"2026-07-05T09:10:37.616395Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:10:37.616395Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fast and Accurate Triangle Counting in Graph Streams Using Predictions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"Cristian Boldrin, Fabio Vandin","submitted_at":"2024-09-23T16:52:11Z","abstract_excerpt":"In this work, we present the first efficient and practical algorithm for estimating the number of triangles in a graph stream using predictions. Our algorithm combines waiting room sampling and reservoir sampling with a predictor for the heaviness of edges, that is, the number of triangles in which an edge is involved. As a result, our algorithm is fast, provides guarantees on the amount of memory used, and exploits the additional information provided by the predictor to produce highly accurate estimates. We also propose a simple and domain-independent predictor, based on the degree of nodes, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.15205","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.15205/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":"2409.15205","created_at":"2026-07-05T09:10:37.616456+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.15205v1","created_at":"2026-07-05T09:10:37.616456+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.15205","created_at":"2026-07-05T09:10:37.616456+00:00"},{"alias_kind":"pith_short_12","alias_value":"4VCKY5WTPSUS","created_at":"2026-07-05T09:10:37.616456+00:00"},{"alias_kind":"pith_short_16","alias_value":"4VCKY5WTPSUSPM2Q","created_at":"2026-07-05T09:10:37.616456+00:00"},{"alias_kind":"pith_short_8","alias_value":"4VCKY5WT","created_at":"2026-07-05T09:10:37.616456+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2506.13173","citing_title":"Efficient Approximate Temporal Triangle Counting in Streaming with Predictions","ref_index":7,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D","json":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D.json","graph_json":"https://pith.science/api/pith-number/4VCKY5WTPSUSPM2QQ7NCZFVC6D/graph.json","events_json":"https://pith.science/api/pith-number/4VCKY5WTPSUSPM2QQ7NCZFVC6D/events.json","paper":"https://pith.science/paper/4VCKY5WT"},"agent_actions":{"view_html":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D","download_json":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D.json","view_paper":"https://pith.science/paper/4VCKY5WT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.15205&json=true","fetch_graph":"https://pith.science/api/pith-number/4VCKY5WTPSUSPM2QQ7NCZFVC6D/graph.json","fetch_events":"https://pith.science/api/pith-number/4VCKY5WTPSUSPM2QQ7NCZFVC6D/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D/action/storage_attestation","attest_author":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D/action/author_attestation","sign_citation":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D/action/citation_signature","submit_replication":"https://pith.science/pith/4VCKY5WTPSUSPM2QQ7NCZFVC6D/action/replication_record"}},"created_at":"2026-07-05T09:10:37.616456+00:00","updated_at":"2026-07-05T09:10:37.616456+00:00"}