{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:FYXE5AE3MDKN6CZMKDWHW4HS7Z","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"086445fce11a33497faaa4a93176c1916fdc8dd927eb1be7b2ca1aabbbc482e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-30T14:54:41Z","title_canon_sha256":"917baec8785a9fc1fa1939ad376cb78e8f83708d0f611d0926dee506d9f499cc"},"schema_version":"1.0","source":{"id":"1706.10228","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.10228","created_at":"2026-05-18T00:41:09Z"},{"alias_kind":"arxiv_version","alias_value":"1706.10228v1","created_at":"2026-05-18T00:41:09Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.10228","created_at":"2026-05-18T00:41:09Z"},{"alias_kind":"pith_short_12","alias_value":"FYXE5AE3MDKN","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_16","alias_value":"FYXE5AE3MDKN6CZM","created_at":"2026-05-18T12:31:15Z"},{"alias_kind":"pith_short_8","alias_value":"FYXE5AE3","created_at":"2026-05-18T12:31:15Z"}],"graph_snapshots":[{"event_id":"sha256:74686aa2251e888a8a54ce776d5d4d7ecec6797b1347ac7a795625018ed4922b","target":"graph","created_at":"2026-05-18T00:41:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Adam Karczmarz, Eva Rotenberg, Giuseppe F. Italiano, Jacob Holm, Jakub {\\L}\\k{a}cki, Piotr Sankowski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-30T14:54:41Z","title":"Contracting a Planar Graph Efficiently"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.10228","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:55fdcafe640955870781f18eacf8778650bc792d5f70bce308d9c1c46aa7aef6","target":"record","created_at":"2026-05-18T00:41:09Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"086445fce11a33497faaa4a93176c1916fdc8dd927eb1be7b2ca1aabbbc482e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-30T14:54:41Z","title_canon_sha256":"917baec8785a9fc1fa1939ad376cb78e8f83708d0f611d0926dee506d9f499cc"},"schema_version":"1.0","source":{"id":"1706.10228","kind":"arxiv","version":1}},"canonical_sha256":"2e2e4e809b60d4df0b2c50ec7b70f2fe5bea2fdc5cb6700c553df6bf99704327","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2e2e4e809b60d4df0b2c50ec7b70f2fe5bea2fdc5cb6700c553df6bf99704327","first_computed_at":"2026-05-18T00:41:09.056932Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:09.056932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Cvp0M7WetDzMoO3GCSWdCAkL0wrXNj+bZVJpQGbM2v+AH0PejlbtQ2MOBof68KlNumRd8Yqxg/J7pyu2bpufCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:09.057532Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.10228","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:55fdcafe640955870781f18eacf8778650bc792d5f70bce308d9c1c46aa7aef6","sha256:74686aa2251e888a8a54ce776d5d4d7ecec6797b1347ac7a795625018ed4922b"],"state_sha256":"5b54c09efd7b36ba57cd28a8e697f89d05904cb65bd89d9d5ce73c94e6ec3c17"}