{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:UZM6ZD7D6PXQLP3CLGIXDTOT52","short_pith_number":"pith:UZM6ZD7D","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"},"canonical_sha256":"a659ec8fe3f3ef05bf62599171cdd3eea8d973459af6648b74feee183766c52e","source":{"kind":"arxiv","id":"1712.05158","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05158","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05158v1","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05158","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"UZM6ZD7D6PXQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UZM6ZD7D6PXQLP3C","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UZM6ZD7D","created_at":"2026-05-18T12:31:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:UZM6ZD7D6PXQLP3CLGIXDTOT52","target":"record","payload":{"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"},"canonical_sha256":"a659ec8fe3f3ef05bf62599171cdd3eea8d973459af6648b74feee183766c52e","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"},"source_kind":"arxiv","source_id":"1712.05158","source_version":1,"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-18T00:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"a8pdY42ybG0qRROF8svs5T3hEMxiBrQfC9jmABo3Gk2wd2MFKrebc0XuiOimWomKravHcwHcrLog2jzMZ0++Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:10:25.171577Z"},"content_sha256":"931c89c0d83597ae8c7814f540bb6a31acf3230ba6c6aa37a991e79bb5e056b1","schema_version":"1.0","event_id":"sha256:931c89c0d83597ae8c7814f540bb6a31acf3230ba6c6aa37a991e79bb5e056b1"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:UZM6ZD7D6PXQLP3CLGIXDTOT52","target":"graph","payload":{"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"},"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-18T00:27:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Zy+ipsoLaXXf4EzXDeJ7XcPPUpK9jYn0bQBrC8hS4lDP3Y7mU5oyKPtrD+UQN990mqICZwMcsxZTzqz09MDQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T00:10:25.172298Z"},"content_sha256":"08bb3b85a18736ee5f322437fe1305dc1546e6cf8d654bfe241241914723acf1","schema_version":"1.0","event_id":"sha256:08bb3b85a18736ee5f322437fe1305dc1546e6cf8d654bfe241241914723acf1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/bundle.json","state_url":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/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-31T00:10:25Z","links":{"resolver":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52","bundle":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/bundle.json","state":"https://pith.science/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UZM6ZD7D6PXQLP3CLGIXDTOT52/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:UZM6ZD7D6PXQLP3CLGIXDTOT52","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":"f6b6c2907cac3e66c309ddcad98b20f87b31b21e73900993cd38a3727c0df23d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-14T10:37:42Z","title_canon_sha256":"280550943cba6dd92497aab4a37a813f4392dd1a45e600ce7bc4915d79007da6"},"schema_version":"1.0","source":{"id":"1712.05158","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1712.05158","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"arxiv_version","alias_value":"1712.05158v1","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.05158","created_at":"2026-05-18T00:27:58Z"},{"alias_kind":"pith_short_12","alias_value":"UZM6ZD7D6PXQ","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_16","alias_value":"UZM6ZD7D6PXQLP3C","created_at":"2026-05-18T12:31:49Z"},{"alias_kind":"pith_short_8","alias_value":"UZM6ZD7D","created_at":"2026-05-18T12:31:49Z"}],"graph_snapshots":[{"event_id":"sha256:08bb3b85a18736ee5f322437fe1305dc1546e6cf8d654bfe241241914723acf1","target":"graph","created_at":"2026-05-18T00:27:58Z","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":"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","authors_text":"Addie Neyt, Carol T. Zamfirescu, Jan Goedgebeur","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-14T10:37:42Z","title":"Structural and computational results on platypus graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.05158","kind":"arxiv","version":1},"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:931c89c0d83597ae8c7814f540bb6a31acf3230ba6c6aa37a991e79bb5e056b1","target":"record","created_at":"2026-05-18T00:27:58Z","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":"f6b6c2907cac3e66c309ddcad98b20f87b31b21e73900993cd38a3727c0df23d","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-12-14T10:37:42Z","title_canon_sha256":"280550943cba6dd92497aab4a37a813f4392dd1a45e600ce7bc4915d79007da6"},"schema_version":"1.0","source":{"id":"1712.05158","kind":"arxiv","version":1}},"canonical_sha256":"a659ec8fe3f3ef05bf62599171cdd3eea8d973459af6648b74feee183766c52e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a659ec8fe3f3ef05bf62599171cdd3eea8d973459af6648b74feee183766c52e","first_computed_at":"2026-05-18T00:27:58.700533Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:27:58.700533Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EyYpSrTDgVvESXaGWFoqtiWkbnBU6k7F8SuGAjrvna8ZLBan7bA34tiJ0FXZ+57+eBm6nHPJkhHZ2uQwgz9wAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:27:58.701085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1712.05158","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:931c89c0d83597ae8c7814f540bb6a31acf3230ba6c6aa37a991e79bb5e056b1","sha256:08bb3b85a18736ee5f322437fe1305dc1546e6cf8d654bfe241241914723acf1"],"state_sha256":"4662d107856e6fc24eaad082c881fba2f8338aa3f3b24f0fa80c30aa098d988e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ITU07oNHXbec/7phGE5Z7AJOIJUgDlD4z70fN5TTBTJu52FiIID90JtWIsdyI/uZhwrPcCg+suSSVF5YTvYtAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T00:10:25.176432Z","bundle_sha256":"3b537537cacab1677632e75590524fd1269d0cfa6c9a8a747bb5a7385250d974"}}