{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:NAMCLBWI3Z3C6F3BDQQQNSLVLB","short_pith_number":"pith:NAMCLBWI","schema_version":"1.0","canonical_sha256":"68182586c8de762f17611c2106c9755869f5a5186fbb2028b17e3324e390568c","source":{"kind":"arxiv","id":"1508.02568","version":3},"attestation_state":"computed","paper":{"title":"10-tough chordal graphs are Hamiltonian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela, Tom\\'a\\v{s} Kaiser","submitted_at":"2015-08-11T11:50:21Z","abstract_excerpt":"Chen et al. proved that every 18-tough chordal graph has a Hamilton cycle [Networks 31 (1998), 29-38]. Improving upon their bound, we show that every 10-tough chordal graph is Hamiltonian (in fact, Hamilton-connected). We use Aharoni and Haxell's hypergraph extension of Hall's Theorem as our main tool."},"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":"1508.02568","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-08-11T11:50:21Z","cross_cats_sorted":[],"title_canon_sha256":"018210e356fe68505ddcb178b99b444da9449c291493bb41cd6384a5c0990b1e","abstract_canon_sha256":"fdf9a7db6cc650e07d680590ceb617855ba33cbcc48f546abb619ed001a8aa57"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:35.274215Z","signature_b64":"RnCma1htjoixemj/U56wLa7usf4u1yJSnWK1KMPZt9ZBMj6UM0aQeVTONB35BmhANRHmK8iN/4cbEfLYt1stDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"68182586c8de762f17611c2106c9755869f5a5186fbb2028b17e3324e390568c","last_reissued_at":"2026-05-18T01:11:35.273781Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:35.273781Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"10-tough chordal graphs are Hamiltonian","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adam Kabela, Tom\\'a\\v{s} Kaiser","submitted_at":"2015-08-11T11:50:21Z","abstract_excerpt":"Chen et al. proved that every 18-tough chordal graph has a Hamilton cycle [Networks 31 (1998), 29-38]. Improving upon their bound, we show that every 10-tough chordal graph is Hamiltonian (in fact, Hamilton-connected). We use Aharoni and Haxell's hypergraph extension of Hall's Theorem as our main tool."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1508.02568","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"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":"1508.02568","created_at":"2026-05-18T01:11:35.273842+00:00"},{"alias_kind":"arxiv_version","alias_value":"1508.02568v3","created_at":"2026-05-18T01:11:35.273842+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1508.02568","created_at":"2026-05-18T01:11:35.273842+00:00"},{"alias_kind":"pith_short_12","alias_value":"NAMCLBWI3Z3C","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_16","alias_value":"NAMCLBWI3Z3C6F3B","created_at":"2026-05-18T12:29:32.376354+00:00"},{"alias_kind":"pith_short_8","alias_value":"NAMCLBWI","created_at":"2026-05-18T12:29:32.376354+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/NAMCLBWI3Z3C6F3BDQQQNSLVLB","json":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB.json","graph_json":"https://pith.science/api/pith-number/NAMCLBWI3Z3C6F3BDQQQNSLVLB/graph.json","events_json":"https://pith.science/api/pith-number/NAMCLBWI3Z3C6F3BDQQQNSLVLB/events.json","paper":"https://pith.science/paper/NAMCLBWI"},"agent_actions":{"view_html":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB","download_json":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB.json","view_paper":"https://pith.science/paper/NAMCLBWI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1508.02568&json=true","fetch_graph":"https://pith.science/api/pith-number/NAMCLBWI3Z3C6F3BDQQQNSLVLB/graph.json","fetch_events":"https://pith.science/api/pith-number/NAMCLBWI3Z3C6F3BDQQQNSLVLB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB/action/storage_attestation","attest_author":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB/action/author_attestation","sign_citation":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB/action/citation_signature","submit_replication":"https://pith.science/pith/NAMCLBWI3Z3C6F3BDQQQNSLVLB/action/replication_record"}},"created_at":"2026-05-18T01:11:35.273842+00:00","updated_at":"2026-05-18T01:11:35.273842+00:00"}