{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:N54ENHFSLDUGOGTY26WRKHBARO","short_pith_number":"pith:N54ENHFS","schema_version":"1.0","canonical_sha256":"6f78469cb258e8671a78d7ad151c208b9b57c09a48728c63687a5c0ff519e3e5","source":{"kind":"arxiv","id":"1802.09111","version":2},"attestation_state":"computed","paper":{"title":"Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Monika Henzinger, Pan Peng","submitted_at":"2018-02-26T00:15:44Z","abstract_excerpt":"We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an $n^{c}$-separator theorem for some $c<1$. We give a fully dynamic algorithm that maintains $(1+\\varepsilon)$-approximations of the all-pairs effective resistances of an $n$-vertex graph $G$ undergoing edge insertions and deletions with $\\tilde{O}(\\sqrt{n}/\\varepsilon^2)$ worst-case update time and $\\tilde{O}(\\sqrt{n}/\\varepsilon^2)$ worst-case query time, if $G$ is guaranteed to be $\\sqrt{n}$-separable (i.e., it is taken from a class satisfying a $"},"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":"1802.09111","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T00:15:44Z","cross_cats_sorted":[],"title_canon_sha256":"58c8df2bd3bbfc1a20374f1b96a41d0e4a90fa201b92d814ca0ad1e1845fdcf2","abstract_canon_sha256":"ddb3aaf3cdb20f024426a0e5f35d749c6211740c494070a5b731d11d52d0193b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:08:36.006578Z","signature_b64":"yRUvHOzSbHzr+ZHaVVOZZk2aYiTked2SslMcWWhL89aMwg6QlLUCiCXyrZu4xIGU4XDr/jlui4ctLMouGGLkCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6f78469cb258e8671a78d7ad151c208b9b57c09a48728c63687a5c0ff519e3e5","last_reissued_at":"2026-05-18T00:08:36.005929Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:08:36.005929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Gramoz Goranci, Monika Henzinger, Pan Peng","submitted_at":"2018-02-26T00:15:44Z","abstract_excerpt":"We consider the problem of dynamically maintaining (approximate) all-pairs effective resistances in separable graphs, which are those that admit an $n^{c}$-separator theorem for some $c<1$. We give a fully dynamic algorithm that maintains $(1+\\varepsilon)$-approximations of the all-pairs effective resistances of an $n$-vertex graph $G$ undergoing edge insertions and deletions with $\\tilde{O}(\\sqrt{n}/\\varepsilon^2)$ worst-case update time and $\\tilde{O}(\\sqrt{n}/\\varepsilon^2)$ worst-case query time, if $G$ is guaranteed to be $\\sqrt{n}$-separable (i.e., it is taken from a class satisfying a $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09111","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":""},"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":"1802.09111","created_at":"2026-05-18T00:08:36.006038+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.09111v2","created_at":"2026-05-18T00:08:36.006038+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09111","created_at":"2026-05-18T00:08:36.006038+00:00"},{"alias_kind":"pith_short_12","alias_value":"N54ENHFSLDUG","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_16","alias_value":"N54ENHFSLDUGOGTY","created_at":"2026-05-18T12:32:40.477152+00:00"},{"alias_kind":"pith_short_8","alias_value":"N54ENHFS","created_at":"2026-05-18T12:32:40.477152+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/N54ENHFSLDUGOGTY26WRKHBARO","json":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO.json","graph_json":"https://pith.science/api/pith-number/N54ENHFSLDUGOGTY26WRKHBARO/graph.json","events_json":"https://pith.science/api/pith-number/N54ENHFSLDUGOGTY26WRKHBARO/events.json","paper":"https://pith.science/paper/N54ENHFS"},"agent_actions":{"view_html":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO","download_json":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO.json","view_paper":"https://pith.science/paper/N54ENHFS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.09111&json=true","fetch_graph":"https://pith.science/api/pith-number/N54ENHFSLDUGOGTY26WRKHBARO/graph.json","fetch_events":"https://pith.science/api/pith-number/N54ENHFSLDUGOGTY26WRKHBARO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/action/storage_attestation","attest_author":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/action/author_attestation","sign_citation":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/action/citation_signature","submit_replication":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/action/replication_record"}},"created_at":"2026-05-18T00:08:36.006038+00:00","updated_at":"2026-05-18T00:08:36.006038+00:00"}