{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:EMCSJXURFPUZCV6GNXDFQDANZR","short_pith_number":"pith:EMCSJXUR","canonical_record":{"source":{"id":"1606.04679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T08:44:16Z","cross_cats_sorted":[],"title_canon_sha256":"5d880f67073bd2dd751bcacbf2e6582d9ff8d89d3a8bb164fb113955313a6ede","abstract_canon_sha256":"f2917e5ff302f4b083ae4cd9bb15c05d2ca205a8f7f01c81119fbc6794077122"},"schema_version":"1.0"},"canonical_sha256":"230524de912be99157c66dc6580c0dcc5a93c028d68289b3854797f3f19165cf","source":{"kind":"arxiv","id":"1606.04679","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04679","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04679v2","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04679","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"EMCSJXURFPUZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMCSJXURFPUZCV6G","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMCSJXUR","created_at":"2026-05-18T12:30:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:EMCSJXURFPUZCV6GNXDFQDANZR","target":"record","payload":{"canonical_record":{"source":{"id":"1606.04679","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T08:44:16Z","cross_cats_sorted":[],"title_canon_sha256":"5d880f67073bd2dd751bcacbf2e6582d9ff8d89d3a8bb164fb113955313a6ede","abstract_canon_sha256":"f2917e5ff302f4b083ae4cd9bb15c05d2ca205a8f7f01c81119fbc6794077122"},"schema_version":"1.0"},"canonical_sha256":"230524de912be99157c66dc6580c0dcc5a93c028d68289b3854797f3f19165cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:34.142111Z","signature_b64":"Xgp1aJ0JLpduFLS/mrbZA2kehi8IGo3hE5fk0fsyIePauHPjjv3wiGUUkLmAXQUPi8lKcChLHs58D6BU/KiKAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"230524de912be99157c66dc6580c0dcc5a93c028d68289b3854797f3f19165cf","last_reissued_at":"2026-05-18T00:55:34.141420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:34.141420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1606.04679","source_version":2,"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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HHp78x3CywYP4jKk84MN8eOXnZKSeKgPY1m0B/IceESSlOobW/HJ7UzaZaeemDUEJ+y6ryL8K0D4EhgX0u99Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:51:58.190208Z"},"content_sha256":"a9d4f05d139728fd83806eeb52bae607d50c2407c14d4539487827132bd3c961","schema_version":"1.0","event_id":"sha256:a9d4f05d139728fd83806eeb52bae607d50c2407c14d4539487827132bd3c961"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:EMCSJXURFPUZCV6GNXDFQDANZR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Dieter Kratsch, Frank Kammer, Moritz Laudahn","submitted_at":"2016-06-15T08:44:16Z","abstract_excerpt":"We present space-efficient algorithms for computing cut vertices in a given graph with $n$ vertices and $m$ edges in linear time using $O(n+\\min\\{m,n\\log \\log n\\})$ bits. With the same time and using $O(n+m)$ bits, we can compute the biconnected components of a graph. We use this result to show an algorithm for the recognition of (maximal) outerplanar graphs in $O(n\\log \\log n)$ time using $O(n)$ bits."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04679","kind":"arxiv","version":2},"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:55:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1n40sx5Hu54DiBZhR3b6RbJq6F/KLT0a/TesNvY2lsvsgE/UHwOQOpzYemljlMwc1qRRSP2zcXXqbTJdc+3PDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-26T17:51:58.190566Z"},"content_sha256":"48de5f60dbf30e437a7ae58e51de964614909c3f2b9b43e3bb35f2341905a308","schema_version":"1.0","event_id":"sha256:48de5f60dbf30e437a7ae58e51de964614909c3f2b9b43e3bb35f2341905a308"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/bundle.json","state_url":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EMCSJXURFPUZCV6GNXDFQDANZR/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-06-26T17:51:58Z","links":{"resolver":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR","bundle":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/bundle.json","state":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EMCSJXURFPUZCV6GNXDFQDANZR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:EMCSJXURFPUZCV6GNXDFQDANZR","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":"f2917e5ff302f4b083ae4cd9bb15c05d2ca205a8f7f01c81119fbc6794077122","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T08:44:16Z","title_canon_sha256":"5d880f67073bd2dd751bcacbf2e6582d9ff8d89d3a8bb164fb113955313a6ede"},"schema_version":"1.0","source":{"id":"1606.04679","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1606.04679","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"arxiv_version","alias_value":"1606.04679v2","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04679","created_at":"2026-05-18T00:55:34Z"},{"alias_kind":"pith_short_12","alias_value":"EMCSJXURFPUZ","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_16","alias_value":"EMCSJXURFPUZCV6G","created_at":"2026-05-18T12:30:12Z"},{"alias_kind":"pith_short_8","alias_value":"EMCSJXUR","created_at":"2026-05-18T12:30:12Z"}],"graph_snapshots":[{"event_id":"sha256:48de5f60dbf30e437a7ae58e51de964614909c3f2b9b43e3bb35f2341905a308","target":"graph","created_at":"2026-05-18T00:55:34Z","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 space-efficient algorithms for computing cut vertices in a given graph with $n$ vertices and $m$ edges in linear time using $O(n+\\min\\{m,n\\log \\log n\\})$ bits. With the same time and using $O(n+m)$ bits, we can compute the biconnected components of a graph. We use this result to show an algorithm for the recognition of (maximal) outerplanar graphs in $O(n\\log \\log n)$ time using $O(n)$ bits.","authors_text":"Dieter Kratsch, Frank Kammer, Moritz Laudahn","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T08:44:16Z","title":"Space-Efficient Biconnected Components and Recognition of Outerplanar Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.04679","kind":"arxiv","version":2},"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:a9d4f05d139728fd83806eeb52bae607d50c2407c14d4539487827132bd3c961","target":"record","created_at":"2026-05-18T00:55:34Z","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":"f2917e5ff302f4b083ae4cd9bb15c05d2ca205a8f7f01c81119fbc6794077122","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-06-15T08:44:16Z","title_canon_sha256":"5d880f67073bd2dd751bcacbf2e6582d9ff8d89d3a8bb164fb113955313a6ede"},"schema_version":"1.0","source":{"id":"1606.04679","kind":"arxiv","version":2}},"canonical_sha256":"230524de912be99157c66dc6580c0dcc5a93c028d68289b3854797f3f19165cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"230524de912be99157c66dc6580c0dcc5a93c028d68289b3854797f3f19165cf","first_computed_at":"2026-05-18T00:55:34.141420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:55:34.141420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Xgp1aJ0JLpduFLS/mrbZA2kehi8IGo3hE5fk0fsyIePauHPjjv3wiGUUkLmAXQUPi8lKcChLHs58D6BU/KiKAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:55:34.142111Z","signed_message":"canonical_sha256_bytes"},"source_id":"1606.04679","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a9d4f05d139728fd83806eeb52bae607d50c2407c14d4539487827132bd3c961","sha256:48de5f60dbf30e437a7ae58e51de964614909c3f2b9b43e3bb35f2341905a308"],"state_sha256":"314841de5a8410dbbc55728d65f844454560f246c6f1f3982f1ad7ab8e7fdc51"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1yC45maIRXFJ1s+28+J6ZJvDZwR0GOS1g4q4Ytsw3AOUyFJ3lfc+4O53qGoNMu66+R4zXlN9SKDNjVz6X0vOAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-26T17:51:58.192428Z","bundle_sha256":"217fca86e4f0d184a82e1bf13088b68ee151269caf724a00dd0a3926f24341f3"}}