{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:YIUQB5FRKJAINGVEORCOG6CQ5P","short_pith_number":"pith:YIUQB5FR","canonical_record":{"source":{"id":"1812.04543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T17:01:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"371a9de39079d015ed0280e390f364c29f4f4a4a925c7be6cce1166d304629ed","abstract_canon_sha256":"8dd673fa14216b2bb968d7b9f5f161062e4cdf7d2270b14f36a1b1b2e35cbd12"},"schema_version":"1.0"},"canonical_sha256":"c22900f4b15240869aa47444e37850ebfac7909fc8814fb5312640f2bc8b4b98","source":{"kind":"arxiv","id":"1812.04543","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04543","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04543v2","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04543","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"pith_short_12","alias_value":"YIUQB5FRKJAI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIUQB5FRKJAINGVE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIUQB5FR","created_at":"2026-05-18T12:33:04Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:YIUQB5FRKJAINGVEORCOG6CQ5P","target":"record","payload":{"canonical_record":{"source":{"id":"1812.04543","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T17:01:32Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"371a9de39079d015ed0280e390f364c29f4f4a4a925c7be6cce1166d304629ed","abstract_canon_sha256":"8dd673fa14216b2bb968d7b9f5f161062e4cdf7d2270b14f36a1b1b2e35cbd12"},"schema_version":"1.0"},"canonical_sha256":"c22900f4b15240869aa47444e37850ebfac7909fc8814fb5312640f2bc8b4b98","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:51:30.580465Z","signature_b64":"tM54gMMQ21TuBcQCaY8QWC4YBF+SznDIhP2L2mMLyyBEDzhDGWweDZZG2IYEK4VxFCU7+gRj/wCAQu6+PX3LCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c22900f4b15240869aa47444e37850ebfac7909fc8814fb5312640f2bc8b4b98","last_reissued_at":"2026-05-17T23:51:30.580047Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:51:30.580047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1812.04543","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-17T23:51:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gJ2uce6W4Cm/sLP3BHCgVUwfrmp3gEnAoXfd7l8Enq+uu9G6gHmZ/9r5hRAu1YbqlAILFf7MJFbE2ezF1quODA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:31:14.419057Z"},"content_sha256":"f190317fdf8e20c4827f86742709126d14dff61c73b5f4ffb1597db3f35cb008","schema_version":"1.0","event_id":"sha256:f190317fdf8e20c4827f86742709126d14dff61c73b5f4ffb1597db3f35cb008"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:YIUQB5FRKJAINGVEORCOG6CQ5P","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Tutte paths in linear time","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Philipp Kindermann, Therese Biedl","submitted_at":"2018-12-11T17:01:32Z","abstract_excerpt":"It is well-known that every planar graph has a Tutte path, i.e., a path $P$ such that any component of $G-P$ has at most three attachment points on $P$. However, it was only recently shown that such Tutte paths can be found in polynomial time. In this paper, we give a new proof that 3-connected planar graphs have Tutte paths, which leads to a linear-time algorithm to find Tutte paths. Furthermore, our Tutte path has special properties: it visits all exterior vertices, all components of $G-P$ have exactly three attachment points, and we can assign distinct representatives to them that are inter"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04543","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-17T23:51:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KyUqj58d9rd+cPj9veqC4wSKWuuDPx9ZYbWBAfXA3ZBADwxe+1mad/zJq9D/2Jko2ell2OE5t1oMHai6qga5AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T01:31:14.419425Z"},"content_sha256":"73d919eb8139768241cf47022e858ec0eae6780feee7dfcc941e27f2900f6ffb","schema_version":"1.0","event_id":"sha256:73d919eb8139768241cf47022e858ec0eae6780feee7dfcc941e27f2900f6ffb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YIUQB5FRKJAINGVEORCOG6CQ5P/bundle.json","state_url":"https://pith.science/pith/YIUQB5FRKJAINGVEORCOG6CQ5P/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YIUQB5FRKJAINGVEORCOG6CQ5P/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-31T01:31:14Z","links":{"resolver":"https://pith.science/pith/YIUQB5FRKJAINGVEORCOG6CQ5P","bundle":"https://pith.science/pith/YIUQB5FRKJAINGVEORCOG6CQ5P/bundle.json","state":"https://pith.science/pith/YIUQB5FRKJAINGVEORCOG6CQ5P/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YIUQB5FRKJAINGVEORCOG6CQ5P/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:YIUQB5FRKJAINGVEORCOG6CQ5P","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":"8dd673fa14216b2bb968d7b9f5f161062e4cdf7d2270b14f36a1b1b2e35cbd12","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T17:01:32Z","title_canon_sha256":"371a9de39079d015ed0280e390f364c29f4f4a4a925c7be6cce1166d304629ed"},"schema_version":"1.0","source":{"id":"1812.04543","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.04543","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"arxiv_version","alias_value":"1812.04543v2","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.04543","created_at":"2026-05-17T23:51:30Z"},{"alias_kind":"pith_short_12","alias_value":"YIUQB5FRKJAI","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_16","alias_value":"YIUQB5FRKJAINGVE","created_at":"2026-05-18T12:33:04Z"},{"alias_kind":"pith_short_8","alias_value":"YIUQB5FR","created_at":"2026-05-18T12:33:04Z"}],"graph_snapshots":[{"event_id":"sha256:73d919eb8139768241cf47022e858ec0eae6780feee7dfcc941e27f2900f6ffb","target":"graph","created_at":"2026-05-17T23:51:30Z","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":"It is well-known that every planar graph has a Tutte path, i.e., a path $P$ such that any component of $G-P$ has at most three attachment points on $P$. However, it was only recently shown that such Tutte paths can be found in polynomial time. In this paper, we give a new proof that 3-connected planar graphs have Tutte paths, which leads to a linear-time algorithm to find Tutte paths. Furthermore, our Tutte path has special properties: it visits all exterior vertices, all components of $G-P$ have exactly three attachment points, and we can assign distinct representatives to them that are inter","authors_text":"Philipp Kindermann, Therese Biedl","cross_cats":["cs.DM","math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T17:01:32Z","title":"Finding Tutte paths in linear time"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.04543","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:f190317fdf8e20c4827f86742709126d14dff61c73b5f4ffb1597db3f35cb008","target":"record","created_at":"2026-05-17T23:51:30Z","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":"8dd673fa14216b2bb968d7b9f5f161062e4cdf7d2270b14f36a1b1b2e35cbd12","cross_cats_sorted":["cs.DM","math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-12-11T17:01:32Z","title_canon_sha256":"371a9de39079d015ed0280e390f364c29f4f4a4a925c7be6cce1166d304629ed"},"schema_version":"1.0","source":{"id":"1812.04543","kind":"arxiv","version":2}},"canonical_sha256":"c22900f4b15240869aa47444e37850ebfac7909fc8814fb5312640f2bc8b4b98","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c22900f4b15240869aa47444e37850ebfac7909fc8814fb5312640f2bc8b4b98","first_computed_at":"2026-05-17T23:51:30.580047Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:51:30.580047Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tM54gMMQ21TuBcQCaY8QWC4YBF+SznDIhP2L2mMLyyBEDzhDGWweDZZG2IYEK4VxFCU7+gRj/wCAQu6+PX3LCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:51:30.580465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.04543","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f190317fdf8e20c4827f86742709126d14dff61c73b5f4ffb1597db3f35cb008","sha256:73d919eb8139768241cf47022e858ec0eae6780feee7dfcc941e27f2900f6ffb"],"state_sha256":"6e51122a0a2a8606fd5e3bbab8c1c18211c3d35e0ee26c062e48a58d710d1c72"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5D3GXhMnPAccb7T5DjuBX52UcuYjlDsNz9DRqa3TvV4GlPd9BcYxpylAozMLG8zZCFSpbboLv3UI+vPlqYItDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T01:31:14.421456Z","bundle_sha256":"e032b19e09a157ac5a6d6c434964f051d4debead31819b5d100b8bdbcc708227"}}