{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ABVRD7ZJ5AFV4VYW7TKE472ZKM","short_pith_number":"pith:ABVRD7ZJ","schema_version":"1.0","canonical_sha256":"006b11ff29e80b5e5716fcd44e7f595300f733756c44caf8d4fb2bf62cd0fd72","source":{"kind":"arxiv","id":"1708.08921","version":1},"attestation_state":"computed","paper":{"title":"Hamiltonicity of edge-chromatic critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Guantao Chen, Huiqing Liu, Suyun Jiang, Yan Cao","submitted_at":"2017-08-29T17:52:54Z","abstract_excerpt":"Given a graph $G$, denote by $\\Delta$ and $\\chi^\\prime$ the maximum degree and the chromatic index of $G$, respectively. A simple graph $G$ is called {\\it edge-$\\Delta$-critical} if $\\chi^\\prime(G)=\\Delta+1$ and $\\chi^\\prime(H)\\le\\Delta$ for every proper subgraph $H$ of $G$. We proved that every edge chromatic critical graph of order $n$ with maximum degree at least $\\frac{2n}{3}+12$ is Hamiltonian."},"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":"1708.08921","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-29T17:52:54Z","cross_cats_sorted":[],"title_canon_sha256":"21f6a3420214fd6153b2d89c98bce1db8719d32cd39b6cfc4b205445d6c983ec","abstract_canon_sha256":"bf40431dc99f9f3bc470d1842a4da67bf57044c422fa50470e1e88e86d9e08bb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:21.631052Z","signature_b64":"c5L7vCp5C3RwLY8jheydaKtYkRhw9KM0nNweLO4GuUGX4xegYiAT0nePXS061AP01f9Bb2XWAC1nHQ671+nTDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"006b11ff29e80b5e5716fcd44e7f595300f733756c44caf8d4fb2bf62cd0fd72","last_reissued_at":"2026-05-18T00:36:21.630507Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:21.630507Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Hamiltonicity of edge-chromatic critical graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fuliang Lu, Guantao Chen, Huiqing Liu, Suyun Jiang, Yan Cao","submitted_at":"2017-08-29T17:52:54Z","abstract_excerpt":"Given a graph $G$, denote by $\\Delta$ and $\\chi^\\prime$ the maximum degree and the chromatic index of $G$, respectively. A simple graph $G$ is called {\\it edge-$\\Delta$-critical} if $\\chi^\\prime(G)=\\Delta+1$ and $\\chi^\\prime(H)\\le\\Delta$ for every proper subgraph $H$ of $G$. We proved that every edge chromatic critical graph of order $n$ with maximum degree at least $\\frac{2n}{3}+12$ is Hamiltonian."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.08921","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":""},"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":"1708.08921","created_at":"2026-05-18T00:36:21.630599+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.08921v1","created_at":"2026-05-18T00:36:21.630599+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.08921","created_at":"2026-05-18T00:36:21.630599+00:00"},{"alias_kind":"pith_short_12","alias_value":"ABVRD7ZJ5AFV","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"ABVRD7ZJ5AFV4VYW","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"ABVRD7ZJ","created_at":"2026-05-18T12:31:05.417338+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/ABVRD7ZJ5AFV4VYW7TKE472ZKM","json":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM.json","graph_json":"https://pith.science/api/pith-number/ABVRD7ZJ5AFV4VYW7TKE472ZKM/graph.json","events_json":"https://pith.science/api/pith-number/ABVRD7ZJ5AFV4VYW7TKE472ZKM/events.json","paper":"https://pith.science/paper/ABVRD7ZJ"},"agent_actions":{"view_html":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM","download_json":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM.json","view_paper":"https://pith.science/paper/ABVRD7ZJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.08921&json=true","fetch_graph":"https://pith.science/api/pith-number/ABVRD7ZJ5AFV4VYW7TKE472ZKM/graph.json","fetch_events":"https://pith.science/api/pith-number/ABVRD7ZJ5AFV4VYW7TKE472ZKM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM/action/storage_attestation","attest_author":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM/action/author_attestation","sign_citation":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM/action/citation_signature","submit_replication":"https://pith.science/pith/ABVRD7ZJ5AFV4VYW7TKE472ZKM/action/replication_record"}},"created_at":"2026-05-18T00:36:21.630599+00:00","updated_at":"2026-05-18T00:36:21.630599+00:00"}