{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HAHSAQAMEQJ6ADIV3MN3YZIZFA","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":"516bd0a9e870815e6f037af913a162ad1f83b068ef7d445c29e114c70fe87915","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T02:39:12Z","title_canon_sha256":"212a670167cfb9f2ae01246dc6fdd474a35694248fe745f71733f218ff187102"},"schema_version":"1.0","source":{"id":"2605.26479","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2605.26479","created_at":"2026-05-27T01:05:20Z"},{"alias_kind":"arxiv_version","alias_value":"2605.26479v1","created_at":"2026-05-27T01:05:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2605.26479","created_at":"2026-05-27T01:05:20Z"},{"alias_kind":"pith_short_12","alias_value":"HAHSAQAMEQJ6","created_at":"2026-05-27T01:05:20Z"},{"alias_kind":"pith_short_16","alias_value":"HAHSAQAMEQJ6ADIV","created_at":"2026-05-27T01:05:20Z"},{"alias_kind":"pith_short_8","alias_value":"HAHSAQAM","created_at":"2026-05-27T01:05:20Z"}],"graph_snapshots":[{"event_id":"sha256:fa3e087516dbf1dd2a95b4599bd4600c09e5387e1b868c046ee6dff1715785a5","target":"graph","created_at":"2026-05-27T01:05:20Z","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/2605.26479/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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.","authors_text":"Chengli Li, Xingzhi Zhan","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T02:39:12Z","title":"The maximum number of paths of a given length in a nonhamiltonian graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2605.26479","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:6c3d1facb537bda5248a15d9aa579f9ad37c6029effd1529cd4ba4c31b6ef077","target":"record","created_at":"2026-05-27T01:05:20Z","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":"516bd0a9e870815e6f037af913a162ad1f83b068ef7d445c29e114c70fe87915","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-05-26T02:39:12Z","title_canon_sha256":"212a670167cfb9f2ae01246dc6fdd474a35694248fe745f71733f218ff187102"},"schema_version":"1.0","source":{"id":"2605.26479","kind":"arxiv","version":1}},"canonical_sha256":"380f20400c2413e00d15db1bbc65192813190b22081d1e2401a4bfea8eb8890c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"380f20400c2413e00d15db1bbc65192813190b22081d1e2401a4bfea8eb8890c","first_computed_at":"2026-05-27T01:05:20.383995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-27T01:05:20.383995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"RiqdHy5rAUpXhD7yPG6VDef1oevG4c+M28wObyg6EThcxl+zRha2k7Ye7lBHGZER1SB4kTggxO9hSFWY1DsLBQ==","signature_status":"signed_v1","signed_at":"2026-05-27T01:05:20.384799Z","signed_message":"canonical_sha256_bytes"},"source_id":"2605.26479","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c3d1facb537bda5248a15d9aa579f9ad37c6029effd1529cd4ba4c31b6ef077","sha256:fa3e087516dbf1dd2a95b4599bd4600c09e5387e1b868c046ee6dff1715785a5"],"state_sha256":"9fbf662673630d79e5a1be1f92ce12d1ca758db356e2c9151105b93f6e8ba9c2"}