{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:NJBTDWWVNGCNJMZ77K2AGIZWUB","short_pith_number":"pith:NJBTDWWV","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"},"canonical_sha256":"6a4331dad56984d4b33ffab4032336a0579b9c78329ec3ad8edf4a70735094aa","source":{"kind":"arxiv","id":"2606.17732","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17732","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17732v1","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17732","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"NJBTDWWVNGCN","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"NJBTDWWVNGCNJMZ7","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"NJBTDWWV","created_at":"2026-06-19T16:10:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:NJBTDWWVNGCNJMZ77K2AGIZWUB","target":"record","payload":{"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"},"canonical_sha256":"6a4331dad56984d4b33ffab4032336a0579b9c78329ec3ad8edf4a70735094aa","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"},"source_kind":"arxiv","source_id":"2606.17732","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"d4+DdG4yYsgFZzG+KOTYHLDb1y6RFj50c5NzsJcglgWJ/ULhdKqGb1JmiN7vPpxVHtv6fgJ8oR0cZPWEzRbMDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:44:41.453121Z"},"content_sha256":"1154e2eb2606e30ac35e4dd4d42b05e3e10cfb6f75d30e796d9b781d9be98e49","schema_version":"1.0","event_id":"sha256:1154e2eb2606e30ac35e4dd4d42b05e3e10cfb6f75d30e796d9b781d9be98e49"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:NJBTDWWVNGCNJMZ77K2AGIZWUB","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-19T16:10:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3RntmZ/qm8cZWvyMwaTW1puaFBRAuroB7t7P7vaj9onW/6sB3Q8jHxMbSw/AHAsN85TH/6PTWym2vKVFlNGtAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T17:44:41.453700Z"},"content_sha256":"fdcd110d98a20233e28be6b724ad60677e5c5c584277064676162d416d4f22ec","schema_version":"1.0","event_id":"sha256:fdcd110d98a20233e28be6b724ad60677e5c5c584277064676162d416d4f22ec"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/bundle.json","state_url":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-11T17:44:41Z","links":{"resolver":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB","bundle":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/bundle.json","state":"https://pith.science/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NJBTDWWVNGCNJMZ77K2AGIZWUB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:NJBTDWWVNGCNJMZ77K2AGIZWUB","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"4156c27cfc6dd9ed9ef0c678dc710e859c186cfacae7c03351e5ef3dd7a6faed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T09:49:45Z","title_canon_sha256":"892de71dacd4b9095b84c9765a7f8951286946cf9488a712a4288aada20e553a"},"schema_version":"1.0","source":{"id":"2606.17732","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.17732","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"arxiv_version","alias_value":"2606.17732v1","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.17732","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"pith_short_12","alias_value":"NJBTDWWVNGCN","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"pith_short_16","alias_value":"NJBTDWWVNGCNJMZ7","created_at":"2026-06-19T16:10:20Z"},{"alias_kind":"pith_short_8","alias_value":"NJBTDWWV","created_at":"2026-06-19T16:10:20Z"}],"graph_snapshots":[{"event_id":"sha256:fdcd110d98a20233e28be6b724ad60677e5c5c584277064676162d416d4f22ec","target":"graph","created_at":"2026-06-19T16:10:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.17732/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Pan Peng, Sebastian L\\\"uderssen, Stefan Neumann","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T09:49:45Z","title":"Four-Cycle Counting in Low-Degeneracy Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.17732","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:1154e2eb2606e30ac35e4dd4d42b05e3e10cfb6f75d30e796d9b781d9be98e49","target":"record","created_at":"2026-06-19T16:10:20Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"4156c27cfc6dd9ed9ef0c678dc710e859c186cfacae7c03351e5ef3dd7a6faed","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2026-06-16T09:49:45Z","title_canon_sha256":"892de71dacd4b9095b84c9765a7f8951286946cf9488a712a4288aada20e553a"},"schema_version":"1.0","source":{"id":"2606.17732","kind":"arxiv","version":1}},"canonical_sha256":"6a4331dad56984d4b33ffab4032336a0579b9c78329ec3ad8edf4a70735094aa","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6a4331dad56984d4b33ffab4032336a0579b9c78329ec3ad8edf4a70735094aa","first_computed_at":"2026-06-19T16:10:20.570572Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-19T16:10:20.570572Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ViS5EoLoZiPhgofLuQ7uLGFit4aunR8bnoemEe091hgTKiSFkpjHXtq1UREwhYDvYHgNGln8FnIoEB+5B30ACw==","signature_status":"signed_v1","signed_at":"2026-06-19T16:10:20.570906Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.17732","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1154e2eb2606e30ac35e4dd4d42b05e3e10cfb6f75d30e796d9b781d9be98e49","sha256:fdcd110d98a20233e28be6b724ad60677e5c5c584277064676162d416d4f22ec"],"state_sha256":"ed02cd973c11969bb426eea4b2963c09d2e8bb96e2ff5d7966f02bdb81aadbba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XTYs/LQwwuR9KclSuV6An0AXwj+DjCa7wrQ7WT/DfszmZuyqM2n7Gb4Ula5NxsRe8I5O7IG5QIYEq8RIf7G0Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T17:44:41.459217Z","bundle_sha256":"1d1327c46b6b17574bf39fb7102abd882f201a484bd41df85952f20fc96812bd"}}