{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GMWCOYS7CL2W3NHMWILVBG7SET","short_pith_number":"pith:GMWCOYS7","schema_version":"1.0","canonical_sha256":"332c27625f12f56db4ecb217509bf224ce56d3dd38938051283b1559fde6cb49","source":{"kind":"arxiv","id":"1611.09072","version":3},"attestation_state":"computed","paper":{"title":"Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Le Zhang, Ran Duan","submitted_at":"2016-11-28T11:18:27Z","abstract_excerpt":"Real-world networks are prone to breakdowns. Typically in the underlying graph $G$, besides the insertion or deletion of edges, the set of active vertices changes overtime. A vertex might work actively, or it might fail, and gets isolated temporarily. The active vertices are grouped as a set $S$. $S$ is subjected to updates, i.e., a failed vertex restarts, or an active vertex fails, and gets deleted from $S$. Dynamic subgraph connectivity answers the queries on connectivity between any two active vertices in the subgraph of $G$ induced by $S$. The problem is solved by a dynamic data structure,"},"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":"1611.09072","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-28T11:18:27Z","cross_cats_sorted":[],"title_canon_sha256":"0ba259021f3c15756e7c48211a29946210e164950ac7b8942bb3a44975e452c6","abstract_canon_sha256":"039f20de05d02e0055c476b76998ce522698422bbb9b910fa9efaf2df7c7ab16"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:49:51.088622Z","signature_b64":"LeNr7HO5UeOiE/W3WJLoJ7bd2xgAe3FksnkTd2q9/eO3+sEN9fBuX+ha9sB/z0JsMyqByIlfr2xcX1PTwA3jBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"332c27625f12f56db4ecb217509bf224ce56d3dd38938051283b1559fde6cb49","last_reissued_at":"2026-05-18T00:49:51.088108Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:49:51.088108Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster Randomized Worst-Case Update Time for Dynamic Subgraph Connectivity","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Le Zhang, Ran Duan","submitted_at":"2016-11-28T11:18:27Z","abstract_excerpt":"Real-world networks are prone to breakdowns. Typically in the underlying graph $G$, besides the insertion or deletion of edges, the set of active vertices changes overtime. A vertex might work actively, or it might fail, and gets isolated temporarily. The active vertices are grouped as a set $S$. $S$ is subjected to updates, i.e., a failed vertex restarts, or an active vertex fails, and gets deleted from $S$. Dynamic subgraph connectivity answers the queries on connectivity between any two active vertices in the subgraph of $G$ induced by $S$. The problem is solved by a dynamic data structure,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.09072","kind":"arxiv","version":3},"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":"1611.09072","created_at":"2026-05-18T00:49:51.088192+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.09072v3","created_at":"2026-05-18T00:49:51.088192+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.09072","created_at":"2026-05-18T00:49:51.088192+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMWCOYS7CL2W","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMWCOYS7CL2W3NHM","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMWCOYS7","created_at":"2026-05-18T12:30:19.053100+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/GMWCOYS7CL2W3NHMWILVBG7SET","json":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET.json","graph_json":"https://pith.science/api/pith-number/GMWCOYS7CL2W3NHMWILVBG7SET/graph.json","events_json":"https://pith.science/api/pith-number/GMWCOYS7CL2W3NHMWILVBG7SET/events.json","paper":"https://pith.science/paper/GMWCOYS7"},"agent_actions":{"view_html":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET","download_json":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET.json","view_paper":"https://pith.science/paper/GMWCOYS7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.09072&json=true","fetch_graph":"https://pith.science/api/pith-number/GMWCOYS7CL2W3NHMWILVBG7SET/graph.json","fetch_events":"https://pith.science/api/pith-number/GMWCOYS7CL2W3NHMWILVBG7SET/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET/action/storage_attestation","attest_author":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET/action/author_attestation","sign_citation":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET/action/citation_signature","submit_replication":"https://pith.science/pith/GMWCOYS7CL2W3NHMWILVBG7SET/action/replication_record"}},"created_at":"2026-05-18T00:49:51.088192+00:00","updated_at":"2026-05-18T00:49:51.088192+00:00"}