{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:EMCSJXURFPUZCV6GNXDFQDANZR","short_pith_number":"pith:EMCSJXUR","schema_version":"1.0","canonical_sha256":"230524de912be99157c66dc6580c0dcc5a93c028d68289b3854797f3f19165cf","source":{"kind":"arxiv","id":"1606.04679","version":2},"attestation_state":"computed","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."},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1606.04679","created_at":"2026-05-18T00:55:34.141537+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.04679v2","created_at":"2026-05-18T00:55:34.141537+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.04679","created_at":"2026-05-18T00:55:34.141537+00:00"},{"alias_kind":"pith_short_12","alias_value":"EMCSJXURFPUZ","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_16","alias_value":"EMCSJXURFPUZCV6G","created_at":"2026-05-18T12:30:12.583610+00:00"},{"alias_kind":"pith_short_8","alias_value":"EMCSJXUR","created_at":"2026-05-18T12:30:12.583610+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/EMCSJXURFPUZCV6GNXDFQDANZR","json":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR.json","graph_json":"https://pith.science/api/pith-number/EMCSJXURFPUZCV6GNXDFQDANZR/graph.json","events_json":"https://pith.science/api/pith-number/EMCSJXURFPUZCV6GNXDFQDANZR/events.json","paper":"https://pith.science/paper/EMCSJXUR"},"agent_actions":{"view_html":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR","download_json":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR.json","view_paper":"https://pith.science/paper/EMCSJXUR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.04679&json=true","fetch_graph":"https://pith.science/api/pith-number/EMCSJXURFPUZCV6GNXDFQDANZR/graph.json","fetch_events":"https://pith.science/api/pith-number/EMCSJXURFPUZCV6GNXDFQDANZR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/action/storage_attestation","attest_author":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/action/author_attestation","sign_citation":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/action/citation_signature","submit_replication":"https://pith.science/pith/EMCSJXURFPUZCV6GNXDFQDANZR/action/replication_record"}},"created_at":"2026-05-18T00:55:34.141537+00:00","updated_at":"2026-05-18T00:55:34.141537+00:00"}