{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:IHPBQUIMJUGTXHGJWVVVTAYALO","short_pith_number":"pith:IHPBQUIM","schema_version":"1.0","canonical_sha256":"41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00","source":{"kind":"arxiv","id":"1806.07586","version":1},"attestation_state":"computed","paper":{"title":"Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Thore Husfeldt","submitted_at":"2018-06-20T07:26:37Z","abstract_excerpt":"Given an undirected graph and two disjoint vertex pairs $s_1,t_1$ and $s_2,t_2$, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting $s_1$ with $t_1$, and $s_2$ with $t_2$, respectively.\n  We show that for cubic planar graphs there are NC algorithms, uniform circuits of polynomial size and polylogarithmic depth, that compute the S2DP and moreover also output the number of such minimum length path pairs.\n  Previously, to the best of our knowledge, no deterministic polynomial time algorithm was known for S2DP in cubic planar gr"},"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":"1806.07586","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-20T07:26:37Z","cross_cats_sorted":[],"title_canon_sha256":"bae3b9dbe1fde5b558f8959ab53842653963487a1fde1d06da0f0da98ab8c0b4","abstract_canon_sha256":"94154fbd39d208922f59b5aa19b5694625d642cda0e42e84d0d4e67747293cf0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:12:47.277552Z","signature_b64":"xAWO6Rdy9nYFMfO6qymXjqDj3Y3Vzd77UZhgiwnLHn56xKb9UneG+2ewe6rsM1TEW+5wl47hEG5FfzLyDHUHDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00","last_reissued_at":"2026-05-18T00:12:47.276989Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:12:47.276989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Andreas Bj\\\"orklund, Thore Husfeldt","submitted_at":"2018-06-20T07:26:37Z","abstract_excerpt":"Given an undirected graph and two disjoint vertex pairs $s_1,t_1$ and $s_2,t_2$, the Shortest two disjoint paths problem (S2DP) asks for the minimum total length of two vertex disjoint paths connecting $s_1$ with $t_1$, and $s_2$ with $t_2$, respectively.\n  We show that for cubic planar graphs there are NC algorithms, uniform circuits of polynomial size and polylogarithmic depth, that compute the S2DP and moreover also output the number of such minimum length path pairs.\n  Previously, to the best of our knowledge, no deterministic polynomial time algorithm was known for S2DP in cubic planar gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07586","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":"1806.07586","created_at":"2026-05-18T00:12:47.277068+00:00"},{"alias_kind":"arxiv_version","alias_value":"1806.07586v1","created_at":"2026-05-18T00:12:47.277068+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07586","created_at":"2026-05-18T00:12:47.277068+00:00"},{"alias_kind":"pith_short_12","alias_value":"IHPBQUIMJUGT","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"IHPBQUIMJUGTXHGJ","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"IHPBQUIM","created_at":"2026-05-18T12:32:31.084164+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/IHPBQUIMJUGTXHGJWVVVTAYALO","json":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO.json","graph_json":"https://pith.science/api/pith-number/IHPBQUIMJUGTXHGJWVVVTAYALO/graph.json","events_json":"https://pith.science/api/pith-number/IHPBQUIMJUGTXHGJWVVVTAYALO/events.json","paper":"https://pith.science/paper/IHPBQUIM"},"agent_actions":{"view_html":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO","download_json":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO.json","view_paper":"https://pith.science/paper/IHPBQUIM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1806.07586&json=true","fetch_graph":"https://pith.science/api/pith-number/IHPBQUIMJUGTXHGJWVVVTAYALO/graph.json","fetch_events":"https://pith.science/api/pith-number/IHPBQUIMJUGTXHGJWVVVTAYALO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/action/storage_attestation","attest_author":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/action/author_attestation","sign_citation":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/action/citation_signature","submit_replication":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/action/replication_record"}},"created_at":"2026-05-18T00:12:47.277068+00:00","updated_at":"2026-05-18T00:12:47.277068+00:00"}