{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:4ORFKLINON7YYVKFYA2SYFLVWJ","short_pith_number":"pith:4ORFKLIN","schema_version":"1.0","canonical_sha256":"e3a2552d0d737f8c5545c0352c1575b26484570e96378a7bb5b68552500b1821","source":{"kind":"arxiv","id":"1009.3754","version":2},"attestation_state":"computed","paper":{"title":"Hamilton cycles in 5-connected line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Petr Vr\\'ana, Tom\\'a\\v{s} Kaiser","submitted_at":"2010-09-20T10:06:23Z","abstract_excerpt":"A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness."},"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":"1009.3754","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-09-20T10:06:23Z","cross_cats_sorted":[],"title_canon_sha256":"acfa2dfdb2f9d0e29cb055f6e190ca6ec12d3829c4ba3223b2bbc5614f1d1e6c","abstract_canon_sha256":"d1657fb55edb1a23fd436baedb4836b614dd022cda1bd3b386b5fc41f6a617c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:25:25.795144Z","signature_b64":"cya5vNBEWzmEJ6Pkqnp7eRFJJaG35zRyNnFdFI1Smc+oa7B6TIXYcsH8/AUIdrPwK1NLkWJRs4ll1enhQI5wCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e3a2552d0d737f8c5545c0352c1575b26484570e96378a7bb5b68552500b1821","last_reissued_at":"2026-05-18T04:25:25.794249Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:25:25.794249Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamilton cycles in 5-connected line graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Petr Vr\\'ana, Tom\\'a\\v{s} Kaiser","submitted_at":"2010-09-20T10:06:23Z","abstract_excerpt":"A conjecture of Carsten Thomassen states that every 4-connected line graph is hamiltonian. It is known that the conjecture is true for 7-connected line graphs. We improve this by showing that any 5-connected line graph of minimum degree at least 6 is hamiltonian. The result extends to claw-free graphs and to Hamilton-connectedness."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1009.3754","kind":"arxiv","version":2},"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":"1009.3754","created_at":"2026-05-18T04:25:25.794393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1009.3754v2","created_at":"2026-05-18T04:25:25.794393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1009.3754","created_at":"2026-05-18T04:25:25.794393+00:00"},{"alias_kind":"pith_short_12","alias_value":"4ORFKLINON7Y","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_16","alias_value":"4ORFKLINON7YYVKF","created_at":"2026-05-18T12:26:04.259169+00:00"},{"alias_kind":"pith_short_8","alias_value":"4ORFKLIN","created_at":"2026-05-18T12:26:04.259169+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/4ORFKLINON7YYVKFYA2SYFLVWJ","json":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ.json","graph_json":"https://pith.science/api/pith-number/4ORFKLINON7YYVKFYA2SYFLVWJ/graph.json","events_json":"https://pith.science/api/pith-number/4ORFKLINON7YYVKFYA2SYFLVWJ/events.json","paper":"https://pith.science/paper/4ORFKLIN"},"agent_actions":{"view_html":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ","download_json":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ.json","view_paper":"https://pith.science/paper/4ORFKLIN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1009.3754&json=true","fetch_graph":"https://pith.science/api/pith-number/4ORFKLINON7YYVKFYA2SYFLVWJ/graph.json","fetch_events":"https://pith.science/api/pith-number/4ORFKLINON7YYVKFYA2SYFLVWJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ/action/storage_attestation","attest_author":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ/action/author_attestation","sign_citation":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ/action/citation_signature","submit_replication":"https://pith.science/pith/4ORFKLINON7YYVKFYA2SYFLVWJ/action/replication_record"}},"created_at":"2026-05-18T04:25:25.794393+00:00","updated_at":"2026-05-18T04:25:25.794393+00:00"}