{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UYVAKMDDECZ2OOMALAJLEQWMOF","short_pith_number":"pith:UYVAKMDD","schema_version":"1.0","canonical_sha256":"a62a05306320b3a739805812b242cc717da9354b7ebbfcf3aa47f84c8b51969b","source":{"kind":"arxiv","id":"1705.09475","version":3},"attestation_state":"computed","paper":{"title":"An update on non-Hamiltonian $\\frac{5}{4}$-tough maximal planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela","submitted_at":"2017-05-26T08:28:10Z","abstract_excerpt":"Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of $\\frac{5}{4}$-tough maximal planar graphs presented by Harant and Owens [Discrete Math. 147 (1995), 301--305]. In addition, we present two generalizations of a similar result of Tk\\'{a}\\v{c} who considered $1$-tough maximal planar graphs [Discrete Math. 154 (1996), 321--328]; we remark that one of these generalizations gives a tight upper bound. We fix a problematic argument used in the first paper."},"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":"1705.09475","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-26T08:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"bb9e81503eb7e1166d5150fa09cc79f2d8f971f8e2cccc8f22c84e5b7a80994b","abstract_canon_sha256":"aafe98d8924ed2cefc1afd1d12ea455b36eb10722c4fcb255922cf3b5eb3da86"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:18.532231Z","signature_b64":"NyZLp57aSBV/yfcf0o0LaowOso3lU+IUxbWBFYTL6X3n8kvqmf03XBF8MZ/Yj3plSxDLTvu6Ho0fNIxtjQ72Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a62a05306320b3a739805812b242cc717da9354b7ebbfcf3aa47f84c8b51969b","last_reissued_at":"2026-05-18T00:02:18.531810Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:18.531810Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An update on non-Hamiltonian $\\frac{5}{4}$-tough maximal planar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela","submitted_at":"2017-05-26T08:28:10Z","abstract_excerpt":"Studying the shortness of longest cycles in maximal planar graphs, we improve the upper bound on the shortness exponent of the class of $\\frac{5}{4}$-tough maximal planar graphs presented by Harant and Owens [Discrete Math. 147 (1995), 301--305]. In addition, we present two generalizations of a similar result of Tk\\'{a}\\v{c} who considered $1$-tough maximal planar graphs [Discrete Math. 154 (1996), 321--328]; we remark that one of these generalizations gives a tight upper bound. We fix a problematic argument used in the first paper."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.09475","kind":"arxiv","version":3},"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":"1705.09475","created_at":"2026-05-18T00:02:18.531874+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.09475v3","created_at":"2026-05-18T00:02:18.531874+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.09475","created_at":"2026-05-18T00:02:18.531874+00:00"},{"alias_kind":"pith_short_12","alias_value":"UYVAKMDDECZ2","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UYVAKMDDECZ2OOMA","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UYVAKMDD","created_at":"2026-05-18T12:31:49.984773+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/UYVAKMDDECZ2OOMALAJLEQWMOF","json":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF.json","graph_json":"https://pith.science/api/pith-number/UYVAKMDDECZ2OOMALAJLEQWMOF/graph.json","events_json":"https://pith.science/api/pith-number/UYVAKMDDECZ2OOMALAJLEQWMOF/events.json","paper":"https://pith.science/paper/UYVAKMDD"},"agent_actions":{"view_html":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF","download_json":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF.json","view_paper":"https://pith.science/paper/UYVAKMDD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.09475&json=true","fetch_graph":"https://pith.science/api/pith-number/UYVAKMDDECZ2OOMALAJLEQWMOF/graph.json","fetch_events":"https://pith.science/api/pith-number/UYVAKMDDECZ2OOMALAJLEQWMOF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF/action/storage_attestation","attest_author":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF/action/author_attestation","sign_citation":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF/action/citation_signature","submit_replication":"https://pith.science/pith/UYVAKMDDECZ2OOMALAJLEQWMOF/action/replication_record"}},"created_at":"2026-05-18T00:02:18.531874+00:00","updated_at":"2026-05-18T00:02:18.531874+00:00"}