{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:MBBA7T2SJ25RY3NNR6NQDSC7O5","short_pith_number":"pith:MBBA7T2S","schema_version":"1.0","canonical_sha256":"60420fcf524ebb1c6dad8f9b01c85f7763e270c00234d53eab46d066cc95d1eb","source":{"kind":"arxiv","id":"2203.09572","version":1},"attestation_state":"computed","paper":{"title":"Triangle and Four Cycle Counting with Predictions in Graph Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Honghao Lin, Justin Y. Chen, Michael Zhang, Piotr Indyk, Ronitt Rubinfeld, Sandeep Silwal, Shyam Narayanan, Tal Wagner, Talya Eden","submitted_at":"2022-03-17T19:26:00Z","abstract_excerpt":"We propose data-driven one-pass streaming algorithms for estimating the number of triangles and four cycles, two fundamental problems in graph analytics that are widely studied in the graph data stream literature. Recently, (Hsu 2018) and (Jiang 2020) applied machine learning techniques in other data stream problems, using a trained oracle that can predict certain properties of the stream elements to improve on prior \"classical\" algorithms that did not use oracles. In this paper, we explore the power of a \"heavy edge\" oracle in multiple graph edge streaming models. In the adjacency list model,"},"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":"2203.09572","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2022-03-17T19:26:00Z","cross_cats_sorted":["cs.LG"],"title_canon_sha256":"e6d21802aae324b306c6cfa2373b4f8b4c646f799d1b4af649cacce51dcb9841","abstract_canon_sha256":"118ca362d5dfc7ca912b34045893eb1cee33381a15c782207afe6a27f23c0e6f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:06:20.842171Z","signature_b64":"+1/gIyyL43tlMvobN99YqsBSFnXIj6myy6uFVMP9zCgtiPRFeTA2d1EcZcgIXJGM83hFExdAlBdt+2LP/G+6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60420fcf524ebb1c6dad8f9b01c85f7763e270c00234d53eab46d066cc95d1eb","last_reissued_at":"2026-07-05T04:06:20.841717Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:06:20.841717Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle and Four Cycle Counting with Predictions in Graph Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.LG"],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Honghao Lin, Justin Y. Chen, Michael Zhang, Piotr Indyk, Ronitt Rubinfeld, Sandeep Silwal, Shyam Narayanan, Tal Wagner, Talya Eden","submitted_at":"2022-03-17T19:26:00Z","abstract_excerpt":"We propose data-driven one-pass streaming algorithms for estimating the number of triangles and four cycles, two fundamental problems in graph analytics that are widely studied in the graph data stream literature. Recently, (Hsu 2018) and (Jiang 2020) applied machine learning techniques in other data stream problems, using a trained oracle that can predict certain properties of the stream elements to improve on prior \"classical\" algorithms that did not use oracles. In this paper, we explore the power of a \"heavy edge\" oracle in multiple graph edge streaming models. In the adjacency list model,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2203.09572","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/2203.09572/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":"2203.09572","created_at":"2026-07-05T04:06:20.841788+00:00"},{"alias_kind":"arxiv_version","alias_value":"2203.09572v1","created_at":"2026-07-05T04:06:20.841788+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2203.09572","created_at":"2026-07-05T04:06:20.841788+00:00"},{"alias_kind":"pith_short_12","alias_value":"MBBA7T2SJ25R","created_at":"2026-07-05T04:06:20.841788+00:00"},{"alias_kind":"pith_short_16","alias_value":"MBBA7T2SJ25RY3NN","created_at":"2026-07-05T04:06:20.841788+00:00"},{"alias_kind":"pith_short_8","alias_value":"MBBA7T2S","created_at":"2026-07-05T04:06:20.841788+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":11,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5","json":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5.json","graph_json":"https://pith.science/api/pith-number/MBBA7T2SJ25RY3NNR6NQDSC7O5/graph.json","events_json":"https://pith.science/api/pith-number/MBBA7T2SJ25RY3NNR6NQDSC7O5/events.json","paper":"https://pith.science/paper/MBBA7T2S"},"agent_actions":{"view_html":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5","download_json":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5.json","view_paper":"https://pith.science/paper/MBBA7T2S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2203.09572&json=true","fetch_graph":"https://pith.science/api/pith-number/MBBA7T2SJ25RY3NNR6NQDSC7O5/graph.json","fetch_events":"https://pith.science/api/pith-number/MBBA7T2SJ25RY3NNR6NQDSC7O5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5/action/storage_attestation","attest_author":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5/action/author_attestation","sign_citation":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5/action/citation_signature","submit_replication":"https://pith.science/pith/MBBA7T2SJ25RY3NNR6NQDSC7O5/action/replication_record"}},"created_at":"2026-07-05T04:06:20.841788+00:00","updated_at":"2026-07-05T04:06:20.841788+00:00"}