{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:IBMZMR6TNSQ2ELPEXARX43JX3T","short_pith_number":"pith:IBMZMR6T","canonical_record":{"source":{"id":"2310.11452","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-17T17:59:07Z","cross_cats_sorted":[],"title_canon_sha256":"60a415cdf1ca8a5caf40e3292164420afe6941727f11e898985ea7995d175b7b","abstract_canon_sha256":"217af8c669ba264c50722a51212489ecca4c3736ff6f536810e2419f27a34b71"},"schema_version":"1.0"},"canonical_sha256":"40599647d36ca1a22de4b8237e6d37dcf12054b205df51b8069f98a70e7a4bd8","source":{"kind":"arxiv","id":"2310.11452","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11452","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11452v4","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11452","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"IBMZMR6TNSQ2","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"IBMZMR6TNSQ2ELPE","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"IBMZMR6T","created_at":"2026-07-05T11:33:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:IBMZMR6TNSQ2ELPEXARX43JX3T","target":"record","payload":{"canonical_record":{"source":{"id":"2310.11452","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-17T17:59:07Z","cross_cats_sorted":[],"title_canon_sha256":"60a415cdf1ca8a5caf40e3292164420afe6941727f11e898985ea7995d175b7b","abstract_canon_sha256":"217af8c669ba264c50722a51212489ecca4c3736ff6f536810e2419f27a34b71"},"schema_version":"1.0"},"canonical_sha256":"40599647d36ca1a22de4b8237e6d37dcf12054b205df51b8069f98a70e7a4bd8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:33:01.004352Z","signature_b64":"hiNWTUxUgh4S2O6JYwgQdOLCgaOWlizQGlwOrcNH5W7tsJIhNuE3ObQI900/dc3Fo9TnTLR8iWKFr/mfzYs2Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"40599647d36ca1a22de4b8237e6d37dcf12054b205df51b8069f98a70e7a4bd8","last_reissued_at":"2026-07-05T11:33:01.003892Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:33:01.003892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.11452","source_version":4,"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-05T11:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qetHYih6svul/ejsCbfrBs6vHGLScuH1r09SrUyK7qwJ9ungdIHYsPnFrRrdqTVKJgIdegAUrXiFZqr9aWZEAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:20:05.031928Z"},"content_sha256":"12645b5bae9593ca42e9663789a654cc66d5c2bad39e672cea1f25298a8d95b3","schema_version":"1.0","event_id":"sha256:12645b5bae9593ca42e9663789a654cc66d5c2bad39e672cea1f25298a8d95b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:IBMZMR6TNSQ2ELPEXARX43JX3T","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Ore plus Tur\\'{a}n","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Aleyah Dawkins, Rachel Kirsch","submitted_at":"2023-10-17T17:59:07Z","abstract_excerpt":"Ore in 1961 determined the maximum number of edges in graphs not containing a Hamiltonian cycle, and Tur\\'{a}n in 1941 found the maximum number of edges in graphs not containing a $K_{r+1}$. Motivated by the work of Adamus in 2009 and Ferrero and Lesniak in 2018 on the maximum number of edges in $r$-partite non-Hamiltonian graphs, we find the maximum number of edges in $K_{r+1}$-free non-Hamiltonian graphs. Then we extend this result from Hamiltonicity to traceability, chorded pancyclicity, Hamiltonian-connectedness, $k$-path Hamiltonicity, $k$-Hamiltonicity, $k$-Hamiltonian-connectedness, and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11452","kind":"arxiv","version":4},"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/2310.11452/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-05T11:33:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zRFas/fHNvHFBUKCaRWapxCGAnTz9FDFus1ZnIhMNXtRqkL4/ZyZO4bIMdFmk6ESmkhM/A5sQzMY6i++XLkdDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T07:20:05.032591Z"},"content_sha256":"3f934e8aa6f4c8f9b9b6d1dce3767a86b8a610f55e6f9df28521bc82e3b2ae1e","schema_version":"1.0","event_id":"sha256:3f934e8aa6f4c8f9b9b6d1dce3767a86b8a610f55e6f9df28521bc82e3b2ae1e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IBMZMR6TNSQ2ELPEXARX43JX3T/bundle.json","state_url":"https://pith.science/pith/IBMZMR6TNSQ2ELPEXARX43JX3T/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IBMZMR6TNSQ2ELPEXARX43JX3T/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-07-07T07:20:05Z","links":{"resolver":"https://pith.science/pith/IBMZMR6TNSQ2ELPEXARX43JX3T","bundle":"https://pith.science/pith/IBMZMR6TNSQ2ELPEXARX43JX3T/bundle.json","state":"https://pith.science/pith/IBMZMR6TNSQ2ELPEXARX43JX3T/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IBMZMR6TNSQ2ELPEXARX43JX3T/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:IBMZMR6TNSQ2ELPEXARX43JX3T","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":"217af8c669ba264c50722a51212489ecca4c3736ff6f536810e2419f27a34b71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-17T17:59:07Z","title_canon_sha256":"60a415cdf1ca8a5caf40e3292164420afe6941727f11e898985ea7995d175b7b"},"schema_version":"1.0","source":{"id":"2310.11452","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11452","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11452v4","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11452","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"pith_short_12","alias_value":"IBMZMR6TNSQ2","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"pith_short_16","alias_value":"IBMZMR6TNSQ2ELPE","created_at":"2026-07-05T11:33:01Z"},{"alias_kind":"pith_short_8","alias_value":"IBMZMR6T","created_at":"2026-07-05T11:33:01Z"}],"graph_snapshots":[{"event_id":"sha256:3f934e8aa6f4c8f9b9b6d1dce3767a86b8a610f55e6f9df28521bc82e3b2ae1e","target":"graph","created_at":"2026-07-05T11:33:01Z","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/2310.11452/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Ore in 1961 determined the maximum number of edges in graphs not containing a Hamiltonian cycle, and Tur\\'{a}n in 1941 found the maximum number of edges in graphs not containing a $K_{r+1}$. Motivated by the work of Adamus in 2009 and Ferrero and Lesniak in 2018 on the maximum number of edges in $r$-partite non-Hamiltonian graphs, we find the maximum number of edges in $K_{r+1}$-free non-Hamiltonian graphs. Then we extend this result from Hamiltonicity to traceability, chorded pancyclicity, Hamiltonian-connectedness, $k$-path Hamiltonicity, $k$-Hamiltonicity, $k$-Hamiltonian-connectedness, and","authors_text":"Aleyah Dawkins, Rachel Kirsch","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-17T17:59:07Z","title":"Ore plus Tur\\'{a}n"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11452","kind":"arxiv","version":4},"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:12645b5bae9593ca42e9663789a654cc66d5c2bad39e672cea1f25298a8d95b3","target":"record","created_at":"2026-07-05T11:33:01Z","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":"217af8c669ba264c50722a51212489ecca4c3736ff6f536810e2419f27a34b71","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-10-17T17:59:07Z","title_canon_sha256":"60a415cdf1ca8a5caf40e3292164420afe6941727f11e898985ea7995d175b7b"},"schema_version":"1.0","source":{"id":"2310.11452","kind":"arxiv","version":4}},"canonical_sha256":"40599647d36ca1a22de4b8237e6d37dcf12054b205df51b8069f98a70e7a4bd8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"40599647d36ca1a22de4b8237e6d37dcf12054b205df51b8069f98a70e7a4bd8","first_computed_at":"2026-07-05T11:33:01.003892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:33:01.003892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hiNWTUxUgh4S2O6JYwgQdOLCgaOWlizQGlwOrcNH5W7tsJIhNuE3ObQI900/dc3Fo9TnTLR8iWKFr/mfzYs2Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T11:33:01.004352Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.11452","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:12645b5bae9593ca42e9663789a654cc66d5c2bad39e672cea1f25298a8d95b3","sha256:3f934e8aa6f4c8f9b9b6d1dce3767a86b8a610f55e6f9df28521bc82e3b2ae1e"],"state_sha256":"cd3959c557af5f23aa296ad1dfbbcab8de866e44c19b0b9312ee9a6e8cec76c4"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xNvIaVYXZQpHb/im4m88/Pb2QuAYhEyg2HUFi1Or040ksnZhNI8oQ+ljsHkZurdagsrrAjWMWA5MGWQ5vZE2Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T07:20:05.036035Z","bundle_sha256":"b8e99a5f99db2fb81a196be9f3644357956a281ef76df07018b4a1b4fba39c6e"}}