{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:NJBTDWWVNGCNJMZ77K2AGIZWUB","short_pith_number":"pith:NJBTDWWV","schema_version":"1.0","canonical_sha256":"6a4331dad56984d4b33ffab4032336a0579b9c78329ec3ad8edf4a70735094aa","source":{"kind":"arxiv","id":"2606.17732","version":1},"attestation_state":"computed","paper":{"title":"Four-Cycle Counting in Low-Degeneracy Graph Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pan Peng, Sebastian L\\\"uderssen, Stefan Neumann","submitted_at":"2026-06-16T09:49:45Z","abstract_excerpt":"We study the problem of $(1+\\varepsilon)$-approximating the number of four-cycles in graphs given as arbitrary order edge streams. We propose two new algorithms based on sampling induced subgraphs. Our first contribution is a two-pass algorithm that uses $\\widetilde{O}(\\kappa m / \\sqrt{T})$ space, where $m$ is the number of edges, $T$ is the number of four-cycles, and $\\kappa$ is the graph's degeneracy. This algorithm improves upon existing theoretical bounds and is provably optimal for constant-degeneracy graphs, matching the known $\\Omega(m/\\sqrt{T})$ lower bound up to lower-order factors. O"},"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":"2606.17732","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T09:49:45Z","cross_cats_sorted":[],"title_canon_sha256":"892de71dacd4b9095b84c9765a7f8951286946cf9488a712a4288aada20e553a","abstract_canon_sha256":"4156c27cfc6dd9ed9ef0c678dc710e859c186cfacae7c03351e5ef3dd7a6faed"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:20.570906Z","signature_b64":"ViS5EoLoZiPhgofLuQ7uLGFit4aunR8bnoemEe091hgTKiSFkpjHXtq1UREwhYDvYHgNGln8FnIoEB+5B30ACw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6a4331dad56984d4b33ffab4032336a0579b9c78329ec3ad8edf4a70735094aa","last_reissued_at":"2026-06-19T16:10:20.570572Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:20.570572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Four-Cycle Counting in Low-Degeneracy Graph Streams","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Pan Peng, Sebastian L\\\"uderssen, Stefan Neumann","submitted_at":"2026-06-16T09:49:45Z","abstract_excerpt":"We study the problem of $(1+\\varepsilon)$-approximating the number of four-cycles in graphs given as arbitrary order edge streams. We propose two new algorithms based on sampling induced subgraphs. Our first contribution is a two-pass algorithm that uses $\\widetilde{O}(\\kappa m / \\sqrt{T})$ space, where $m$ is the number of edges, $T$ is the number of four-cycles, and $\\kappa$ is the graph's degeneracy. This algorithm improves upon existing theoretical bounds and is provably optimal for constant-degeneracy graphs, matching the known $\\Omega(m/\\sqrt{T})$ lower bound up to lower-order factors. O"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17732","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/2606.17732/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":"2606.17732","created_at":"2026-06-19T16:10:20.570627+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.17732v1","created_at":"2026-06-19T16:10:20.570627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17732","created_at":"2026-06-19T16:10:20.570627+00:00"},{"alias_kind":"pith_short_12","alias_value":"NJBTDWWVNGCN","created_at":"2026-06-19T16:10:20.570627+00:00"},{"alias_kind":"pith_short_16","alias_value":"NJBTDWWVNGCNJMZ7","created_at":"2026-06-19T16:10:20.570627+00:00"},{"alias_kind":"pith_short_8","alias_value":"NJBTDWWV","created_at":"2026-06-19T16:10:20.570627+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/NJBTDWWVNGCNJMZ77K2AGIZWUB","json":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB.json","graph_json":"https://pith.science/api/pith-number/NJBTDWWVNGCNJMZ77K2AGIZWUB/graph.json","events_json":"https://pith.science/api/pith-number/NJBTDWWVNGCNJMZ77K2AGIZWUB/events.json","paper":"https://pith.science/paper/NJBTDWWV"},"agent_actions":{"view_html":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB","download_json":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB.json","view_paper":"https://pith.science/paper/NJBTDWWV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.17732&json=true","fetch_graph":"https://pith.science/api/pith-number/NJBTDWWVNGCNJMZ77K2AGIZWUB/graph.json","fetch_events":"https://pith.science/api/pith-number/NJBTDWWVNGCNJMZ77K2AGIZWUB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/action/storage_attestation","attest_author":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/action/author_attestation","sign_citation":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/action/citation_signature","submit_replication":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/action/replication_record"}},"created_at":"2026-06-19T16:10:20.570627+00:00","updated_at":"2026-06-19T16:10:20.570627+00:00"}