{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:IMRY73JMCPQH4E2JVE2HTQJKU2","short_pith_number":"pith:IMRY73JM","schema_version":"1.0","canonical_sha256":"43238fed2c13e07e1349a93479c12aa6aa9c70b2d05faa2aba9e32fef5938683","source":{"kind":"arxiv","id":"0911.2808","version":2},"attestation_state":"computed","paper":{"title":"Fractional total colourings of graphs of high girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew King, Daniel Kral, Tomas Kaiser","submitted_at":"2009-11-14T21:21:17Z","abstract_excerpt":"Reed conjectured that for every epsilon>0 and Delta there exists g such that the fractional total chromatic number of a graph with maximum degree Delta and girth at least g is at most Delta+1+epsilon. We prove the conjecture for Delta=3 and for even Delta>=4 in the following stronger form: For each of these values of Delta, there exists g such that the fractional total chromatic number of any graph with maximum degree Delta and girth at least g is equal to Delta+1."},"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":"0911.2808","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-11-14T21:21:17Z","cross_cats_sorted":[],"title_canon_sha256":"93e2255da452ebc9ae1e75131a58cd3f77a1232bb1d6c86a206aa88102f6ed77","abstract_canon_sha256":"af74aec2250e6e2ee7fc60631a7e266b1caabae5fe059e9e076996ab3f87ccd8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:40:09.499051Z","signature_b64":"TWg0BQwNJjuh0mb61Cbvgdstr5i767jhYTGweFEFjx9NDZaXLHSZVnUxVT5Cnnv/hwSOKnreY5pNFZ1A7T3NAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"43238fed2c13e07e1349a93479c12aa6aa9c70b2d05faa2aba9e32fef5938683","last_reissued_at":"2026-05-18T04:40:09.498438Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:40:09.498438Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fractional total colourings of graphs of high girth","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andrew King, Daniel Kral, Tomas Kaiser","submitted_at":"2009-11-14T21:21:17Z","abstract_excerpt":"Reed conjectured that for every epsilon>0 and Delta there exists g such that the fractional total chromatic number of a graph with maximum degree Delta and girth at least g is at most Delta+1+epsilon. We prove the conjecture for Delta=3 and for even Delta>=4 in the following stronger form: For each of these values of Delta, there exists g such that the fractional total chromatic number of any graph with maximum degree Delta and girth at least g is equal to Delta+1."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0911.2808","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":"0911.2808","created_at":"2026-05-18T04:40:09.498524+00:00"},{"alias_kind":"arxiv_version","alias_value":"0911.2808v2","created_at":"2026-05-18T04:40:09.498524+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0911.2808","created_at":"2026-05-18T04:40:09.498524+00:00"},{"alias_kind":"pith_short_12","alias_value":"IMRY73JMCPQH","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_16","alias_value":"IMRY73JMCPQH4E2J","created_at":"2026-05-18T12:26:00.592388+00:00"},{"alias_kind":"pith_short_8","alias_value":"IMRY73JM","created_at":"2026-05-18T12:26:00.592388+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2210.05915","citing_title":"Coloring, List Coloring, and Painting Squares of Graphs (and other related problems)","ref_index":117,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2","json":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2.json","graph_json":"https://pith.science/api/pith-number/IMRY73JMCPQH4E2JVE2HTQJKU2/graph.json","events_json":"https://pith.science/api/pith-number/IMRY73JMCPQH4E2JVE2HTQJKU2/events.json","paper":"https://pith.science/paper/IMRY73JM"},"agent_actions":{"view_html":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2","download_json":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2.json","view_paper":"https://pith.science/paper/IMRY73JM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0911.2808&json=true","fetch_graph":"https://pith.science/api/pith-number/IMRY73JMCPQH4E2JVE2HTQJKU2/graph.json","fetch_events":"https://pith.science/api/pith-number/IMRY73JMCPQH4E2JVE2HTQJKU2/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2/action/timestamp_anchor","attest_storage":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2/action/storage_attestation","attest_author":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2/action/author_attestation","sign_citation":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2/action/citation_signature","submit_replication":"https://pith.science/pith/IMRY73JMCPQH4E2JVE2HTQJKU2/action/replication_record"}},"created_at":"2026-05-18T04:40:09.498524+00:00","updated_at":"2026-05-18T04:40:09.498524+00:00"}