{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:YL7QWB4APIACG736AV2VDWV7XU","short_pith_number":"pith:YL7QWB4A","schema_version":"1.0","canonical_sha256":"c2ff0b07807a00237f7e057551dabfbd37c66905d6bf4ef931dbc8f76c00e191","source":{"kind":"arxiv","id":"1907.03037","version":2},"attestation_state":"computed","paper":{"title":"Near-Optimal Fully Dynamic Densest Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junxing Wang, Saurabh Sawlani","submitted_at":"2019-07-05T22:37:35Z","abstract_excerpt":"We give the first fully dynamic algorithm which maintains a $(1-\\epsilon)$-approximate densest subgraph in worst-case time $\\text{poly}(\\log n, \\epsilon^{-1})$ per update. Dense subgraph discovery is an important primitive for many real-world applications such as community detection, link spam detection, distance query indexing, and computational biology. We approach the densest subgraph problem by framing its dual as a graph orientation problem, which we solve using an augmenting path-like adjustment technique. Our result improves upon the previous best approximation factor of $\\left(\\frac{1}"},"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":"1907.03037","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T22:37:35Z","cross_cats_sorted":[],"title_canon_sha256":"4fc0b139fc3403c4a27840a9a3ef7294f65887e20b254d8d3985d6b64be0af74","abstract_canon_sha256":"35820cf5dd9b93a59d4cc21f00dbc4bffe895be1afd94b8aa80464394a35d7dc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:47:17.113271Z","signature_b64":"+3cU36p453Ycj4IwNmldiZ8yfVW6zya6U3Ro8igZAcZrAM5SqerpuaNogbgZ2B3hShAIDHkHVC2tedZXEgnHCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2ff0b07807a00237f7e057551dabfbd37c66905d6bf4ef931dbc8f76c00e191","last_reissued_at":"2026-07-05T00:47:17.112750Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:47:17.112750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Near-Optimal Fully Dynamic Densest Subgraph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Junxing Wang, Saurabh Sawlani","submitted_at":"2019-07-05T22:37:35Z","abstract_excerpt":"We give the first fully dynamic algorithm which maintains a $(1-\\epsilon)$-approximate densest subgraph in worst-case time $\\text{poly}(\\log n, \\epsilon^{-1})$ per update. Dense subgraph discovery is an important primitive for many real-world applications such as community detection, link spam detection, distance query indexing, and computational biology. We approach the densest subgraph problem by framing its dual as a graph orientation problem, which we solve using an augmenting path-like adjustment technique. Our result improves upon the previous best approximation factor of $\\left(\\frac{1}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03037","kind":"arxiv","version":2},"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/1907.03037/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1907.03037","created_at":"2026-07-05T00:47:17.112816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.03037v2","created_at":"2026-07-05T00:47:17.112816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03037","created_at":"2026-07-05T00:47:17.112816+00:00"},{"alias_kind":"pith_short_12","alias_value":"YL7QWB4APIAC","created_at":"2026-07-05T00:47:17.112816+00:00"},{"alias_kind":"pith_short_16","alias_value":"YL7QWB4APIACG736","created_at":"2026-07-05T00:47:17.112816+00:00"},{"alias_kind":"pith_short_8","alias_value":"YL7QWB4A","created_at":"2026-07-05T00:47:17.112816+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/YL7QWB4APIACG736AV2VDWV7XU","json":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU.json","graph_json":"https://pith.science/api/pith-number/YL7QWB4APIACG736AV2VDWV7XU/graph.json","events_json":"https://pith.science/api/pith-number/YL7QWB4APIACG736AV2VDWV7XU/events.json","paper":"https://pith.science/paper/YL7QWB4A"},"agent_actions":{"view_html":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU","download_json":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU.json","view_paper":"https://pith.science/paper/YL7QWB4A","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.03037&json=true","fetch_graph":"https://pith.science/api/pith-number/YL7QWB4APIACG736AV2VDWV7XU/graph.json","fetch_events":"https://pith.science/api/pith-number/YL7QWB4APIACG736AV2VDWV7XU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/action/storage_attestation","attest_author":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/action/author_attestation","sign_citation":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/action/citation_signature","submit_replication":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/action/replication_record"}},"created_at":"2026-07-05T00:47:17.112816+00:00","updated_at":"2026-07-05T00:47:17.112816+00:00"}