{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:666WHWZKUFLKB5RXPV7TA5IRCD","short_pith_number":"pith:666WHWZK","schema_version":"1.0","canonical_sha256":"f7bd63db2aa156a0f6377d7f30751110e217c28a1470094adf72a2480f2b662e","source":{"kind":"arxiv","id":"2007.13466","version":1},"attestation_state":"computed","paper":{"title":"Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sofya Vorotnikova","submitted_at":"2020-07-27T12:12:21Z","abstract_excerpt":"The problem of counting small subgraphs, and specifically cycles, in the streaming model received a lot of attention over the past few years. In this paper, we consider arbitrary order insertion-only streams, improving over the state-of-the-art result on counting 4-cycles. Our algorithm computes a $(1+\\epsilon)$-approximation by taking three passes over the stream and using space $O(\\frac{m \\log n}{\\epsilon^2 T^{1/3}})$, where $m$ is the number of edges in the graph and $T$ is the number of 4-cycles."},"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":"2007.13466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-27T12:12:21Z","cross_cats_sorted":[],"title_canon_sha256":"cb3a61c4ec461898873ede482470a2e25bb1c84c64287ed88932f4c873e8d330","abstract_canon_sha256":"e2b1fddebb1a35ebcb82f66354a688e287b608d59a836a947df5ae712d1f0184"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:22:24.465733Z","signature_b64":"Gro8sVlfWngduhNk2jNcAQRl/TdiBHATIe8ztlxFfa6gMmWb9/1yhpmoo1LGdLHFBufRGJSlhBoyj/q92aCnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7bd63db2aa156a0f6377d7f30751110e217c28a1470094adf72a2480f2b662e","last_reissued_at":"2026-07-05T01:22:24.465191Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:22:24.465191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sofya Vorotnikova","submitted_at":"2020-07-27T12:12:21Z","abstract_excerpt":"The problem of counting small subgraphs, and specifically cycles, in the streaming model received a lot of attention over the past few years. In this paper, we consider arbitrary order insertion-only streams, improving over the state-of-the-art result on counting 4-cycles. Our algorithm computes a $(1+\\epsilon)$-approximation by taking three passes over the stream and using space $O(\\frac{m \\log n}{\\epsilon^2 T^{1/3}})$, where $m$ is the number of edges in the graph and $T$ is the number of 4-cycles."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.13466","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/2007.13466/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":"2007.13466","created_at":"2026-07-05T01:22:24.465253+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.13466v1","created_at":"2026-07-05T01:22:24.465253+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.13466","created_at":"2026-07-05T01:22:24.465253+00:00"},{"alias_kind":"pith_short_12","alias_value":"666WHWZKUFLK","created_at":"2026-07-05T01:22:24.465253+00:00"},{"alias_kind":"pith_short_16","alias_value":"666WHWZKUFLKB5RX","created_at":"2026-07-05T01:22:24.465253+00:00"},{"alias_kind":"pith_short_8","alias_value":"666WHWZK","created_at":"2026-07-05T01:22:24.465253+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.17732","citing_title":"Four-Cycle Counting in Low-Degeneracy Graph Streams","ref_index":39,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD","json":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD.json","graph_json":"https://pith.science/api/pith-number/666WHWZKUFLKB5RXPV7TA5IRCD/graph.json","events_json":"https://pith.science/api/pith-number/666WHWZKUFLKB5RXPV7TA5IRCD/events.json","paper":"https://pith.science/paper/666WHWZK"},"agent_actions":{"view_html":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD","download_json":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD.json","view_paper":"https://pith.science/paper/666WHWZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.13466&json=true","fetch_graph":"https://pith.science/api/pith-number/666WHWZKUFLKB5RXPV7TA5IRCD/graph.json","fetch_events":"https://pith.science/api/pith-number/666WHWZKUFLKB5RXPV7TA5IRCD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/action/storage_attestation","attest_author":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/action/author_attestation","sign_citation":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/action/citation_signature","submit_replication":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/action/replication_record"}},"created_at":"2026-07-05T01:22:24.465253+00:00","updated_at":"2026-07-05T01:22:24.465253+00:00"}