{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MVLQDABPHL2A736QE7MHWBUGAB","short_pith_number":"pith:MVLQDABP","schema_version":"1.0","canonical_sha256":"655701802f3af40fefd027d87b0686007e801aa22eb16954413966f4df89aff7","source":{"kind":"arxiv","id":"1704.08235","version":1},"attestation_state":"computed","paper":{"title":"Decremental Data Structures for Connectivity and Dominators in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Sebastian Krinninger, Thomas Dueholm Hansen","submitted_at":"2017-04-26T17:44:20Z","abstract_excerpt":"We introduce a new dynamic data structure for maintaining the strongly connected components (SCCs) of a directed graph (digraph) under edge deletions, so as to answer a rich repertoire of connectivity queries. Our main technical contribution is a decremental data structure that supports sensitivity queries of the form \"are $ u $ and $ v $ strongly connected in the graph $ G \\setminus w $?\", for any triple of vertices $ u, v, w $, while $ G $ undergoes deletions of edges. Our data structure processes a sequence of edge deletions in a digraph with $n$ vertices in $O(m n \\log{n})$ total time and "},"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":"1704.08235","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-04-26T17:44:20Z","cross_cats_sorted":[],"title_canon_sha256":"ffd134c802602b121b599fb3e82758cc71e2088a83f5f71406d96ac99c35b28f","abstract_canon_sha256":"a8b588500e262cf4d78bf6cef665f4a54d7adc3d73420bd06fb4c047c80b60fa"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:22:16.248985Z","signature_b64":"+HfoVBHmZWQnawrAzSpghKhJLs9mKjlZboyjfJxH2aqJKHxKtfjLkkiMopZKCb+C88KmLjvnj+wpDGPQ2XHPCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"655701802f3af40fefd027d87b0686007e801aa22eb16954413966f4df89aff7","last_reissued_at":"2026-05-18T00:22:16.248353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:22:16.248353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decremental Data Structures for Connectivity and Dominators in Directed Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Giuseppe F. Italiano, Loukas Georgiadis, Nikos Parotsidis, Sebastian Krinninger, Thomas Dueholm Hansen","submitted_at":"2017-04-26T17:44:20Z","abstract_excerpt":"We introduce a new dynamic data structure for maintaining the strongly connected components (SCCs) of a directed graph (digraph) under edge deletions, so as to answer a rich repertoire of connectivity queries. Our main technical contribution is a decremental data structure that supports sensitivity queries of the form \"are $ u $ and $ v $ strongly connected in the graph $ G \\setminus w $?\", for any triple of vertices $ u, v, w $, while $ G $ undergoes deletions of edges. Our data structure processes a sequence of edge deletions in a digraph with $n$ vertices in $O(m n \\log{n})$ total time and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1704.08235","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":"1704.08235","created_at":"2026-05-18T00:22:16.248474+00:00"},{"alias_kind":"arxiv_version","alias_value":"1704.08235v1","created_at":"2026-05-18T00:22:16.248474+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1704.08235","created_at":"2026-05-18T00:22:16.248474+00:00"},{"alias_kind":"pith_short_12","alias_value":"MVLQDABPHL2A","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MVLQDABPHL2A736Q","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MVLQDABP","created_at":"2026-05-18T12:31:31.346846+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/MVLQDABPHL2A736QE7MHWBUGAB","json":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB.json","graph_json":"https://pith.science/api/pith-number/MVLQDABPHL2A736QE7MHWBUGAB/graph.json","events_json":"https://pith.science/api/pith-number/MVLQDABPHL2A736QE7MHWBUGAB/events.json","paper":"https://pith.science/paper/MVLQDABP"},"agent_actions":{"view_html":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB","download_json":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB.json","view_paper":"https://pith.science/paper/MVLQDABP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1704.08235&json=true","fetch_graph":"https://pith.science/api/pith-number/MVLQDABPHL2A736QE7MHWBUGAB/graph.json","fetch_events":"https://pith.science/api/pith-number/MVLQDABPHL2A736QE7MHWBUGAB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB/action/storage_attestation","attest_author":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB/action/author_attestation","sign_citation":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB/action/citation_signature","submit_replication":"https://pith.science/pith/MVLQDABPHL2A736QE7MHWBUGAB/action/replication_record"}},"created_at":"2026-05-18T00:22:16.248474+00:00","updated_at":"2026-05-18T00:22:16.248474+00:00"}