{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:3ND7GIQ5VWZW7B4K7KUKAR2WYS","short_pith_number":"pith:3ND7GIQ5","schema_version":"1.0","canonical_sha256":"db47f3221dadb36f878afaa8a04756c4880a200500f9fc8c96b0762f780f4a63","source":{"kind":"arxiv","id":"2301.03972","version":1},"attestation_state":"computed","paper":{"title":"Maintaining Triconnected Components under Node Expansion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ignaz Rutter, Simon D. Fink","submitted_at":"2023-01-10T14:10:48Z","abstract_excerpt":"SPQR-trees are a central component of graph drawing and are also important in many further areas of computer science. From their inception onwards, they have always had a strong relation to dynamic algorithms maintaining information, e.g., on planarity and triconnectivity, under edge insertion and, later on, also deletion. In this paper, we focus on a special kind of dynamic update, the expansion of vertices into arbitrary biconnected graphs, while maintaining the SPQR-tree and further information. This will also allow us to efficiently merge two SPQR-trees by identifying the edges incident to"},"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":"2301.03972","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DS","submitted_at":"2023-01-10T14:10:48Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"148dbec338d60a2301b7cf1c485f754b575f03eef504469f57414f8b90617325","abstract_canon_sha256":"b6382c5bef507361dd7572332ca5e2508ba8b9abb8a57131d463cedc7669be80"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:32:08.375393Z","signature_b64":"wjRR8V6sz5S9RF0FukHHeXs5MklzPOIIsGOu9ADRHhKXnVU6Pcc1joqORuJeBoYdXH6/CP0ph40rlFAMMCe2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"db47f3221dadb36f878afaa8a04756c4880a200500f9fc8c96b0762f780f4a63","last_reissued_at":"2026-07-05T05:32:08.374956Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:32:08.374956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Maintaining Triconnected Components under Node Expansion","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Ignaz Rutter, Simon D. Fink","submitted_at":"2023-01-10T14:10:48Z","abstract_excerpt":"SPQR-trees are a central component of graph drawing and are also important in many further areas of computer science. From their inception onwards, they have always had a strong relation to dynamic algorithms maintaining information, e.g., on planarity and triconnectivity, under edge insertion and, later on, also deletion. In this paper, we focus on a special kind of dynamic update, the expansion of vertices into arbitrary biconnected graphs, while maintaining the SPQR-tree and further information. This will also allow us to efficiently merge two SPQR-trees by identifying the edges incident to"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2301.03972","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2301.03972/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2301.03972","created_at":"2026-07-05T05:32:08.375036+00:00"},{"alias_kind":"arxiv_version","alias_value":"2301.03972v1","created_at":"2026-07-05T05:32:08.375036+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2301.03972","created_at":"2026-07-05T05:32:08.375036+00:00"},{"alias_kind":"pith_short_12","alias_value":"3ND7GIQ5VWZW","created_at":"2026-07-05T05:32:08.375036+00:00"},{"alias_kind":"pith_short_16","alias_value":"3ND7GIQ5VWZW7B4K","created_at":"2026-07-05T05:32:08.375036+00:00"},{"alias_kind":"pith_short_8","alias_value":"3ND7GIQ5","created_at":"2026-07-05T05:32:08.375036+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/3ND7GIQ5VWZW7B4K7KUKAR2WYS","json":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS.json","graph_json":"https://pith.science/api/pith-number/3ND7GIQ5VWZW7B4K7KUKAR2WYS/graph.json","events_json":"https://pith.science/api/pith-number/3ND7GIQ5VWZW7B4K7KUKAR2WYS/events.json","paper":"https://pith.science/paper/3ND7GIQ5"},"agent_actions":{"view_html":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS","download_json":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS.json","view_paper":"https://pith.science/paper/3ND7GIQ5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2301.03972&json=true","fetch_graph":"https://pith.science/api/pith-number/3ND7GIQ5VWZW7B4K7KUKAR2WYS/graph.json","fetch_events":"https://pith.science/api/pith-number/3ND7GIQ5VWZW7B4K7KUKAR2WYS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS/action/storage_attestation","attest_author":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS/action/author_attestation","sign_citation":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS/action/citation_signature","submit_replication":"https://pith.science/pith/3ND7GIQ5VWZW7B4K7KUKAR2WYS/action/replication_record"}},"created_at":"2026-07-05T05:32:08.375036+00:00","updated_at":"2026-07-05T05:32:08.375036+00:00"}