{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:7RWHXSZG26D3SMLBT3M53JEEZS","short_pith_number":"pith:7RWHXSZG","canonical_record":{"source":{"id":"1506.04417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-14T16:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"235e59fcd9f32c34a042af118bf7752bab2b78293357bfa25167f643bf2faa71","abstract_canon_sha256":"9266aa4a18f34f7bb7d8eadea60240a53304329c418507197e8ca0077f714bbd"},"schema_version":"1.0"},"canonical_sha256":"fc6c7bcb26d787b931619ed9dda484cc9030634af4ed990de8ebd72e4f22dff5","source":{"kind":"arxiv","id":"1506.04417","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04417","created_at":"2026-05-18T01:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04417v1","created_at":"2026-05-18T01:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04417","created_at":"2026-05-18T01:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"7RWHXSZG26D3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7RWHXSZG26D3SMLB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7RWHXSZG","created_at":"2026-05-18T12:29:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:7RWHXSZG26D3SMLBT3M53JEEZS","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04417","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-14T16:32:06Z","cross_cats_sorted":[],"title_canon_sha256":"235e59fcd9f32c34a042af118bf7752bab2b78293357bfa25167f643bf2faa71","abstract_canon_sha256":"9266aa4a18f34f7bb7d8eadea60240a53304329c418507197e8ca0077f714bbd"},"schema_version":"1.0"},"canonical_sha256":"fc6c7bcb26d787b931619ed9dda484cc9030634af4ed990de8ebd72e4f22dff5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:49:54.607752Z","signature_b64":"b7RKCkRkzSxRXM0ZIbmEYEpaD38+cftX3s2WKJdU7zo23LiBxFnvwgshKr5MFuVdgeMi5zXAfYvAGg0zSAjyAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"fc6c7bcb26d787b931619ed9dda484cc9030634af4ed990de8ebd72e4f22dff5","last_reissued_at":"2026-05-18T01:49:54.607268Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:49:54.607268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04417","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-05-18T01:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kqrRMLQ/C5IpmnXWuDHR+le0wBizmytql1DIs8drDZjOKLfJOCYvvFCKX7Fyz0OGmWRRQNDv6uiJnbowNXyaBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:59:40.326587Z"},"content_sha256":"39c97f93478b451e662bd9150e41ca1ae87b2f4f0354c026aea8486dbbb9fce4","schema_version":"1.0","event_id":"sha256:39c97f93478b451e662bd9150e41ca1ae87b2f4f0354c026aea8486dbbb9fce4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:7RWHXSZG26D3SMLBT3M53JEEZS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Densest Subgraph in Dynamic Graph Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andrew McGregor, David Tench, Hoa T. Vu, Sofya Vorotnikova","submitted_at":"2015-06-14T16:32:06Z","abstract_excerpt":"In this paper, we consider the problem of approximating the densest subgraph in the dynamic graph stream model. In this model of computation, the input graph is defined by an arbitrary sequence of edge insertions and deletions and the goal is to analyze properties of the resulting graph given memory that is sub-linear in the size of the stream. We present a single-pass algorithm that returns a $(1+\\epsilon)$ approximation of the maximum density with high probability; the algorithm uses $O(\\epsilon^{-2} n \\polylog n)$ space, processes each stream update in $\\polylog (n)$ time, and uses $\\poly(n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04417","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":""},"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-05-18T01:49:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dqQx0dGYUt/+U5GKPEqZ4x6/lvtFTYPcc8hMNcvMtj9izBv3fmohq8SClnH09+xALg/qMxZ1N2elG7h8gv2tAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T08:59:40.326959Z"},"content_sha256":"077f484472ad95c6c53922f2ce70fd083896827c5dadace27aa12ecccabed04e","schema_version":"1.0","event_id":"sha256:077f484472ad95c6c53922f2ce70fd083896827c5dadace27aa12ecccabed04e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/7RWHXSZG26D3SMLBT3M53JEEZS/bundle.json","state_url":"https://pith.science/pith/7RWHXSZG26D3SMLBT3M53JEEZS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/7RWHXSZG26D3SMLBT3M53JEEZS/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-06-11T08:59:40Z","links":{"resolver":"https://pith.science/pith/7RWHXSZG26D3SMLBT3M53JEEZS","bundle":"https://pith.science/pith/7RWHXSZG26D3SMLBT3M53JEEZS/bundle.json","state":"https://pith.science/pith/7RWHXSZG26D3SMLBT3M53JEEZS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/7RWHXSZG26D3SMLBT3M53JEEZS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:7RWHXSZG26D3SMLBT3M53JEEZS","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":"9266aa4a18f34f7bb7d8eadea60240a53304329c418507197e8ca0077f714bbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-14T16:32:06Z","title_canon_sha256":"235e59fcd9f32c34a042af118bf7752bab2b78293357bfa25167f643bf2faa71"},"schema_version":"1.0","source":{"id":"1506.04417","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04417","created_at":"2026-05-18T01:49:54Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04417v1","created_at":"2026-05-18T01:49:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04417","created_at":"2026-05-18T01:49:54Z"},{"alias_kind":"pith_short_12","alias_value":"7RWHXSZG26D3","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_16","alias_value":"7RWHXSZG26D3SMLB","created_at":"2026-05-18T12:29:10Z"},{"alias_kind":"pith_short_8","alias_value":"7RWHXSZG","created_at":"2026-05-18T12:29:10Z"}],"graph_snapshots":[{"event_id":"sha256:077f484472ad95c6c53922f2ce70fd083896827c5dadace27aa12ecccabed04e","target":"graph","created_at":"2026-05-18T01:49:54Z","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"},"paper":{"abstract_excerpt":"In this paper, we consider the problem of approximating the densest subgraph in the dynamic graph stream model. In this model of computation, the input graph is defined by an arbitrary sequence of edge insertions and deletions and the goal is to analyze properties of the resulting graph given memory that is sub-linear in the size of the stream. We present a single-pass algorithm that returns a $(1+\\epsilon)$ approximation of the maximum density with high probability; the algorithm uses $O(\\epsilon^{-2} n \\polylog n)$ space, processes each stream update in $\\polylog (n)$ time, and uses $\\poly(n","authors_text":"Andrew McGregor, David Tench, Hoa T. Vu, Sofya Vorotnikova","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-14T16:32:06Z","title":"Densest Subgraph in Dynamic Graph Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04417","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:39c97f93478b451e662bd9150e41ca1ae87b2f4f0354c026aea8486dbbb9fce4","target":"record","created_at":"2026-05-18T01:49:54Z","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":"9266aa4a18f34f7bb7d8eadea60240a53304329c418507197e8ca0077f714bbd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-14T16:32:06Z","title_canon_sha256":"235e59fcd9f32c34a042af118bf7752bab2b78293357bfa25167f643bf2faa71"},"schema_version":"1.0","source":{"id":"1506.04417","kind":"arxiv","version":1}},"canonical_sha256":"fc6c7bcb26d787b931619ed9dda484cc9030634af4ed990de8ebd72e4f22dff5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"fc6c7bcb26d787b931619ed9dda484cc9030634af4ed990de8ebd72e4f22dff5","first_computed_at":"2026-05-18T01:49:54.607268Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:49:54.607268Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"b7RKCkRkzSxRXM0ZIbmEYEpaD38+cftX3s2WKJdU7zo23LiBxFnvwgshKr5MFuVdgeMi5zXAfYvAGg0zSAjyAA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:49:54.607752Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04417","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:39c97f93478b451e662bd9150e41ca1ae87b2f4f0354c026aea8486dbbb9fce4","sha256:077f484472ad95c6c53922f2ce70fd083896827c5dadace27aa12ecccabed04e"],"state_sha256":"db3d0018b2fab288726d7fc93a8752d4aa1f7b6ed05a4e6bf13492e44d5014b3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vUrHRNgMNY7nSAdX6D34J2OwldDC3ZdIP6P8PHi+nrKyVP7brD6mPN7NJ+liws1VXWVs/Yh3Cke4VeGC2gW0Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T08:59:40.328975Z","bundle_sha256":"978ff53318fff8ce259d111873d3e2c81959910102dd466bdbffb4bae28da713"}}