{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:2T6XNBJR5KL2VIZJLKPE65546O","short_pith_number":"pith:2T6XNBJR","schema_version":"1.0","canonical_sha256":"d4fd768531ea97aaa3295a9e4f77bcf3bcb795060f55f06fc2852e0f9d05eb24","source":{"kind":"arxiv","id":"1508.06982","version":1},"attestation_state":"computed","paper":{"title":"One-way infinite 2-walks in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel P. Biebighauser, M. N. Ellingham","submitted_at":"2015-08-27T19:45:52Z","abstract_excerpt":"We prove that every 3-connected 2-indivisible infinite planar graph has a 1-way infinite 2-walk. (A graph is 2-indivisible if deleting finitely many vertices leaves at most one infinite component, and a 2-walk is a spanning walk using every vertex at most twice.) This improves a result of Timar, which assumed local finiteness. Our proofs use Tutte subgraphs, and allow us to also provide other results when the graph is bipartite or an infinite analog of a triangulation: then the prism over the graph has a spanning 1-way infinite path."},"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":"1508.06982","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-27T19:45:52Z","cross_cats_sorted":[],"title_canon_sha256":"bc1e1794fedb4e85cf069cc3fb447e91be8cfeab2e163da4f2b825dbdacb267b","abstract_canon_sha256":"7831df188bbc1c0f357c65c03956a3266ac173faafd62b36736f351c9bf4ef00"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:34:40.380583Z","signature_b64":"RUReHe+2zvhTRxYlP3LnC6//KA2TVkue86i/IPxvwuKtGgD/WUeyBHy+O2NU9OPnZhubOHT27DZX4JBGfAYwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4fd768531ea97aaa3295a9e4f77bcf3bcb795060f55f06fc2852e0f9d05eb24","last_reissued_at":"2026-05-18T01:34:40.379844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:34:40.379844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"One-way infinite 2-walks in planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Daniel P. Biebighauser, M. N. Ellingham","submitted_at":"2015-08-27T19:45:52Z","abstract_excerpt":"We prove that every 3-connected 2-indivisible infinite planar graph has a 1-way infinite 2-walk. (A graph is 2-indivisible if deleting finitely many vertices leaves at most one infinite component, and a 2-walk is a spanning walk using every vertex at most twice.) This improves a result of Timar, which assumed local finiteness. Our proofs use Tutte subgraphs, and allow us to also provide other results when the graph is bipartite or an infinite analog of a triangulation: then the prism over the graph has a spanning 1-way infinite path."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.06982","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":"1508.06982","created_at":"2026-05-18T01:34:40.379956+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.06982v1","created_at":"2026-05-18T01:34:40.379956+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.06982","created_at":"2026-05-18T01:34:40.379956+00:00"},{"alias_kind":"pith_short_12","alias_value":"2T6XNBJR5KL2","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_16","alias_value":"2T6XNBJR5KL2VIZJ","created_at":"2026-05-18T12:29:02.477457+00:00"},{"alias_kind":"pith_short_8","alias_value":"2T6XNBJR","created_at":"2026-05-18T12:29:02.477457+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/2T6XNBJR5KL2VIZJLKPE65546O","json":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O.json","graph_json":"https://pith.science/api/pith-number/2T6XNBJR5KL2VIZJLKPE65546O/graph.json","events_json":"https://pith.science/api/pith-number/2T6XNBJR5KL2VIZJLKPE65546O/events.json","paper":"https://pith.science/paper/2T6XNBJR"},"agent_actions":{"view_html":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O","download_json":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O.json","view_paper":"https://pith.science/paper/2T6XNBJR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.06982&json=true","fetch_graph":"https://pith.science/api/pith-number/2T6XNBJR5KL2VIZJLKPE65546O/graph.json","fetch_events":"https://pith.science/api/pith-number/2T6XNBJR5KL2VIZJLKPE65546O/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O/action/storage_attestation","attest_author":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O/action/author_attestation","sign_citation":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O/action/citation_signature","submit_replication":"https://pith.science/pith/2T6XNBJR5KL2VIZJLKPE65546O/action/replication_record"}},"created_at":"2026-05-18T01:34:40.379956+00:00","updated_at":"2026-05-18T01:34:40.379956+00:00"}