{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:FYXE5AE3MDKN6CZMKDWHW4HS7Z","short_pith_number":"pith:FYXE5AE3","schema_version":"1.0","canonical_sha256":"2e2e4e809b60d4df0b2c50ec7b70f2fe5bea2fdc5cb6700c553df6bf99704327","source":{"kind":"arxiv","id":"1706.10228","version":1},"attestation_state":"computed","paper":{"title":"Contracting a Planar Graph Efficiently","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, Piotr Sankowski","submitted_at":"2017-06-30T14:54:41Z","abstract_excerpt":"We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in $O(1)$ time. Moreover, it can report all the arising self-loops and parallel edges.\n  By applying the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several plan"},"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":"1706.10228","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-30T14:54:41Z","cross_cats_sorted":[],"title_canon_sha256":"917baec8785a9fc1fa1939ad376cb78e8f83708d0f611d0926dee506d9f499cc","abstract_canon_sha256":"086445fce11a33497faaa4a93176c1916fdc8dd927eb1be7b2ca1aabbbc482e3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:09.057532Z","signature_b64":"Cvp0M7WetDzMoO3GCSWdCAkL0wrXNj+bZVJpQGbM2v+AH0PejlbtQ2MOBof68KlNumRd8Yqxg/J7pyu2bpufCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2e2e4e809b60d4df0b2c50ec7b70f2fe5bea2fdc5cb6700c553df6bf99704327","last_reissued_at":"2026-05-18T00:41:09.056932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:09.056932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Contracting a Planar Graph Efficiently","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, Piotr Sankowski","submitted_at":"2017-06-30T14:54:41Z","abstract_excerpt":"We present a data structure that can maintain a simple planar graph under edge contractions in linear total time. The data structure supports adjacency queries and provides access to neighbor lists in $O(1)$ time. Moreover, it can report all the arising self-loops and parallel edges.\n  By applying the data structure, we can achieve optimal running times for decremental bridge detection, 2-edge connectivity, maximal 3-edge connected components, and the problem of finding a unique perfect matching for a static planar graph. Furthermore, we improve the running times of algorithms for several plan"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10228","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":"1706.10228","created_at":"2026-05-18T00:41:09.057032+00:00"},{"alias_kind":"arxiv_version","alias_value":"1706.10228v1","created_at":"2026-05-18T00:41:09.057032+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10228","created_at":"2026-05-18T00:41:09.057032+00:00"},{"alias_kind":"pith_short_12","alias_value":"FYXE5AE3MDKN","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_16","alias_value":"FYXE5AE3MDKN6CZM","created_at":"2026-05-18T12:31:15.632608+00:00"},{"alias_kind":"pith_short_8","alias_value":"FYXE5AE3","created_at":"2026-05-18T12:31:15.632608+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/FYXE5AE3MDKN6CZMKDWHW4HS7Z","json":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z.json","graph_json":"https://pith.science/api/pith-number/FYXE5AE3MDKN6CZMKDWHW4HS7Z/graph.json","events_json":"https://pith.science/api/pith-number/FYXE5AE3MDKN6CZMKDWHW4HS7Z/events.json","paper":"https://pith.science/paper/FYXE5AE3"},"agent_actions":{"view_html":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z","download_json":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z.json","view_paper":"https://pith.science/paper/FYXE5AE3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1706.10228&json=true","fetch_graph":"https://pith.science/api/pith-number/FYXE5AE3MDKN6CZMKDWHW4HS7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/FYXE5AE3MDKN6CZMKDWHW4HS7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z/action/storage_attestation","attest_author":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z/action/author_attestation","sign_citation":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z/action/citation_signature","submit_replication":"https://pith.science/pith/FYXE5AE3MDKN6CZMKDWHW4HS7Z/action/replication_record"}},"created_at":"2026-05-18T00:41:09.057032+00:00","updated_at":"2026-05-18T00:41:09.057032+00:00"}