{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:WW7JNLXVIOSXG6UXYIEHUOMOTS","short_pith_number":"pith:WW7JNLXV","schema_version":"1.0","canonical_sha256":"b5be96aef543a5737a97c2087a398e9ca2475a02c06fffa88d8401aa19b4869c","source":{"kind":"arxiv","id":"1707.05994","version":1},"attestation_state":"computed","paper":{"title":"Computing Tutte Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andreas Schmid, Jens M. Schmidt","submitted_at":"2017-07-19T09:43:06Z","abstract_excerpt":"Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps hinder to bound the running time to a polynomial. For special cases however, computational results of Tutte paths are known: For 4-connected planar graphs, Tutte paths are in fact Hamiltonian paths and Chiba and Nishizeki showed how to compute such paths in linear time. For 3-connected planar graphs, Tutte paths have a more complicated structure, "},"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":"1707.05994","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-07-19T09:43:06Z","cross_cats_sorted":["cs.DM","math.CO"],"title_canon_sha256":"14e00148c4b6c325c47365b53916000606bd2d9ac82e06de5d50958a84e7e081","abstract_canon_sha256":"080ac589af8c627d203228246943b47015b867ffe1b54f7d727efaf39a3703d6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:39:54.420761Z","signature_b64":"syr6p32M0UrsrH0Hg8jkwJkgh6gOmdGzEJesVqopGWjKzOq3yCpexigl0MwFJEICMo18rvTQZQthci48fcfmDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b5be96aef543a5737a97c2087a398e9ca2475a02c06fffa88d8401aa19b4869c","last_reissued_at":"2026-05-18T00:39:54.420078Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:39:54.420078Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Computing Tutte Paths","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO"],"primary_cat":"cs.DS","authors_text":"Andreas Schmid, Jens M. Schmidt","submitted_at":"2017-07-19T09:43:06Z","abstract_excerpt":"Tutte paths are one of the most successful tools for attacking Hamiltonicity problems in planar graphs. Unfortunately, results based on them are non-constructive, as their proofs inherently use an induction on overlapping subgraphs and these overlaps hinder to bound the running time to a polynomial. For special cases however, computational results of Tutte paths are known: For 4-connected planar graphs, Tutte paths are in fact Hamiltonian paths and Chiba and Nishizeki showed how to compute such paths in linear time. For 3-connected planar graphs, Tutte paths have a more complicated structure, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1707.05994","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":"1707.05994","created_at":"2026-05-18T00:39:54.420185+00:00"},{"alias_kind":"arxiv_version","alias_value":"1707.05994v1","created_at":"2026-05-18T00:39:54.420185+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1707.05994","created_at":"2026-05-18T00:39:54.420185+00:00"},{"alias_kind":"pith_short_12","alias_value":"WW7JNLXVIOSX","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_16","alias_value":"WW7JNLXVIOSXG6UX","created_at":"2026-05-18T12:31:53.515858+00:00"},{"alias_kind":"pith_short_8","alias_value":"WW7JNLXV","created_at":"2026-05-18T12:31:53.515858+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/WW7JNLXVIOSXG6UXYIEHUOMOTS","json":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS.json","graph_json":"https://pith.science/api/pith-number/WW7JNLXVIOSXG6UXYIEHUOMOTS/graph.json","events_json":"https://pith.science/api/pith-number/WW7JNLXVIOSXG6UXYIEHUOMOTS/events.json","paper":"https://pith.science/paper/WW7JNLXV"},"agent_actions":{"view_html":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS","download_json":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS.json","view_paper":"https://pith.science/paper/WW7JNLXV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1707.05994&json=true","fetch_graph":"https://pith.science/api/pith-number/WW7JNLXVIOSXG6UXYIEHUOMOTS/graph.json","fetch_events":"https://pith.science/api/pith-number/WW7JNLXVIOSXG6UXYIEHUOMOTS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS/action/storage_attestation","attest_author":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS/action/author_attestation","sign_citation":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS/action/citation_signature","submit_replication":"https://pith.science/pith/WW7JNLXVIOSXG6UXYIEHUOMOTS/action/replication_record"}},"created_at":"2026-05-18T00:39:54.420185+00:00","updated_at":"2026-05-18T00:39:54.420185+00:00"}