{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:666WHWZKUFLKB5RXPV7TA5IRCD","short_pith_number":"pith:666WHWZK","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"},"canonical_sha256":"f7bd63db2aa156a0f6377d7f30751110e217c28a1470094adf72a2480f2b662e","source":{"kind":"arxiv","id":"2007.13466","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.13466","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"arxiv_version","alias_value":"2007.13466v1","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.13466","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"pith_short_12","alias_value":"666WHWZKUFLK","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"pith_short_16","alias_value":"666WHWZKUFLKB5RX","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"pith_short_8","alias_value":"666WHWZK","created_at":"2026-07-05T01:22:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:666WHWZKUFLKB5RXPV7TA5IRCD","target":"record","payload":{"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"},"canonical_sha256":"f7bd63db2aa156a0f6377d7f30751110e217c28a1470094adf72a2480f2b662e","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"},"source_kind":"arxiv","source_id":"2007.13466","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-07-05T01:22:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GgNWZJ0Y+eQ8fAnf2/CinJWQiUFEquBi+knpQRx/b4DicPIcjUS4IQ4Js6M9+DUwdHcJfX2biTBmBx6s2upHBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:41:40.410109Z"},"content_sha256":"e654e9d684466351573335e66eeb9122ca3f0fe1442812ad64bb7e103fdd2a19","schema_version":"1.0","event_id":"sha256:e654e9d684466351573335e66eeb9122ca3f0fe1442812ad64bb7e103fdd2a19"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:666WHWZKUFLKB5RXPV7TA5IRCD","target":"graph","payload":{"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"},"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-07-05T01:22:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hBkHwubwFJC7vgQPWS1iNcNgCVRf7csIrM0n2TtlBZDCG7wFIHURo1TNw7fh/ly4BOUiNpwcmHj73DjzP8QzBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-11T18:41:40.410858Z"},"content_sha256":"ff11bf0448e211603d586cfcdef1d68c387d5fe1a81ae646ffc8d7551e51d998","schema_version":"1.0","event_id":"sha256:ff11bf0448e211603d586cfcdef1d68c387d5fe1a81ae646ffc8d7551e51d998"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/bundle.json","state_url":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/666WHWZKUFLKB5RXPV7TA5IRCD/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-11T18:41:40Z","links":{"resolver":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD","bundle":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/bundle.json","state":"https://pith.science/pith/666WHWZKUFLKB5RXPV7TA5IRCD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/666WHWZKUFLKB5RXPV7TA5IRCD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:666WHWZKUFLKB5RXPV7TA5IRCD","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":"e2b1fddebb1a35ebcb82f66354a688e287b608d59a836a947df5ae712d1f0184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-27T12:12:21Z","title_canon_sha256":"cb3a61c4ec461898873ede482470a2e25bb1c84c64287ed88932f4c873e8d330"},"schema_version":"1.0","source":{"id":"2007.13466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.13466","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"arxiv_version","alias_value":"2007.13466v1","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.13466","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"pith_short_12","alias_value":"666WHWZKUFLK","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"pith_short_16","alias_value":"666WHWZKUFLKB5RX","created_at":"2026-07-05T01:22:24Z"},{"alias_kind":"pith_short_8","alias_value":"666WHWZK","created_at":"2026-07-05T01:22:24Z"}],"graph_snapshots":[{"event_id":"sha256:ff11bf0448e211603d586cfcdef1d68c387d5fe1a81ae646ffc8d7551e51d998","target":"graph","created_at":"2026-07-05T01:22:24Z","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/2007.13466/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Sofya Vorotnikova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-27T12:12:21Z","title":"Improved 3-pass Algorithm for Counting 4-cycles in Arbitrary Order Streaming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.13466","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:e654e9d684466351573335e66eeb9122ca3f0fe1442812ad64bb7e103fdd2a19","target":"record","created_at":"2026-07-05T01:22:24Z","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":"e2b1fddebb1a35ebcb82f66354a688e287b608d59a836a947df5ae712d1f0184","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2020-07-27T12:12:21Z","title_canon_sha256":"cb3a61c4ec461898873ede482470a2e25bb1c84c64287ed88932f4c873e8d330"},"schema_version":"1.0","source":{"id":"2007.13466","kind":"arxiv","version":1}},"canonical_sha256":"f7bd63db2aa156a0f6377d7f30751110e217c28a1470094adf72a2480f2b662e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7bd63db2aa156a0f6377d7f30751110e217c28a1470094adf72a2480f2b662e","first_computed_at":"2026-07-05T01:22:24.465191Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:22:24.465191Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Gro8sVlfWngduhNk2jNcAQRl/TdiBHATIe8ztlxFfa6gMmWb9/1yhpmoo1LGdLHFBufRGJSlhBoyj/q92aCnAg==","signature_status":"signed_v1","signed_at":"2026-07-05T01:22:24.465733Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.13466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e654e9d684466351573335e66eeb9122ca3f0fe1442812ad64bb7e103fdd2a19","sha256:ff11bf0448e211603d586cfcdef1d68c387d5fe1a81ae646ffc8d7551e51d998"],"state_sha256":"015532727571f94254eeead1d030cc5ca5af0c6b8d9dc4d35fd7bb3d5b18d48f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CKi2QSDD0/jzpiTTe8N9QdqGzxMwTSk7KxvdOtGh/HufRQOWyFXsNeJUq45X46qCdjJd9G6anWJ5fHYYWEn6Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-11T18:41:40.418087Z","bundle_sha256":"2c30acd91ba9b4405992d0e445662927e99dbccd925c4354e86575fad6d82781"}}