{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:3BHXNQTUEAJVFOG2DH52472AKJ","short_pith_number":"pith:3BHXNQTU","schema_version":"1.0","canonical_sha256":"d84f76c274201352b8da19fbae7f40527ce23280394bd5944620bb1adc76142b","source":{"kind":"arxiv","id":"1504.02268","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1504.02268","created_at":"2026-05-18T01:32:29.854754+00:00"},{"alias_kind":"arxiv_version","alias_value":"1504.02268v3","created_at":"2026-05-18T01:32:29.854754+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1504.02268","created_at":"2026-05-18T01:32:29.854754+00:00"},{"alias_kind":"pith_short_12","alias_value":"3BHXNQTUEAJV","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"3BHXNQTUEAJVFOG2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"3BHXNQTU","created_at":"2026-05-18T12:29:02.477457+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ","json":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ.json","graph_json":"https://pith.science/api/pith-number/3BHXNQTUEAJVFOG2DH52472AKJ/graph.json","events_json":"https://pith.science/api/pith-number/3BHXNQTUEAJVFOG2DH52472AKJ/events.json","paper":"https://pith.science/paper/3BHXNQTU"},"agent_actions":{"view_html":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ","download_json":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ.json","view_paper":"https://pith.science/paper/3BHXNQTU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1504.02268&json=true","fetch_graph":"https://pith.science/api/pith-number/3BHXNQTUEAJVFOG2DH52472AKJ/graph.json","fetch_events":"https://pith.science/api/pith-number/3BHXNQTUEAJVFOG2DH52472AKJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/action/storage_attestation","attest_author":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/action/author_attestation","sign_citation":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/action/citation_signature","submit_replication":"https://pith.science/pith/3BHXNQTUEAJVFOG2DH52472AKJ/action/replication_record"}},"created_at":"2026-05-18T01:32:29.854754+00:00","updated_at":"2026-05-18T01:32:29.854754+00:00"}