{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:EIT73TL4J5ZW2PFXOMIG77YWGZ","short_pith_number":"pith:EIT73TL4","schema_version":"1.0","canonical_sha256":"2227fdcd7c4f736d3cb773106fff16364a4e59e0bd2bc6f7d0e491106181a774","source":{"kind":"arxiv","id":"2501.18238","version":1},"attestation_state":"computed","paper":{"title":"Triangle-free $d$-degenerate graphs have small fractional chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Anders Martinsson","submitted_at":"2025-01-30T09:54:39Z","abstract_excerpt":"A well-known conjecture by Harris states that any triangle-free $d$-degenerate graph has fractional chromatic number at most $O\\left(\\frac{d}{\\ln d}\\right)$. This conjecture has gained much attention in recent years, and is known to have many interesting implications, including a conjecture by Esperet, Kang and Thomass\\'e that any triangle-free graph with minimum degree $d$ contains a bipartite induced subgraph of minimum degree $\\Omega(\\log d)$. Despite this attention, Harris' conjecture has remained wide open with no known improvement on the trivial upper bound, until now.\n  In this article,"},"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":"2501.18238","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2025-01-30T09:54:39Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"5f87037da93a212e8327671b286507d941ac940ce88f42bbb04188e9307c9b45","abstract_canon_sha256":"2f8bf4d3b925e2bbdd1dd98e1497e69a1e8e18364a4bab9d59c328f4145db80d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:07:31.514347Z","signature_b64":"6vwgU6whkrws92LdR7hU+3RZf/fW52DT3G5cSTWwrjyU5AKKhv0U8IDtBzqUPNkOA1LHeD15v7lPaQ0VZti3Cw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2227fdcd7c4f736d3cb773106fff16364a4e59e0bd2bc6f7d0e491106181a774","last_reissued_at":"2026-07-05T10:07:31.513902Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:07:31.513902Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Triangle-free $d$-degenerate graphs have small fractional chromatic number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"math.CO","authors_text":"Anders Martinsson","submitted_at":"2025-01-30T09:54:39Z","abstract_excerpt":"A well-known conjecture by Harris states that any triangle-free $d$-degenerate graph has fractional chromatic number at most $O\\left(\\frac{d}{\\ln d}\\right)$. This conjecture has gained much attention in recent years, and is known to have many interesting implications, including a conjecture by Esperet, Kang and Thomass\\'e that any triangle-free graph with minimum degree $d$ contains a bipartite induced subgraph of minimum degree $\\Omega(\\log d)$. Despite this attention, Harris' conjecture has remained wide open with no known improvement on the trivial upper bound, until now.\n  In this article,"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.18238","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.18238/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2501.18238","created_at":"2026-07-05T10:07:31.513967+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.18238v1","created_at":"2026-07-05T10:07:31.513967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.18238","created_at":"2026-07-05T10:07:31.513967+00:00"},{"alias_kind":"pith_short_12","alias_value":"EIT73TL4J5ZW","created_at":"2026-07-05T10:07:31.513967+00:00"},{"alias_kind":"pith_short_16","alias_value":"EIT73TL4J5ZW2PFX","created_at":"2026-07-05T10:07:31.513967+00:00"},{"alias_kind":"pith_short_8","alias_value":"EIT73TL4","created_at":"2026-07-05T10:07:31.513967+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/EIT73TL4J5ZW2PFXOMIG77YWGZ","json":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ.json","graph_json":"https://pith.science/api/pith-number/EIT73TL4J5ZW2PFXOMIG77YWGZ/graph.json","events_json":"https://pith.science/api/pith-number/EIT73TL4J5ZW2PFXOMIG77YWGZ/events.json","paper":"https://pith.science/paper/EIT73TL4"},"agent_actions":{"view_html":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ","download_json":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ.json","view_paper":"https://pith.science/paper/EIT73TL4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.18238&json=true","fetch_graph":"https://pith.science/api/pith-number/EIT73TL4J5ZW2PFXOMIG77YWGZ/graph.json","fetch_events":"https://pith.science/api/pith-number/EIT73TL4J5ZW2PFXOMIG77YWGZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ/action/storage_attestation","attest_author":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ/action/author_attestation","sign_citation":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ/action/citation_signature","submit_replication":"https://pith.science/pith/EIT73TL4J5ZW2PFXOMIG77YWGZ/action/replication_record"}},"created_at":"2026-07-05T10:07:31.513967+00:00","updated_at":"2026-07-05T10:07:31.513967+00:00"}