{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:ST6JGB4WNSUU7PFF6QKKYR5GHC","short_pith_number":"pith:ST6JGB4W","canonical_record":{"source":{"id":"1506.04505","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T08:08:55Z","cross_cats_sorted":[],"title_canon_sha256":"190454a8029d5144c1a4be97426b8458e062c8208d498aafc6cc9f25511956ee","abstract_canon_sha256":"b7e18f4e23bb7218e1eb7697360c0209a60f4e58299c08f7acdd44d59a0137a7"},"schema_version":"1.0"},"canonical_sha256":"94fc9307966ca94fbca5f414ac47a6388747233e251fdf6fe7c143113890abdd","source":{"kind":"arxiv","id":"1506.04505","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04505","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04505v3","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04505","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"ST6JGB4WNSUU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"ST6JGB4WNSUU7PFF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"ST6JGB4W","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:ST6JGB4WNSUU7PFF6QKKYR5GHC","target":"record","payload":{"canonical_record":{"source":{"id":"1506.04505","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T08:08:55Z","cross_cats_sorted":[],"title_canon_sha256":"190454a8029d5144c1a4be97426b8458e062c8208d498aafc6cc9f25511956ee","abstract_canon_sha256":"b7e18f4e23bb7218e1eb7697360c0209a60f4e58299c08f7acdd44d59a0137a7"},"schema_version":"1.0"},"canonical_sha256":"94fc9307966ca94fbca5f414ac47a6388747233e251fdf6fe7c143113890abdd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:36:09.021388Z","signature_b64":"2e2I9VotFM2lrLG1kawafNk/n/LWODvmAUQvg2uWOs5OdwVzkM810CtMQnl5a7E9QZUiCqekPdKlgtBAwTi5Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"94fc9307966ca94fbca5f414ac47a6388747233e251fdf6fe7c143113890abdd","last_reissued_at":"2026-05-18T01:36:09.020938Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:36:09.020938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.04505","source_version":3,"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:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QN2lflU19JFwILxqrH70c9wOmrlUbPlAhGlItBcRMZFCMKhh1EJyNDTC+vwiXbnYmswxG5+lpylvZuw9z8naAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:42:58.906727Z"},"content_sha256":"9813cc47ae888dcdaff76304e1407f056d17e7f49559d139a8dadf0549b9cbaf","schema_version":"1.0","event_id":"sha256:9813cc47ae888dcdaff76304e1407f056d17e7f49559d139a8dadf0549b9cbaf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:ST6JGB4WNSUU7PFF6QKKYR5GHC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Applications of Uniform Sampling: Densest Subgraph and Beyond","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"David P. Woodruff, Hossein Esfandiari, MohammadTaghi Hajiaghayi","submitted_at":"2015-06-15T08:08:55Z","abstract_excerpt":"Recently [Bhattacharya et al., STOC 2015] provide the first non-trivial algorithm for the densest subgraph problem in the streaming model with additions and deletions to its edges, i.e., for dynamic graph streams. They present a $(0.5-\\epsilon)$-approximation algorithm using $\\tilde{O}(n)$ space, where factors of $\\epsilon$ and $\\log(n)$ are suppressed in the $\\tilde{O}$ notation. However, the update time of this algorithm is large. To remedy this, they also provide a $(0.25-\\epsilon)$-approximation algorithm using $\\tilde{O}(n)$ space with update time $\\tilde{O}(1)$.\n  In this paper we improv"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04505","kind":"arxiv","version":3},"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:36:09Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FFEpAO6ERS5O36cSptlX7uEc2RPwuitYSXMRIwQodfCrpMGkCtl3jTVOsj6C8e+YhNbTzow5dgoLnEN2HclxCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T18:42:58.907075Z"},"content_sha256":"04ee8686292a7930372633494fafab788cc955c6128a89633a9674caa6b86a60","schema_version":"1.0","event_id":"sha256:04ee8686292a7930372633494fafab788cc955c6128a89633a9674caa6b86a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ST6JGB4WNSUU7PFF6QKKYR5GHC/bundle.json","state_url":"https://pith.science/pith/ST6JGB4WNSUU7PFF6QKKYR5GHC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ST6JGB4WNSUU7PFF6QKKYR5GHC/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-02T18:42:58Z","links":{"resolver":"https://pith.science/pith/ST6JGB4WNSUU7PFF6QKKYR5GHC","bundle":"https://pith.science/pith/ST6JGB4WNSUU7PFF6QKKYR5GHC/bundle.json","state":"https://pith.science/pith/ST6JGB4WNSUU7PFF6QKKYR5GHC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ST6JGB4WNSUU7PFF6QKKYR5GHC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:ST6JGB4WNSUU7PFF6QKKYR5GHC","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":"b7e18f4e23bb7218e1eb7697360c0209a60f4e58299c08f7acdd44d59a0137a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T08:08:55Z","title_canon_sha256":"190454a8029d5144c1a4be97426b8458e062c8208d498aafc6cc9f25511956ee"},"schema_version":"1.0","source":{"id":"1506.04505","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.04505","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"arxiv_version","alias_value":"1506.04505v3","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.04505","created_at":"2026-05-18T01:36:09Z"},{"alias_kind":"pith_short_12","alias_value":"ST6JGB4WNSUU","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"ST6JGB4WNSUU7PFF","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"ST6JGB4W","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:04ee8686292a7930372633494fafab788cc955c6128a89633a9674caa6b86a60","target":"graph","created_at":"2026-05-18T01:36:09Z","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":"Recently [Bhattacharya et al., STOC 2015] provide the first non-trivial algorithm for the densest subgraph problem in the streaming model with additions and deletions to its edges, i.e., for dynamic graph streams. They present a $(0.5-\\epsilon)$-approximation algorithm using $\\tilde{O}(n)$ space, where factors of $\\epsilon$ and $\\log(n)$ are suppressed in the $\\tilde{O}$ notation. However, the update time of this algorithm is large. To remedy this, they also provide a $(0.25-\\epsilon)$-approximation algorithm using $\\tilde{O}(n)$ space with update time $\\tilde{O}(1)$.\n  In this paper we improv","authors_text":"David P. Woodruff, Hossein Esfandiari, MohammadTaghi Hajiaghayi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T08:08:55Z","title":"Applications of Uniform Sampling: Densest Subgraph and Beyond"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.04505","kind":"arxiv","version":3},"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:9813cc47ae888dcdaff76304e1407f056d17e7f49559d139a8dadf0549b9cbaf","target":"record","created_at":"2026-05-18T01:36:09Z","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":"b7e18f4e23bb7218e1eb7697360c0209a60f4e58299c08f7acdd44d59a0137a7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-06-15T08:08:55Z","title_canon_sha256":"190454a8029d5144c1a4be97426b8458e062c8208d498aafc6cc9f25511956ee"},"schema_version":"1.0","source":{"id":"1506.04505","kind":"arxiv","version":3}},"canonical_sha256":"94fc9307966ca94fbca5f414ac47a6388747233e251fdf6fe7c143113890abdd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"94fc9307966ca94fbca5f414ac47a6388747233e251fdf6fe7c143113890abdd","first_computed_at":"2026-05-18T01:36:09.020938Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:09.020938Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"2e2I9VotFM2lrLG1kawafNk/n/LWODvmAUQvg2uWOs5OdwVzkM810CtMQnl5a7E9QZUiCqekPdKlgtBAwTi5Cw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:09.021388Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.04505","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9813cc47ae888dcdaff76304e1407f056d17e7f49559d139a8dadf0549b9cbaf","sha256:04ee8686292a7930372633494fafab788cc955c6128a89633a9674caa6b86a60"],"state_sha256":"33a6fb139cb4e79aaae85906a5e321cb0fbf75e1d5ad6d39a5ca039299e5b388"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i+W9pnh86MZ4PH0hXz2/1++fwrPr5dSor7CwDlwaNWm/xmdkwZ+ek7Xo1Xn1wzuc33gLmOqXHkBMyrRHQqzSAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T18:42:58.909058Z","bundle_sha256":"711d9c6c1b4a43b741555d489aae6af805c159cbbfdb8bc85a44a57f0c896245"}}