{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:YL7QWB4APIACG736AV2VDWV7XU","short_pith_number":"pith:YL7QWB4A","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"},"canonical_sha256":"c2ff0b07807a00237f7e057551dabfbd37c66905d6bf4ef931dbc8f76c00e191","source":{"kind":"arxiv","id":"1907.03037","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03037","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03037v2","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03037","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_12","alias_value":"YL7QWB4APIAC","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_16","alias_value":"YL7QWB4APIACG736","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_8","alias_value":"YL7QWB4A","created_at":"2026-07-05T00:47:17Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:YL7QWB4APIACG736AV2VDWV7XU","target":"record","payload":{"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"},"canonical_sha256":"c2ff0b07807a00237f7e057551dabfbd37c66905d6bf4ef931dbc8f76c00e191","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"},"source_kind":"arxiv","source_id":"1907.03037","source_version":2,"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-07-05T00:47:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1egypcxtWpiFUpi7OqKUVGMOVQbdxcERgYMR9JH/rTBuaT/SAQ7uziiF/P5IY0Jv5jc4y90NynOziGeBXSnUDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:26:16.464590Z"},"content_sha256":"fa30eae1d069b4224793dd592e1f38dee2eb146477446a7c278f518f8c33bc22","schema_version":"1.0","event_id":"sha256:fa30eae1d069b4224793dd592e1f38dee2eb146477446a7c278f518f8c33bc22"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:YL7QWB4APIACG736AV2VDWV7XU","target":"graph","payload":{"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"},"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-07-05T00:47:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/wUn1u5Vxf85rxHcCLzVlzcnH13oqBMlmhgpBmaubIVXCyQvNgx821mZH9eT+nRKBRKPup3ejItRtae3LUfBBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-09T04:26:16.464960Z"},"content_sha256":"ce523bc5784002d92f539cf0d2166dbede2fd10f8eef2b7f3150509c96485d8d","schema_version":"1.0","event_id":"sha256:ce523bc5784002d92f539cf0d2166dbede2fd10f8eef2b7f3150509c96485d8d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/bundle.json","state_url":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YL7QWB4APIACG736AV2VDWV7XU/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-07-09T04:26:16Z","links":{"resolver":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU","bundle":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/bundle.json","state":"https://pith.science/pith/YL7QWB4APIACG736AV2VDWV7XU/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YL7QWB4APIACG736AV2VDWV7XU/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:YL7QWB4APIACG736AV2VDWV7XU","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":"35820cf5dd9b93a59d4cc21f00dbc4bffe895be1afd94b8aa80464394a35d7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T22:37:35Z","title_canon_sha256":"4fc0b139fc3403c4a27840a9a3ef7294f65887e20b254d8d3985d6b64be0af74"},"schema_version":"1.0","source":{"id":"1907.03037","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.03037","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"arxiv_version","alias_value":"1907.03037v2","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.03037","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_12","alias_value":"YL7QWB4APIAC","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_16","alias_value":"YL7QWB4APIACG736","created_at":"2026-07-05T00:47:17Z"},{"alias_kind":"pith_short_8","alias_value":"YL7QWB4A","created_at":"2026-07-05T00:47:17Z"}],"graph_snapshots":[{"event_id":"sha256:ce523bc5784002d92f539cf0d2166dbede2fd10f8eef2b7f3150509c96485d8d","target":"graph","created_at":"2026-07-05T00:47:17Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1907.03037/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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}","authors_text":"Junxing Wang, Saurabh Sawlani","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T22:37:35Z","title":"Near-Optimal Fully Dynamic Densest Subgraph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.03037","kind":"arxiv","version":2},"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:fa30eae1d069b4224793dd592e1f38dee2eb146477446a7c278f518f8c33bc22","target":"record","created_at":"2026-07-05T00:47:17Z","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":"35820cf5dd9b93a59d4cc21f00dbc4bffe895be1afd94b8aa80464394a35d7dc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-05T22:37:35Z","title_canon_sha256":"4fc0b139fc3403c4a27840a9a3ef7294f65887e20b254d8d3985d6b64be0af74"},"schema_version":"1.0","source":{"id":"1907.03037","kind":"arxiv","version":2}},"canonical_sha256":"c2ff0b07807a00237f7e057551dabfbd37c66905d6bf4ef931dbc8f76c00e191","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2ff0b07807a00237f7e057551dabfbd37c66905d6bf4ef931dbc8f76c00e191","first_computed_at":"2026-07-05T00:47:17.112750Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:47:17.112750Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+3cU36p453Ycj4IwNmldiZ8yfVW6zya6U3Ro8igZAcZrAM5SqerpuaNogbgZ2B3hShAIDHkHVC2tedZXEgnHCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:47:17.113271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.03037","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:fa30eae1d069b4224793dd592e1f38dee2eb146477446a7c278f518f8c33bc22","sha256:ce523bc5784002d92f539cf0d2166dbede2fd10f8eef2b7f3150509c96485d8d"],"state_sha256":"0f129b71bcae57cea92086d47ad5052eead1f15d78346c293c619db68c9349ad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1f8tED+brFD8qaD/zI3tGSXoiyvc/4JFFI2gjEvkHGfR3dyK53U7ENnT7gVTWSSMQ7N6SIZjid8XA+XlXpd2AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-09T04:26:16.467550Z","bundle_sha256":"2a4bc69dd36a767b7a7f7582efbdf8dc1fd5ecc144ead42300de61928a237aa2"}}