{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VD4H2P472F6HNZNAPX4VYAX4KS","short_pith_number":"pith:VD4H2P47","schema_version":"1.0","canonical_sha256":"a8f87d3f9fd17c76e5a07df95c02fc54a5197111fec13778878e37aaeb459180","source":{"kind":"arxiv","id":"1311.2969","version":1},"attestation_state":"computed","paper":{"title":"List edge-colouring and total colouring in graphs of low treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henning Bruhn, Maya Stein, Richard Lang","submitted_at":"2013-11-12T22:11:08Z","abstract_excerpt":"We prove that the list chromatic index of a graph of maximum degree $\\Delta$ and treewidth $\\leq \\sqrt{2\\Delta} -3$ is $\\Delta$; and that the total chromatic number of a graph of maximum degree $\\Delta$ and treewidth $\\leq \\Delta/3 +1$ is $\\Delta +1$. This improves results by Meeks and Scott."},"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":"1311.2969","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-12T22:11:08Z","cross_cats_sorted":[],"title_canon_sha256":"2645149c89de4e7801a6f9b93f21bec7298ea022557bd527abe0c22ccb5c26b9","abstract_canon_sha256":"191c4f6461440432246f1239cf4d5b7f154d80cad99ff7fdf3a3ba29068a61a9"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:07:13.524215Z","signature_b64":"fong0VTws5GCQ/3Yyjkx6Cd1ggzl3xKSLbh0IABrzhnU9pDNARGyJqSQrx2I6LuaaJc9L5p5J9MPsOu367nYAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a8f87d3f9fd17c76e5a07df95c02fc54a5197111fec13778878e37aaeb459180","last_reissued_at":"2026-05-18T03:07:13.523566Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:07:13.523566Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"List edge-colouring and total colouring in graphs of low treewidth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Henning Bruhn, Maya Stein, Richard Lang","submitted_at":"2013-11-12T22:11:08Z","abstract_excerpt":"We prove that the list chromatic index of a graph of maximum degree $\\Delta$ and treewidth $\\leq \\sqrt{2\\Delta} -3$ is $\\Delta$; and that the total chromatic number of a graph of maximum degree $\\Delta$ and treewidth $\\leq \\Delta/3 +1$ is $\\Delta +1$. This improves results by Meeks and Scott."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.2969","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":"1311.2969","created_at":"2026-05-18T03:07:13.523666+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.2969v1","created_at":"2026-05-18T03:07:13.523666+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.2969","created_at":"2026-05-18T03:07:13.523666+00:00"},{"alias_kind":"pith_short_12","alias_value":"VD4H2P472F6H","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VD4H2P472F6HNZNA","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VD4H2P47","created_at":"2026-05-18T12:28:04.890932+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/VD4H2P472F6HNZNAPX4VYAX4KS","json":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS.json","graph_json":"https://pith.science/api/pith-number/VD4H2P472F6HNZNAPX4VYAX4KS/graph.json","events_json":"https://pith.science/api/pith-number/VD4H2P472F6HNZNAPX4VYAX4KS/events.json","paper":"https://pith.science/paper/VD4H2P47"},"agent_actions":{"view_html":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS","download_json":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS.json","view_paper":"https://pith.science/paper/VD4H2P47","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.2969&json=true","fetch_graph":"https://pith.science/api/pith-number/VD4H2P472F6HNZNAPX4VYAX4KS/graph.json","fetch_events":"https://pith.science/api/pith-number/VD4H2P472F6HNZNAPX4VYAX4KS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS/action/storage_attestation","attest_author":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS/action/author_attestation","sign_citation":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS/action/citation_signature","submit_replication":"https://pith.science/pith/VD4H2P472F6HNZNAPX4VYAX4KS/action/replication_record"}},"created_at":"2026-05-18T03:07:13.523666+00:00","updated_at":"2026-05-18T03:07:13.523666+00:00"}