{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:N54ENHFSLDUGOGTY26WRKHBARO","short_pith_number":"pith:N54ENHFS","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"},"canonical_sha256":"6f78469cb258e8671a78d7ad151c208b9b57c09a48728c63687a5c0ff519e3e5","source":{"kind":"arxiv","id":"1802.09111","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09111","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09111v2","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09111","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"N54ENHFSLDUG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N54ENHFSLDUGOGTY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N54ENHFS","created_at":"2026-05-18T12:32:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:N54ENHFSLDUGOGTY26WRKHBARO","target":"record","payload":{"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"},"canonical_sha256":"6f78469cb258e8671a78d7ad151c208b9b57c09a48728c63687a5c0ff519e3e5","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"},"source_kind":"arxiv","source_id":"1802.09111","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-05-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZE4ydrwaKAoW9bMdXEP+FXIKoAyeEv7GPG4oL45hZ9Tk7MO8wmwURUjSase4PN+x3YCb2AHw7qEnaD0fcI7WDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:36:39.998127Z"},"content_sha256":"c896c4360a08fb238779c00b701a5bf3beb3fba6ede3dfb05ba977fa3effa483","schema_version":"1.0","event_id":"sha256:c896c4360a08fb238779c00b701a5bf3beb3fba6ede3dfb05ba977fa3effa483"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:N54ENHFSLDUGOGTY26WRKHBARO","target":"graph","payload":{"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"},"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-05-18T00:08:36Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Tkwlah+LpJvm4/qpPvWjzIGxlBCeurgM2WaP5a2GISnE7djTg+rmcaYd2wKbMxihCPwQaFxwtKcvMivytZVPBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T06:36:39.998744Z"},"content_sha256":"c1307a8068fbc8e1ea5b47382c720d8ff415cd1877451e76bb61898733b787c6","schema_version":"1.0","event_id":"sha256:c1307a8068fbc8e1ea5b47382c720d8ff415cd1877451e76bb61898733b787c6"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/bundle.json","state_url":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N54ENHFSLDUGOGTY26WRKHBARO/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-06-11T06:36:40Z","links":{"resolver":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO","bundle":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/bundle.json","state":"https://pith.science/pith/N54ENHFSLDUGOGTY26WRKHBARO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N54ENHFSLDUGOGTY26WRKHBARO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:N54ENHFSLDUGOGTY26WRKHBARO","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":"ddb3aaf3cdb20f024426a0e5f35d749c6211740c494070a5b731d11d52d0193b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T00:15:44Z","title_canon_sha256":"58c8df2bd3bbfc1a20374f1b96a41d0e4a90fa201b92d814ca0ad1e1845fdcf2"},"schema_version":"1.0","source":{"id":"1802.09111","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.09111","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"arxiv_version","alias_value":"1802.09111v2","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.09111","created_at":"2026-05-18T00:08:36Z"},{"alias_kind":"pith_short_12","alias_value":"N54ENHFSLDUG","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_16","alias_value":"N54ENHFSLDUGOGTY","created_at":"2026-05-18T12:32:40Z"},{"alias_kind":"pith_short_8","alias_value":"N54ENHFS","created_at":"2026-05-18T12:32:40Z"}],"graph_snapshots":[{"event_id":"sha256:c1307a8068fbc8e1ea5b47382c720d8ff415cd1877451e76bb61898733b787c6","target":"graph","created_at":"2026-05-18T00:08:36Z","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"},"paper":{"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 $","authors_text":"Gramoz Goranci, Monika Henzinger, Pan Peng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T00:15:44Z","title":"Dynamic Effective Resistances and Approximate Schur Complement on Separable Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.09111","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:c896c4360a08fb238779c00b701a5bf3beb3fba6ede3dfb05ba977fa3effa483","target":"record","created_at":"2026-05-18T00:08:36Z","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":"ddb3aaf3cdb20f024426a0e5f35d749c6211740c494070a5b731d11d52d0193b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-02-26T00:15:44Z","title_canon_sha256":"58c8df2bd3bbfc1a20374f1b96a41d0e4a90fa201b92d814ca0ad1e1845fdcf2"},"schema_version":"1.0","source":{"id":"1802.09111","kind":"arxiv","version":2}},"canonical_sha256":"6f78469cb258e8671a78d7ad151c208b9b57c09a48728c63687a5c0ff519e3e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6f78469cb258e8671a78d7ad151c208b9b57c09a48728c63687a5c0ff519e3e5","first_computed_at":"2026-05-18T00:08:36.005929Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:08:36.005929Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yRUvHOzSbHzr+ZHaVVOZZk2aYiTked2SslMcWWhL89aMwg6QlLUCiCXyrZu4xIGU4XDr/jlui4ctLMouGGLkCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:08:36.006578Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.09111","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c896c4360a08fb238779c00b701a5bf3beb3fba6ede3dfb05ba977fa3effa483","sha256:c1307a8068fbc8e1ea5b47382c720d8ff415cd1877451e76bb61898733b787c6"],"state_sha256":"2c8ae2978b4b3fb8e2e36ee69597ec46e230ad5868f39bacb44a20e574015fd9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EtxccNhZRrTz9R0GiPrKCfJ3Ui5hTTv4RO8FePLUst5rUPiNQFa8nmqT/A+IDpeR44HlOaGLjqPGywQmJJk+Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T06:36:40.002433Z","bundle_sha256":"1510c4b54ae8a4d27c4df7d84950426cc00b77422bb3359ca796f7db0cb03fea"}}