{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HAHSAQAMEQJ6ADIV3MN3YZIZFA","short_pith_number":"pith:HAHSAQAM","schema_version":"1.0","canonical_sha256":"380f20400c2413e00d15db1bbc65192813190b22081d1e2401a4bfea8eb8890c","source":{"kind":"arxiv","id":"2605.26479","version":1},"attestation_state":"computed","paper":{"title":"The maximum number of paths of a given length in a nonhamiltonian graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Xingzhi Zhan","submitted_at":"2026-05-26T02:39:12Z","abstract_excerpt":"In 1980, Paul Erd\\H{o}s posed the following problem: For every positive integer $n,$ determine a nonhamiltonian graph of order $n$ having the maximum number of Hamilton paths. We solve the more general problem of determining the nonhamiltonian graphs of order $n$ having the maximum number of paths of length $k$ for given integers $n$ and $k$ with $1\\le k\\le n-1.$ The case $k=n-1$ gives a solution to Erd\\H{o}s's problem and the case $k=1$ corresponds to a theorem due to Ore and Bondy."},"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":"2605.26479","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T02:39:12Z","cross_cats_sorted":[],"title_canon_sha256":"212a670167cfb9f2ae01246dc6fdd474a35694248fe745f71733f218ff187102","abstract_canon_sha256":"516bd0a9e870815e6f037af913a162ad1f83b068ef7d445c29e114c70fe87915"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-27T01:05:20.384799Z","signature_b64":"RiqdHy5rAUpXhD7yPG6VDef1oevG4c+M28wObyg6EThcxl+zRha2k7Ye7lBHGZER1SB4kTggxO9hSFWY1DsLBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"380f20400c2413e00d15db1bbc65192813190b22081d1e2401a4bfea8eb8890c","last_reissued_at":"2026-05-27T01:05:20.383995Z","signature_status":"signed_v1","first_computed_at":"2026-05-27T01:05:20.383995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The maximum number of paths of a given length in a nonhamiltonian graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chengli Li, Xingzhi Zhan","submitted_at":"2026-05-26T02:39:12Z","abstract_excerpt":"In 1980, Paul Erd\\H{o}s posed the following problem: For every positive integer $n,$ determine a nonhamiltonian graph of order $n$ having the maximum number of Hamilton paths. We solve the more general problem of determining the nonhamiltonian graphs of order $n$ having the maximum number of paths of length $k$ for given integers $n$ and $k$ with $1\\le k\\le n-1.$ The case $k=n-1$ gives a solution to Erd\\H{o}s's problem and the case $k=1$ corresponds to a theorem due to Ore and Bondy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26479","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.26479/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2605.26479","created_at":"2026-05-27T01:05:20.384143+00:00"},{"alias_kind":"arxiv_version","alias_value":"2605.26479v1","created_at":"2026-05-27T01:05:20.384143+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26479","created_at":"2026-05-27T01:05:20.384143+00:00"},{"alias_kind":"pith_short_12","alias_value":"HAHSAQAMEQJ6","created_at":"2026-05-27T01:05:20.384143+00:00"},{"alias_kind":"pith_short_16","alias_value":"HAHSAQAMEQJ6ADIV","created_at":"2026-05-27T01:05:20.384143+00:00"},{"alias_kind":"pith_short_8","alias_value":"HAHSAQAM","created_at":"2026-05-27T01:05:20.384143+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/HAHSAQAMEQJ6ADIV3MN3YZIZFA","json":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA.json","graph_json":"https://pith.science/api/pith-number/HAHSAQAMEQJ6ADIV3MN3YZIZFA/graph.json","events_json":"https://pith.science/api/pith-number/HAHSAQAMEQJ6ADIV3MN3YZIZFA/events.json","paper":"https://pith.science/paper/HAHSAQAM"},"agent_actions":{"view_html":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA","download_json":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA.json","view_paper":"https://pith.science/paper/HAHSAQAM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2605.26479&json=true","fetch_graph":"https://pith.science/api/pith-number/HAHSAQAMEQJ6ADIV3MN3YZIZFA/graph.json","fetch_events":"https://pith.science/api/pith-number/HAHSAQAMEQJ6ADIV3MN3YZIZFA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA/action/storage_attestation","attest_author":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA/action/author_attestation","sign_citation":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA/action/citation_signature","submit_replication":"https://pith.science/pith/HAHSAQAMEQJ6ADIV3MN3YZIZFA/action/replication_record"}},"created_at":"2026-05-27T01:05:20.384143+00:00","updated_at":"2026-05-27T01:05:20.384143+00:00"}