{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:6TN6QSMV22EM5XFZ5KQXFLJB7O","short_pith_number":"pith:6TN6QSMV","canonical_record":{"source":{"id":"2107.11561","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-24T09:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"153a2420b999ccd44a92edb4404914dba9bae459b8b3d5a5e9add5bef50484e6","abstract_canon_sha256":"1a16788f20c11fc4d92c3272f975368476db8095047054188043790c9d689877"},"schema_version":"1.0"},"canonical_sha256":"f4dbe84995d688cedcb9eaa172ad21fb89eacea7d6528c4b198c49cbe2677365","source":{"kind":"arxiv","id":"2107.11561","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.11561","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"2107.11561v2","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11561","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"6TN6QSMV22EM","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"pith_short_16","alias_value":"6TN6QSMV22EM5XFZ","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"pith_short_8","alias_value":"6TN6QSMV","created_at":"2026-07-05T03:37:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:6TN6QSMV22EM5XFZ5KQXFLJB7O","target":"record","payload":{"canonical_record":{"source":{"id":"2107.11561","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-24T09:05:27Z","cross_cats_sorted":[],"title_canon_sha256":"153a2420b999ccd44a92edb4404914dba9bae459b8b3d5a5e9add5bef50484e6","abstract_canon_sha256":"1a16788f20c11fc4d92c3272f975368476db8095047054188043790c9d689877"},"schema_version":"1.0"},"canonical_sha256":"f4dbe84995d688cedcb9eaa172ad21fb89eacea7d6528c4b198c49cbe2677365","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:37:44.498860Z","signature_b64":"V5nC2gc8Rm+0eYOD3VrZaEbJMtRLnPHvqbZzIq9+M7jyHg/FJpLjYJgb5v0kphvIPb0trqz+2/ugR/OE9+EuDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f4dbe84995d688cedcb9eaa172ad21fb89eacea7d6528c4b198c49cbe2677365","last_reissued_at":"2026-07-05T03:37:44.498493Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:37:44.498493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2107.11561","source_version":2,"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-07-05T03:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3nG2la1RsIkZrp5VSfJyuX0baMsJ9UrDCoXvW4sACJTzgIF7/zSvvH8lYY637Zru7iB2n584lFah4cBZhoZyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:29:11.029330Z"},"content_sha256":"b7f3f04155c014003d5a6d68a5934fa9236d2051ebe53b69d6eeff3af2be3c1a","schema_version":"1.0","event_id":"sha256:b7f3f04155c014003d5a6d68a5934fa9236d2051ebe53b69d6eeff3af2be3c1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:6TN6QSMV22EM5XFZ5KQXFLJB7O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Regular homogeneously traceable nonhamiltonian graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xingzhi Zhan, Yanan Hu","submitted_at":"2021-07-24T09:05:27Z","abstract_excerpt":"A graph is called homogeneously traceable if every vertex is an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for every integer $n\\ge 9,$ there exists a homogeneously traceable nonhamiltonian graph of order $n.$ The graphs they constructed are irregular. Thus it is natural to consider the existence problem of regular homogeneously traceable nonhamiltonian graphs. We prove two results: (1) For every even integer $n\\ge 10,$ there exists a cubic homogeneously traceable nonhamiltonian graph of order $n;$ (2) for every integer $p\\ge 18,$ there exists a $4$-regular hom"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11561","kind":"arxiv","version":2},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2107.11561/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T03:37:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t404Ho+SKW1dUvHL4G7CI11Ypmhc7b+s6/D8p2152IB4MMO6TKfTZwWgORucKvqGW7idcgHolbzxp1eMdOwpBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T01:29:11.029847Z"},"content_sha256":"d1109cc43734e815d507511a3dc05c02bae7649a1175db8ed0fd0ec548ae932d","schema_version":"1.0","event_id":"sha256:d1109cc43734e815d507511a3dc05c02bae7649a1175db8ed0fd0ec548ae932d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6TN6QSMV22EM5XFZ5KQXFLJB7O/bundle.json","state_url":"https://pith.science/pith/6TN6QSMV22EM5XFZ5KQXFLJB7O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6TN6QSMV22EM5XFZ5KQXFLJB7O/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-08-06T01:29:11Z","links":{"resolver":"https://pith.science/pith/6TN6QSMV22EM5XFZ5KQXFLJB7O","bundle":"https://pith.science/pith/6TN6QSMV22EM5XFZ5KQXFLJB7O/bundle.json","state":"https://pith.science/pith/6TN6QSMV22EM5XFZ5KQXFLJB7O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6TN6QSMV22EM5XFZ5KQXFLJB7O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:6TN6QSMV22EM5XFZ5KQXFLJB7O","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":"1a16788f20c11fc4d92c3272f975368476db8095047054188043790c9d689877","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-24T09:05:27Z","title_canon_sha256":"153a2420b999ccd44a92edb4404914dba9bae459b8b3d5a5e9add5bef50484e6"},"schema_version":"1.0","source":{"id":"2107.11561","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2107.11561","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"arxiv_version","alias_value":"2107.11561v2","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2107.11561","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"pith_short_12","alias_value":"6TN6QSMV22EM","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"pith_short_16","alias_value":"6TN6QSMV22EM5XFZ","created_at":"2026-07-05T03:37:44Z"},{"alias_kind":"pith_short_8","alias_value":"6TN6QSMV","created_at":"2026-07-05T03:37:44Z"}],"graph_snapshots":[{"event_id":"sha256:d1109cc43734e815d507511a3dc05c02bae7649a1175db8ed0fd0ec548ae932d","target":"graph","created_at":"2026-07-05T03:37:44Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2107.11561/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A graph is called homogeneously traceable if every vertex is an endpoint of a Hamilton path. In 1979 Chartrand, Gould and Kapoor proved that for every integer $n\\ge 9,$ there exists a homogeneously traceable nonhamiltonian graph of order $n.$ The graphs they constructed are irregular. Thus it is natural to consider the existence problem of regular homogeneously traceable nonhamiltonian graphs. We prove two results: (1) For every even integer $n\\ge 10,$ there exists a cubic homogeneously traceable nonhamiltonian graph of order $n;$ (2) for every integer $p\\ge 18,$ there exists a $4$-regular hom","authors_text":"Xingzhi Zhan, Yanan Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-24T09:05:27Z","title":"Regular homogeneously traceable nonhamiltonian graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2107.11561","kind":"arxiv","version":2},"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:b7f3f04155c014003d5a6d68a5934fa9236d2051ebe53b69d6eeff3af2be3c1a","target":"record","created_at":"2026-07-05T03:37:44Z","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":"1a16788f20c11fc4d92c3272f975368476db8095047054188043790c9d689877","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-07-24T09:05:27Z","title_canon_sha256":"153a2420b999ccd44a92edb4404914dba9bae459b8b3d5a5e9add5bef50484e6"},"schema_version":"1.0","source":{"id":"2107.11561","kind":"arxiv","version":2}},"canonical_sha256":"f4dbe84995d688cedcb9eaa172ad21fb89eacea7d6528c4b198c49cbe2677365","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f4dbe84995d688cedcb9eaa172ad21fb89eacea7d6528c4b198c49cbe2677365","first_computed_at":"2026-07-05T03:37:44.498493Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:37:44.498493Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V5nC2gc8Rm+0eYOD3VrZaEbJMtRLnPHvqbZzIq9+M7jyHg/FJpLjYJgb5v0kphvIPb0trqz+2/ugR/OE9+EuDw==","signature_status":"signed_v1","signed_at":"2026-07-05T03:37:44.498860Z","signed_message":"canonical_sha256_bytes"},"source_id":"2107.11561","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7f3f04155c014003d5a6d68a5934fa9236d2051ebe53b69d6eeff3af2be3c1a","sha256:d1109cc43734e815d507511a3dc05c02bae7649a1175db8ed0fd0ec548ae932d"],"state_sha256":"e6e140626e173821039106992e75c8ed5d10ba57fe65dc788dadc78f9178387b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7ZTeb2P0rtRJSsh9jS6BfdvCrwJg/8QWxkHp6C0OX9HA1ukZQvfurhox0kSzNUNO4m1JOJtvvdITyyJd8YXECQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T01:29:11.036410Z","bundle_sha256":"1e0b9b4189007ed0720804133e5cb3606ea7053b6332ef9f81ce7cc305d30c23"}}