{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:1996:O6WBB7MEPSLU3JVNJ3XCSWV4L3","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":"c490a319f6008dff240fefac8d7203a8e7f7b6c6d0902f583d100129ea24b766","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","title_canon_sha256":"0ab5bd0f6e58e4baac85f768618e00ff86cd4132be7f9adcced00056f89a4be6"},"schema_version":"1.0","source":{"id":"math/9612212","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"math/9612212","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"arxiv_version","alias_value":"math/9612212v1","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9612212","created_at":"2026-05-18T01:05:37Z"},{"alias_kind":"pith_short_12","alias_value":"O6WBB7MEPSLU","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_16","alias_value":"O6WBB7MEPSLU3JVN","created_at":"2026-05-18T12:25:48Z"},{"alias_kind":"pith_short_8","alias_value":"O6WBB7ME","created_at":"2026-05-18T12:25:48Z"}],"graph_snapshots":[{"event_id":"sha256:25894429cbd99528264a0f82179cb5960577d0045b5d91ca1c4853a9f0a933a2","target":"graph","created_at":"2026-05-18T01:05:37Z","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 Hamiltonian graph $G$ of order $n$ is $k$-ordered, $2\\leq k \\leq n$, if for every sequence $v_1, v_2, \\ldots ,v_k$ of $k$ distinct vertices of $G$, there exists a Hamiltonian cycle that encounters $v_1, v_2, \\ldots , v_k$ in this order. In this paper, answering a question of Ng and Schultz, we give a sharp bound for the minimum degree guaranteeing that a graph is a $k$-ordered Hamiltonian graph under some mild restrictions. More precisely, we show that there are $\\varepsilon, n_0> 0$ such that if $G$ is a graph of order $n\\geq n_0$ with minimum degree at least $\\lceil \\frac{n}{2} \\rceil + \\l","authors_text":"Gabor N. Sarkozy, Stanley Selkow","cross_cats":[],"headline":"","license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","title":"On $k$-ordered Hamiltonian Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9612212","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:b91118125fd22a526b1c2873c6d73e13f30893a4971859ac416d4830a1954db6","target":"record","created_at":"2026-05-18T01:05:37Z","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":"c490a319f6008dff240fefac8d7203a8e7f7b6c6d0902f583d100129ea24b766","cross_cats_sorted":[],"license":"","primary_cat":"math.CO","submitted_at":"1996-12-04T00:00:00Z","title_canon_sha256":"0ab5bd0f6e58e4baac85f768618e00ff86cd4132be7f9adcced00056f89a4be6"},"schema_version":"1.0","source":{"id":"math/9612212","kind":"arxiv","version":1}},"canonical_sha256":"77ac10fd847c974da6ad4eee295abc5eedcf7237e50acc7081154432fe40b195","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"77ac10fd847c974da6ad4eee295abc5eedcf7237e50acc7081154432fe40b195","first_computed_at":"2026-05-18T01:05:37.383074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:05:37.383074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1CzbtbHSyhpi6XfYhnNxzcu3mVu/pofBbZD1EE/Q3KB5DvwRIZt4MrGu3jBOYwIPAmRboR8AIp7gzX9JsFYPDQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:05:37.383643Z","signed_message":"canonical_sha256_bytes"},"source_id":"math/9612212","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b91118125fd22a526b1c2873c6d73e13f30893a4971859ac416d4830a1954db6","sha256:25894429cbd99528264a0f82179cb5960577d0045b5d91ca1c4853a9f0a933a2"],"state_sha256":"086b1da78f499cc84d8251043739aafa9a2c8a1c0c6c8c8161564e86c08140b1"}