{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:2Y5RRX54TDZHL7OBSBIXVMIPK7","short_pith_number":"pith:2Y5RRX54","schema_version":"1.0","canonical_sha256":"d63b18dfbc98f275fdc190517ab10f57c8ad59296f91e0d7f2bcf6b2e608740d","source":{"kind":"arxiv","id":"1011.6187","version":1},"attestation_state":"computed","paper":{"title":"Contractions, Removals and How to Certify 3-Connectivity in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Jens M. Schmidt","submitted_at":"2010-11-29T10:46:27Z","abstract_excerpt":"It is well-known as an existence result that every 3-connected graph G=(V,E) on more than 4 vertices admits a sequence of contractions and a sequence of removal operations to K_4 such that every intermediate graph is 3-connected. We show that both sequences can be computed in optimal time, improving the previously best known running times of O(|V|^2) to O(|V|+|E|). This settles also the open question of finding a linear time 3-connectivity test that is certifying and extends to a certifying 3-edge-connectivity test in the same time. The certificates used are easy to verify in time O(|E|)."},"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":"1011.6187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2010-11-29T10:46:27Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"6f6bd6d5e6cb85ca39040d1c40bce64dc58cba5d0f5d0b55d8cbbe53be5b4f9f","abstract_canon_sha256":"f1be5a44d57822c51785716bc3ab6c2a418c230e4ac2ef8d9bc7a14b4ff6989a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:34:36.260743Z","signature_b64":"mU+0ugi4VPiunlZdEAs+46JHjUP7y9c6Fb208NXzY5AWNoQ2jJwXcQPIcoOp4bbrx0RGszVJyCMh3d3DUHLTAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d63b18dfbc98f275fdc190517ab10f57c8ad59296f91e0d7f2bcf6b2e608740d","last_reissued_at":"2026-05-18T04:34:36.260311Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:34:36.260311Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contractions, Removals and How to Certify 3-Connectivity in Linear Time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Jens M. Schmidt","submitted_at":"2010-11-29T10:46:27Z","abstract_excerpt":"It is well-known as an existence result that every 3-connected graph G=(V,E) on more than 4 vertices admits a sequence of contractions and a sequence of removal operations to K_4 such that every intermediate graph is 3-connected. We show that both sequences can be computed in optimal time, improving the previously best known running times of O(|V|^2) to O(|V|+|E|). This settles also the open question of finding a linear time 3-connectivity test that is certifying and extends to a certifying 3-edge-connectivity test in the same time. The certificates used are easy to verify in time O(|E|)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1011.6187","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":"1011.6187","created_at":"2026-05-18T04:34:36.260379+00:00"},{"alias_kind":"arxiv_version","alias_value":"1011.6187v1","created_at":"2026-05-18T04:34:36.260379+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1011.6187","created_at":"2026-05-18T04:34:36.260379+00:00"},{"alias_kind":"pith_short_12","alias_value":"2Y5RRX54TDZH","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_16","alias_value":"2Y5RRX54TDZHL7OB","created_at":"2026-05-18T12:26:03.138858+00:00"},{"alias_kind":"pith_short_8","alias_value":"2Y5RRX54","created_at":"2026-05-18T12:26:03.138858+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/2Y5RRX54TDZHL7OBSBIXVMIPK7","json":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7.json","graph_json":"https://pith.science/api/pith-number/2Y5RRX54TDZHL7OBSBIXVMIPK7/graph.json","events_json":"https://pith.science/api/pith-number/2Y5RRX54TDZHL7OBSBIXVMIPK7/events.json","paper":"https://pith.science/paper/2Y5RRX54"},"agent_actions":{"view_html":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7","download_json":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7.json","view_paper":"https://pith.science/paper/2Y5RRX54","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1011.6187&json=true","fetch_graph":"https://pith.science/api/pith-number/2Y5RRX54TDZHL7OBSBIXVMIPK7/graph.json","fetch_events":"https://pith.science/api/pith-number/2Y5RRX54TDZHL7OBSBIXVMIPK7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7/action/storage_attestation","attest_author":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7/action/author_attestation","sign_citation":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7/action/citation_signature","submit_replication":"https://pith.science/pith/2Y5RRX54TDZHL7OBSBIXVMIPK7/action/replication_record"}},"created_at":"2026-05-18T04:34:36.260379+00:00","updated_at":"2026-05-18T04:34:36.260379+00:00"}