{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:UZM6ZD7D6PXQLP3CLGIXDTOT52","short_pith_number":"pith:UZM6ZD7D","schema_version":"1.0","canonical_sha256":"a659ec8fe3f3ef05bf62599171cdd3eea8d973459af6648b74feee183766c52e","source":{"kind":"arxiv","id":"1712.05158","version":1},"attestation_state":"computed","paper":{"title":"Structural and computational results on platypus graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Addie Neyt, Carol T. Zamfirescu, Jan Goedgebeur","submitted_at":"2017-12-14T10:37:42Z","abstract_excerpt":"A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance hypohamiltonian, leaf-stable, and maximally non-hamiltonian graphs.\n  In this paper, we first investigate cubic platypus graphs, covering all orders for which such graphs exist: in the general and polyhedral case as well as for snarks. We then present (not necessarily cubic) platypus graphs of girth up to 16---whereas no hypohamiltonian graphs of girth greater t"},"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":"1712.05158","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-14T10:37:42Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"280550943cba6dd92497aab4a37a813f4392dd1a45e600ce7bc4915d79007da6","abstract_canon_sha256":"f6b6c2907cac3e66c309ddcad98b20f87b31b21e73900993cd38a3727c0df23d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:58.701085Z","signature_b64":"EyYpSrTDgVvESXaGWFoqtiWkbnBU6k7F8SuGAjrvna8ZLBan7bA34tiJ0FXZ+57+eBm6nHPJkhHZ2uQwgz9wAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a659ec8fe3f3ef05bf62599171cdd3eea8d973459af6648b74feee183766c52e","last_reissued_at":"2026-05-18T00:27:58.700533Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:58.700533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Structural and computational results on platypus graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Addie Neyt, Carol T. Zamfirescu, Jan Goedgebeur","submitted_at":"2017-12-14T10:37:42Z","abstract_excerpt":"A platypus graph is a non-hamiltonian graph for which every vertex-deleted subgraph is traceable. They are closely related to families of graphs satisfying interesting conditions regarding longest paths and longest cycles, for instance hypohamiltonian, leaf-stable, and maximally non-hamiltonian graphs.\n  In this paper, we first investigate cubic platypus graphs, covering all orders for which such graphs exist: in the general and polyhedral case as well as for snarks. We then present (not necessarily cubic) platypus graphs of girth up to 16---whereas no hypohamiltonian graphs of girth greater t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05158","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":"1712.05158","created_at":"2026-05-18T00:27:58.700600+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.05158v1","created_at":"2026-05-18T00:27:58.700600+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05158","created_at":"2026-05-18T00:27:58.700600+00:00"},{"alias_kind":"pith_short_12","alias_value":"UZM6ZD7D6PXQ","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_16","alias_value":"UZM6ZD7D6PXQLP3C","created_at":"2026-05-18T12:31:49.984773+00:00"},{"alias_kind":"pith_short_8","alias_value":"UZM6ZD7D","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/UZM6ZD7D6PXQLP3CLGIXDTOT52","json":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52.json","graph_json":"https://pith.science/api/pith-number/UZM6ZD7D6PXQLP3CLGIXDTOT52/graph.json","events_json":"https://pith.science/api/pith-number/UZM6ZD7D6PXQLP3CLGIXDTOT52/events.json","paper":"https://pith.science/paper/UZM6ZD7D"},"agent_actions":{"view_html":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52","download_json":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52.json","view_paper":"https://pith.science/paper/UZM6ZD7D","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.05158&json=true","fetch_graph":"https://pith.science/api/pith-number/UZM6ZD7D6PXQLP3CLGIXDTOT52/graph.json","fetch_events":"https://pith.science/api/pith-number/UZM6ZD7D6PXQLP3CLGIXDTOT52/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/action/storage_attestation","attest_author":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/action/author_attestation","sign_citation":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/action/citation_signature","submit_replication":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/action/replication_record"}},"created_at":"2026-05-18T00:27:58.700600+00:00","updated_at":"2026-05-18T00:27:58.700600+00:00"}