{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:NY5GVOQCILR6TNZIIW6S66Y3Y6","short_pith_number":"pith:NY5GVOQC","schema_version":"1.0","canonical_sha256":"6e3a6aba0242e3e9b72845bd2f7b1bc78e5d89ec9cb4e311bff8e1dbbc0fa3fa","source":{"kind":"arxiv","id":"1606.07927","version":2},"attestation_state":"computed","paper":{"title":"Chromatic index determined by fractional chromatic index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Luke Postle, Ringi Kim, Songling Shan, Yuping Gao","submitted_at":"2016-06-25T16:09:15Z","abstract_excerpt":"Given a graph $G$ possibly with multiple edges but no loops, denote by $\\Delta$ the {\\it maximum degree}, $\\mu$ the {\\it multiplicity}, $\\chi'$ the {\\it chromatic index} and $\\chi_f'$ the {\\it fractional chromatic index} of $G$, respectively. It is known that $\\Delta\\le \\chi_f' \\le \\chi' \\le \\Delta + \\mu$, where the upper bound is a classic result of Vizing. While deciding the exact value of $\\chi'$ is a classic NP-complete problem, the computing of $\\chi_f'$ is in polynomial time. In fact, it is shown that if $\\chi_f' > \\Delta$ then $\\chi_f'= \\max \\frac{|E(H)|}{\\lfloor |V(H)|/2\\rfloor}$, wher"},"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":"1606.07927","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-06-25T16:09:15Z","cross_cats_sorted":[],"title_canon_sha256":"4c3bb0bd167591dbc6f886a5cb11797ff620078c346f03eb6f5007b7b8fefc7f","abstract_canon_sha256":"cfc4ddac52b3edd6ea28eb7de718ff09c0865741dd767dc41deb3489eb3873d7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:21.089753Z","signature_b64":"Bk/lPUhuOyZPB7oSPvcIMEJxntW+vpqo1jbOqRxKLjccaIpNFQ2eIFiMDxMyAixSBVZnPTqVeg32kXVn8WvgBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6e3a6aba0242e3e9b72845bd2f7b1bc78e5d89ec9cb4e311bff8e1dbbc0fa3fa","last_reissued_at":"2026-05-18T00:55:21.089037Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:21.089037Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Chromatic index determined by fractional chromatic index","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guantao Chen, Luke Postle, Ringi Kim, Songling Shan, Yuping Gao","submitted_at":"2016-06-25T16:09:15Z","abstract_excerpt":"Given a graph $G$ possibly with multiple edges but no loops, denote by $\\Delta$ the {\\it maximum degree}, $\\mu$ the {\\it multiplicity}, $\\chi'$ the {\\it chromatic index} and $\\chi_f'$ the {\\it fractional chromatic index} of $G$, respectively. It is known that $\\Delta\\le \\chi_f' \\le \\chi' \\le \\Delta + \\mu$, where the upper bound is a classic result of Vizing. While deciding the exact value of $\\chi'$ is a classic NP-complete problem, the computing of $\\chi_f'$ is in polynomial time. In fact, it is shown that if $\\chi_f' > \\Delta$ then $\\chi_f'= \\max \\frac{|E(H)|}{\\lfloor |V(H)|/2\\rfloor}$, wher"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1606.07927","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":"1606.07927","created_at":"2026-05-18T00:55:21.089144+00:00"},{"alias_kind":"arxiv_version","alias_value":"1606.07927v2","created_at":"2026-05-18T00:55:21.089144+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1606.07927","created_at":"2026-05-18T00:55:21.089144+00:00"},{"alias_kind":"pith_short_12","alias_value":"NY5GVOQCILR6","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"NY5GVOQCILR6TNZI","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"NY5GVOQC","created_at":"2026-05-18T12:30:36.002864+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/NY5GVOQCILR6TNZIIW6S66Y3Y6","json":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6.json","graph_json":"https://pith.science/api/pith-number/NY5GVOQCILR6TNZIIW6S66Y3Y6/graph.json","events_json":"https://pith.science/api/pith-number/NY5GVOQCILR6TNZIIW6S66Y3Y6/events.json","paper":"https://pith.science/paper/NY5GVOQC"},"agent_actions":{"view_html":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6","download_json":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6.json","view_paper":"https://pith.science/paper/NY5GVOQC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1606.07927&json=true","fetch_graph":"https://pith.science/api/pith-number/NY5GVOQCILR6TNZIIW6S66Y3Y6/graph.json","fetch_events":"https://pith.science/api/pith-number/NY5GVOQCILR6TNZIIW6S66Y3Y6/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6/action/storage_attestation","attest_author":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6/action/author_attestation","sign_citation":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6/action/citation_signature","submit_replication":"https://pith.science/pith/NY5GVOQCILR6TNZIIW6S66Y3Y6/action/replication_record"}},"created_at":"2026-05-18T00:55:21.089144+00:00","updated_at":"2026-05-18T00:55:21.089144+00:00"}