{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:IHPBQUIMJUGTXHGJWVVVTAYALO","short_pith_number":"pith:IHPBQUIM","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"},"canonical_sha256":"41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00","source":{"kind":"arxiv","id":"1806.07586","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07586","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07586v1","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07586","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"IHPBQUIMJUGT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IHPBQUIMJUGTXHGJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IHPBQUIM","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:IHPBQUIMJUGTXHGJWVVVTAYALO","target":"record","payload":{"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"},"canonical_sha256":"41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00","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"},"source_kind":"arxiv","source_id":"1806.07586","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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tuyxyO4XqyNUvcr4C28L6Nz9A+omovHoHKy2uPYtsnBy/q3IttyPvMePshr+zJrueQTi88imJoAnsdKDndUNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:26.139443Z"},"content_sha256":"b3ce5a079814bb9a8ddf8e1ba6d610de1e64bfa07ddfff802527beac461f99c3","schema_version":"1.0","event_id":"sha256:b3ce5a079814bb9a8ddf8e1ba6d610de1e64bfa07ddfff802527beac461f99c3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:IHPBQUIMJUGTXHGJWVVVTAYALO","target":"graph","payload":{"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"},"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:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x7gc8a02Cd5cyodfxKT1cqsOLlkxBiRv/yT3R1hXAuP5xmx1o9xIEFyQS9s5jShPAsWrF1DzRNOsb85J10aECw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:05:26.140198Z"},"content_sha256":"316965b5e4b3661bbeb849a69a7e96aec2d7f30ae7f0d2d9dfb8a749b4d0d92f","schema_version":"1.0","event_id":"sha256:316965b5e4b3661bbeb849a69a7e96aec2d7f30ae7f0d2d9dfb8a749b4d0d92f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/bundle.json","state_url":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/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-25T15:05:26Z","links":{"resolver":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO","bundle":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/bundle.json","state":"https://pith.science/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IHPBQUIMJUGTXHGJWVVVTAYALO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:IHPBQUIMJUGTXHGJWVVVTAYALO","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":"94154fbd39d208922f59b5aa19b5694625d642cda0e42e84d0d4e67747293cf0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-20T07:26:37Z","title_canon_sha256":"bae3b9dbe1fde5b558f8959ab53842653963487a1fde1d06da0f0da98ab8c0b4"},"schema_version":"1.0","source":{"id":"1806.07586","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.07586","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"arxiv_version","alias_value":"1806.07586v1","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.07586","created_at":"2026-05-18T00:12:47Z"},{"alias_kind":"pith_short_12","alias_value":"IHPBQUIMJUGT","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"IHPBQUIMJUGTXHGJ","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"IHPBQUIM","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:316965b5e4b3661bbeb849a69a7e96aec2d7f30ae7f0d2d9dfb8a749b4d0d92f","target":"graph","created_at":"2026-05-18T00:12:47Z","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":"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","authors_text":"Andreas Bj\\\"orklund, Thore Husfeldt","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-20T07:26:37Z","title":"Counting Shortest Two Disjoint Paths in Cubic Planar Graphs with an NC Algorithm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.07586","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:b3ce5a079814bb9a8ddf8e1ba6d610de1e64bfa07ddfff802527beac461f99c3","target":"record","created_at":"2026-05-18T00:12:47Z","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":"94154fbd39d208922f59b5aa19b5694625d642cda0e42e84d0d4e67747293cf0","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-06-20T07:26:37Z","title_canon_sha256":"bae3b9dbe1fde5b558f8959ab53842653963487a1fde1d06da0f0da98ab8c0b4"},"schema_version":"1.0","source":{"id":"1806.07586","kind":"arxiv","version":1}},"canonical_sha256":"41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"41de18510c4d0d3b9cc9b56b5983005b9859323f9c108e6b8dd8aa497b2ece00","first_computed_at":"2026-05-18T00:12:47.276989Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:12:47.276989Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xAWO6Rdy9nYFMfO6qymXjqDj3Y3Vzd77UZhgiwnLHn56xKb9UneG+2ewe6rsM1TEW+5wl47hEG5FfzLyDHUHDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:12:47.277552Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.07586","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b3ce5a079814bb9a8ddf8e1ba6d610de1e64bfa07ddfff802527beac461f99c3","sha256:316965b5e4b3661bbeb849a69a7e96aec2d7f30ae7f0d2d9dfb8a749b4d0d92f"],"state_sha256":"a832948471c1177def93d987e187faa396c76aa59ea53fc96187b8361a67d848"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vKTKywRSDQ61O0YmekslP1/YPHpSFklx8Gz0rQ+OXd1UrS9knSC3ljNphvO3kPGWltNGoWqtyduR5c7H8kz6CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:05:26.144035Z","bundle_sha256":"3753c23097bc90da2f6d3571786b646b4f74c4a75077fc9280b771fad489bf8e"}}