{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YKCYY5KVSRE2EK3M6FY7KONV2R","short_pith_number":"pith:YKCYY5KV","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"},"canonical_sha256":"c2858c75559449a22b6cf171f539b5d45ee20555c1456f2a008568e6c9a832b2","source":{"kind":"arxiv","id":"1806.10772","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10772","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10772v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10772","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"YKCYY5KVSRE2","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YKCYY5KVSRE2EK3M","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YKCYY5KV","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YKCYY5KVSRE2EK3M6FY7KONV2R","target":"record","payload":{"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"},"canonical_sha256":"c2858c75559449a22b6cf171f539b5d45ee20555c1456f2a008568e6c9a832b2","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"},"source_kind":"arxiv","source_id":"1806.10772","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"daJQE0CBEjua8QAfXZoM0P84rSeNWGzS/uGFLyys4invc3zKCcoD8ajY8CaHHO+XENv4ka9EcJ8pZXvZ58aRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:00:49.722045Z"},"content_sha256":"ea3181312f6fba9b2b8b1d46173bd96a9506a7b3b9cc75bb5f0b246704db7f6b","schema_version":"1.0","event_id":"sha256:ea3181312f6fba9b2b8b1d46173bd96a9506a7b3b9cc75bb5f0b246704db7f6b"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YKCYY5KVSRE2EK3M6FY7KONV2R","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:12:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q/N2VPJ2SUZEhSCMoMS15ibqShnOgwssH4kD91gZIFJXgk5iGqlT0S/Zh9hRIBK5Tn2XJ/E5dUUm5Qkflm1xBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:00:49.722670Z"},"content_sha256":"645ce2d108bc78dffb11befd29557595b807f1dba835d8f711b7678108a1f5b1","schema_version":"1.0","event_id":"sha256:645ce2d108bc78dffb11befd29557595b807f1dba835d8f711b7678108a1f5b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/bundle.json","state_url":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-26T12:00:49Z","links":{"resolver":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R","bundle":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/bundle.json","state":"https://pith.science/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YKCYY5KVSRE2EK3M6FY7KONV2R/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YKCYY5KVSRE2EK3M6FY7KONV2R","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":"620d51edc61e3eee8b0497c649de2815253a5d829c96ec054a7fcb42d96acc65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-28T05:17:44Z","title_canon_sha256":"c2dcff006a548eace1f051b6f5e2faf3f26ba3044f046f4f3d2ea7fece898518"},"schema_version":"1.0","source":{"id":"1806.10772","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.10772","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"arxiv_version","alias_value":"1806.10772v1","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.10772","created_at":"2026-05-18T00:12:07Z"},{"alias_kind":"pith_short_12","alias_value":"YKCYY5KVSRE2","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YKCYY5KVSRE2EK3M","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YKCYY5KV","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:645ce2d108bc78dffb11befd29557595b807f1dba835d8f711b7678108a1f5b1","target":"graph","created_at":"2026-05-18T00:12:07Z","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 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","authors_text":"Adam Karczmarz, Eva Rotenberg, Giuseppe F. Italiano, Jacob Holm, Jakub {\\L}\\k{a}cki","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-28T05:17:44Z","title":"Decremental SPQR-trees for Planar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.10772","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:ea3181312f6fba9b2b8b1d46173bd96a9506a7b3b9cc75bb5f0b246704db7f6b","target":"record","created_at":"2026-05-18T00:12:07Z","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":"620d51edc61e3eee8b0497c649de2815253a5d829c96ec054a7fcb42d96acc65","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-28T05:17:44Z","title_canon_sha256":"c2dcff006a548eace1f051b6f5e2faf3f26ba3044f046f4f3d2ea7fece898518"},"schema_version":"1.0","source":{"id":"1806.10772","kind":"arxiv","version":1}},"canonical_sha256":"c2858c75559449a22b6cf171f539b5d45ee20555c1456f2a008568e6c9a832b2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c2858c75559449a22b6cf171f539b5d45ee20555c1456f2a008568e6c9a832b2","first_computed_at":"2026-05-18T00:12:07.960501Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:07.960501Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bbh0DTP2wue0TrYOi+oKyDzt2nvAuPqSHTt245BAXQduneUYROGUTlaPVUQBKMTkuX2BPuxza7WHRClFP1ZVDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:07.961028Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.10772","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea3181312f6fba9b2b8b1d46173bd96a9506a7b3b9cc75bb5f0b246704db7f6b","sha256:645ce2d108bc78dffb11befd29557595b807f1dba835d8f711b7678108a1f5b1"],"state_sha256":"a67829193beb105cb5204bed98e842a1daf72677a0a509ff5a68d9881dfb2dad"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8kDpcEoNDnfEF196/aRfc2N0rshYOAfdSJK+D7JCRp5xxjONnpfu0n5YdbhF/830BUoDiVkHYqAXi39tJc19AA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:00:49.725149Z","bundle_sha256":"f950a80ba51b4758ae167acfef6af2da6e4c4a5ac1036b017136107d304e1452"}}