{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:LSEO3A4V3EXWQN3Z7G32HOJ7M7","short_pith_number":"pith:LSEO3A4V","schema_version":"1.0","canonical_sha256":"5c88ed8395d92f683779f9b7a3b93f67c9399651941835640da34b2dbd8a8031","source":{"kind":"arxiv","id":"1509.06464","version":1},"attestation_state":"computed","paper":{"title":"Dynamic graph connectivity with improved worst case update time and sublinear space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruce Kapron, David Gibb, Nolan Thorn, Valerie King","submitted_at":"2015-09-22T04:56:11Z","abstract_excerpt":"This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space. The fully dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes, process an online sequence of edge insertions, edge deletions, and queries of the form \"Is there a path between nodes a and b?\" In 2013, the first data structure was presented with worst case time per operation which was polylogarithmic in n. In this paper, we shave off a factor of log n from that time, to O(log^4 n) per update. For sequences which are polynomial in length, our al"},"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":"1509.06464","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-22T04:56:11Z","cross_cats_sorted":[],"title_canon_sha256":"c4d293347097120d72d8d8033b67d1f84391c922f117ce8f33c17f194f951b96","abstract_canon_sha256":"c9de13c548e4155b22be211661bf0b899561f21fd40261696b0984135db4d09c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:20.212523Z","signature_b64":"XJpzUkCGhGuvnhKhIjgOrUFwX0o9b8AU1uecHw169IIv/Wmdf+Bw0VRsy49qfjgc8ubWRHNBncX0eYuG89wjBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c88ed8395d92f683779f9b7a3b93f67c9399651941835640da34b2dbd8a8031","last_reissued_at":"2026-05-18T01:32:20.211790Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:20.211790Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic graph connectivity with improved worst case update time and sublinear space","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Bruce Kapron, David Gibb, Nolan Thorn, Valerie King","submitted_at":"2015-09-22T04:56:11Z","abstract_excerpt":"This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space. The fully dynamic graph connectivity problem is the following: given a graph on a fixed set of n nodes, process an online sequence of edge insertions, edge deletions, and queries of the form \"Is there a path between nodes a and b?\" In 2013, the first data structure was presented with worst case time per operation which was polylogarithmic in n. In this paper, we shave off a factor of log n from that time, to O(log^4 n) per update. For sequences which are polynomial in length, our al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06464","kind":"arxiv","version":1},"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":"1509.06464","created_at":"2026-05-18T01:32:20.211900+00:00"},{"alias_kind":"arxiv_version","alias_value":"1509.06464v1","created_at":"2026-05-18T01:32:20.211900+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06464","created_at":"2026-05-18T01:32:20.211900+00:00"},{"alias_kind":"pith_short_12","alias_value":"LSEO3A4V3EXW","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LSEO3A4V3EXWQN3Z","created_at":"2026-05-18T12:29:29.992203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LSEO3A4V","created_at":"2026-05-18T12:29:29.992203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":2,"sample":[{"citing_arxiv_id":"2509.06701","citing_title":"Probabilistic Modeling of Latent Agentic Substructures in Deep Neural Networks","ref_index":34,"is_internal_anchor":true},{"citing_arxiv_id":"2605.15173","citing_title":"Hybrid Sketching Methods for Dynamic Connectivity on Sparse Graphs","ref_index":33,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7","json":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7.json","graph_json":"https://pith.science/api/pith-number/LSEO3A4V3EXWQN3Z7G32HOJ7M7/graph.json","events_json":"https://pith.science/api/pith-number/LSEO3A4V3EXWQN3Z7G32HOJ7M7/events.json","paper":"https://pith.science/paper/LSEO3A4V"},"agent_actions":{"view_html":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7","download_json":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7.json","view_paper":"https://pith.science/paper/LSEO3A4V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1509.06464&json=true","fetch_graph":"https://pith.science/api/pith-number/LSEO3A4V3EXWQN3Z7G32HOJ7M7/graph.json","fetch_events":"https://pith.science/api/pith-number/LSEO3A4V3EXWQN3Z7G32HOJ7M7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7/action/storage_attestation","attest_author":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7/action/author_attestation","sign_citation":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7/action/citation_signature","submit_replication":"https://pith.science/pith/LSEO3A4V3EXWQN3Z7G32HOJ7M7/action/replication_record"}},"created_at":"2026-05-18T01:32:20.211900+00:00","updated_at":"2026-05-18T01:32:20.211900+00:00"}