{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YKCYY5KVSRE2EK3M6FY7KONV2R","short_pith_number":"pith:YKCYY5KV","schema_version":"1.0","canonical_sha256":"c2858c75559449a22b6cf171f539b5d45ee20555c1456f2a008568e6c9a832b2","source":{"kind":"arxiv","id":"1806.10772","version":1},"attestation_state":"computed","paper":{"title":"Decremental SPQR-trees for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Eva Rotenberg, Giuseppe F. Italiano, Jacob Holm, Jakub {\\L}\\k{a}cki","submitted_at":"2018-06-28T05:17:44Z","abstract_excerpt":"We present a decremental data structure for maintaining the SPQR-tree of a planar graph subject to edge contractions and deletions. The update time, amortized over $\\Omega(n)$ operations, is $O(\\log^2 n)$.\n  Via SPQR-trees, we give a decremental data structure for maintaining $3$-vertex connectivity in planar graphs. It answers queries in $O(1)$ time and processes edge deletions and contractions in $O(\\log^2 n)$ amortized time. This is an exponential improvement over the previous best bound of $O(\\sqrt{n}\\,)$ that has stood for over 20 years. In addition, the previous data structures only supp"},"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":"1806.10772","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-28T05:17:44Z","cross_cats_sorted":[],"title_canon_sha256":"c2dcff006a548eace1f051b6f5e2faf3f26ba3044f046f4f3d2ea7fece898518","abstract_canon_sha256":"620d51edc61e3eee8b0497c649de2815253a5d829c96ec054a7fcb42d96acc65"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:07.961028Z","signature_b64":"Bbh0DTP2wue0TrYOi+oKyDzt2nvAuPqSHTt245BAXQduneUYROGUTlaPVUQBKMTkuX2BPuxza7WHRClFP1ZVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2858c75559449a22b6cf171f539b5d45ee20555c1456f2a008568e6c9a832b2","last_reissued_at":"2026-05-18T00:12:07.960501Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:07.960501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Decremental SPQR-trees for Planar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Karczmarz, Eva Rotenberg, Giuseppe F. Italiano, Jacob Holm, Jakub {\\L}\\k{a}cki","submitted_at":"2018-06-28T05:17:44Z","abstract_excerpt":"We present a decremental data structure for maintaining the SPQR-tree of a planar graph subject to edge contractions and deletions. The update time, amortized over $\\Omega(n)$ operations, is $O(\\log^2 n)$.\n  Via SPQR-trees, we give a decremental data structure for maintaining $3$-vertex connectivity in planar graphs. It answers queries in $O(1)$ time and processes edge deletions and contractions in $O(\\log^2 n)$ amortized time. This is an exponential improvement over the previous best bound of $O(\\sqrt{n}\\,)$ that has stood for over 20 years. In addition, the previous data structures only supp"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10772","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":"1806.10772","created_at":"2026-05-18T00:12:07.960587+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.10772v1","created_at":"2026-05-18T00:12:07.960587+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10772","created_at":"2026-05-18T00:12:07.960587+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKCYY5KVSRE2","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKCYY5KVSRE2EK3M","created_at":"2026-05-18T12:33:04.347982+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKCYY5KV","created_at":"2026-05-18T12:33:04.347982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.22365","citing_title":"Dynamic Planar Graph Isomorphism is in DynFO","ref_index":20,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R","json":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R.json","graph_json":"https://pith.science/api/pith-number/YKCYY5KVSRE2EK3M6FY7KONV2R/graph.json","events_json":"https://pith.science/api/pith-number/YKCYY5KVSRE2EK3M6FY7KONV2R/events.json","paper":"https://pith.science/paper/YKCYY5KV"},"agent_actions":{"view_html":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R","download_json":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R.json","view_paper":"https://pith.science/paper/YKCYY5KV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.10772&json=true","fetch_graph":"https://pith.science/api/pith-number/YKCYY5KVSRE2EK3M6FY7KONV2R/graph.json","fetch_events":"https://pith.science/api/pith-number/YKCYY5KVSRE2EK3M6FY7KONV2R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/action/storage_attestation","attest_author":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/action/author_attestation","sign_citation":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/action/citation_signature","submit_replication":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/action/replication_record"}},"created_at":"2026-05-18T00:12:07.960587+00:00","updated_at":"2026-05-18T00:12:07.960587+00:00"}