{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:3BHXNQTUEAJVFOG2DH52472AKJ","short_pith_number":"pith:3BHXNQTU","canonical_record":{"source":{"id":"1504.02268","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T11:43:52Z","cross_cats_sorted":[],"title_canon_sha256":"f5d00ef571597034253c857d3927d24aecbe87190ddf58278680389590c0d9d0","abstract_canon_sha256":"0a200ba71a332b5e5e696182109a55b9cf3fe217af3187ed6fd0dfe211fc70fd"},"schema_version":"1.0"},"canonical_sha256":"d84f76c274201352b8da19fbae7f40527ce23280394bd5944620bb1adc76142b","source":{"kind":"arxiv","id":"1504.02268","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02268","created_at":"2026-05-18T01:32:29Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02268v3","created_at":"2026-05-18T01:32:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02268","created_at":"2026-05-18T01:32:29Z"},{"alias_kind":"pith_short_12","alias_value":"3BHXNQTUEAJV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3BHXNQTUEAJVFOG2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3BHXNQTU","created_at":"2026-05-18T12:29:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:3BHXNQTUEAJVFOG2DH52472AKJ","target":"record","payload":{"canonical_record":{"source":{"id":"1504.02268","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T11:43:52Z","cross_cats_sorted":[],"title_canon_sha256":"f5d00ef571597034253c857d3927d24aecbe87190ddf58278680389590c0d9d0","abstract_canon_sha256":"0a200ba71a332b5e5e696182109a55b9cf3fe217af3187ed6fd0dfe211fc70fd"},"schema_version":"1.0"},"canonical_sha256":"d84f76c274201352b8da19fbae7f40527ce23280394bd5944620bb1adc76142b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:29.855143Z","signature_b64":"yb+AYOgunjqGJLxGIqZ3oC3GZGHjqIaGy7afwa2rdE8bsOXHdRtd2d55CmG4vX2+Kb98mwZGoT5e+eqh1MENCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d84f76c274201352b8da19fbae7f40527ce23280394bd5944620bb1adc76142b","last_reissued_at":"2026-05-18T01:32:29.854673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:29.854673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1504.02268","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:32:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"G2cClHoE3p36iIm+r8yG5fXRCg2o9VWJpvOKgKxC0sf/0w5iZI9JG5XRBt9S00pbb1ZqqeNJo4NIy/Af5bEQAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:16:14.964332Z"},"content_sha256":"aaa20d34e98d55219bb410a3bff50b8775e4f3001b997ead0278ef733840124f","schema_version":"1.0","event_id":"sha256:aaa20d34e98d55219bb410a3bff50b8775e4f3001b997ead0278ef733840124f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:3BHXNQTUEAJVFOG2DH52472AKJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Charalampos E. Tsourakakis, Danupon Nanongkai, Monika Henzinger, Sayan Bhattacharya","submitted_at":"2015-04-09T11:43:52Z","abstract_excerpt":"While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of {\\em both} time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many graph mining applications called {\\em densest subgraph problem}. We develop an algorithm that achieves time- and space-efficiency for this problem simultaneously. It is one of the first of its kind for graph problems to the best of our knowledge.\n  In a graph $G = (V, E)$, the \"density\" of a subgraph induced by a subset of no"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02268","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:32:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cokz1ybv20nvkOJyB5KLi7D9QweKI+ZUTWhpwBY8Flre2oMjOOHRvxdeIOcFYemMwG/5BqGfSw2OupBp9B0UDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T18:16:14.964696Z"},"content_sha256":"2d7381931379c23541f3117bbb91516775c4e4b01e1211bfd8bc22a3849979de","schema_version":"1.0","event_id":"sha256:2d7381931379c23541f3117bbb91516775c4e4b01e1211bfd8bc22a3849979de"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/bundle.json","state_url":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3BHXNQTUEAJVFOG2DH52472AKJ/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-10T18:16:14Z","links":{"resolver":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ","bundle":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/bundle.json","state":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3BHXNQTUEAJVFOG2DH52472AKJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:3BHXNQTUEAJVFOG2DH52472AKJ","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":"0a200ba71a332b5e5e696182109a55b9cf3fe217af3187ed6fd0dfe211fc70fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T11:43:52Z","title_canon_sha256":"f5d00ef571597034253c857d3927d24aecbe87190ddf58278680389590c0d9d0"},"schema_version":"1.0","source":{"id":"1504.02268","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1504.02268","created_at":"2026-05-18T01:32:29Z"},{"alias_kind":"arxiv_version","alias_value":"1504.02268v3","created_at":"2026-05-18T01:32:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02268","created_at":"2026-05-18T01:32:29Z"},{"alias_kind":"pith_short_12","alias_value":"3BHXNQTUEAJV","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_16","alias_value":"3BHXNQTUEAJVFOG2","created_at":"2026-05-18T12:29:02Z"},{"alias_kind":"pith_short_8","alias_value":"3BHXNQTU","created_at":"2026-05-18T12:29:02Z"}],"graph_snapshots":[{"event_id":"sha256:2d7381931379c23541f3117bbb91516775c4e4b01e1211bfd8bc22a3849979de","target":"graph","created_at":"2026-05-18T01:32:29Z","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":"While in many graph mining applications it is crucial to handle a stream of updates efficiently in terms of {\\em both} time and space, not much was known about achieving such type of algorithm. In this paper we study this issue for a problem which lies at the core of many graph mining applications called {\\em densest subgraph problem}. We develop an algorithm that achieves time- and space-efficiency for this problem simultaneously. It is one of the first of its kind for graph problems to the best of our knowledge.\n  In a graph $G = (V, E)$, the \"density\" of a subgraph induced by a subset of no","authors_text":"Charalampos E. Tsourakakis, Danupon Nanongkai, Monika Henzinger, Sayan Bhattacharya","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T11:43:52Z","title":"Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1504.02268","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:aaa20d34e98d55219bb410a3bff50b8775e4f3001b997ead0278ef733840124f","target":"record","created_at":"2026-05-18T01:32:29Z","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":"0a200ba71a332b5e5e696182109a55b9cf3fe217af3187ed6fd0dfe211fc70fd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-04-09T11:43:52Z","title_canon_sha256":"f5d00ef571597034253c857d3927d24aecbe87190ddf58278680389590c0d9d0"},"schema_version":"1.0","source":{"id":"1504.02268","kind":"arxiv","version":3}},"canonical_sha256":"d84f76c274201352b8da19fbae7f40527ce23280394bd5944620bb1adc76142b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d84f76c274201352b8da19fbae7f40527ce23280394bd5944620bb1adc76142b","first_computed_at":"2026-05-18T01:32:29.854673Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:29.854673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yb+AYOgunjqGJLxGIqZ3oC3GZGHjqIaGy7afwa2rdE8bsOXHdRtd2d55CmG4vX2+Kb98mwZGoT5e+eqh1MENCA==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:29.855143Z","signed_message":"canonical_sha256_bytes"},"source_id":"1504.02268","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaa20d34e98d55219bb410a3bff50b8775e4f3001b997ead0278ef733840124f","sha256:2d7381931379c23541f3117bbb91516775c4e4b01e1211bfd8bc22a3849979de"],"state_sha256":"655a8e30efcf6cfcb3d60490e4c732355780a22907e31cb0d8370e24725820cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ubB3BiR5fxvXEfv2Hsq5IIFi2pV8S2XT9IBZHWBGaTDY4A8eKsPSCqMqc33EhLjopSCsGfCmU9IwEDBwT6sRBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T18:16:14.966641Z","bundle_sha256":"9ea5c5123ef290bd920bb53197fcd564fb35595fa46fda909289c96dd0579615"}}