{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","short_pith_number":"pith:FWBGFFMQ","canonical_record":{"source":{"id":"2607.26271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T21:02:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2f70d37eca3d389d38a2282cb34b1da27b06091143f7a6fc1157906b1aade37d","abstract_canon_sha256":"a42d4f6836868c89d36c1c7a0c1adc3983af391fc9c846f87e88503ecae1be9c"},"schema_version":"1.0"},"canonical_sha256":"2d8262959001aec738cd00cebb5b6daa5796b42e4f5be15467d26d9e130ec892","source":{"kind":"arxiv","id":"2607.26271","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26271","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26271v1","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26271","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"FWBGFFMQAGXM","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"FWBGFFMQAGXMOOGN","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"FWBGFFMQ","created_at":"2026-07-30T01:17:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","target":"record","payload":{"canonical_record":{"source":{"id":"2607.26271","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T21:02:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"2f70d37eca3d389d38a2282cb34b1da27b06091143f7a6fc1157906b1aade37d","abstract_canon_sha256":"a42d4f6836868c89d36c1c7a0c1adc3983af391fc9c846f87e88503ecae1be9c"},"schema_version":"1.0"},"canonical_sha256":"2d8262959001aec738cd00cebb5b6daa5796b42e4f5be15467d26d9e130ec892","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d8262959001aec738cd00cebb5b6daa5796b42e4f5be15467d26d9e130ec892","last_reissued_at":"2026-07-30T01:17:53.156973Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:17:53.156973Z"},"source_kind":"arxiv","source_id":"2607.26271","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UWsNgmvvps1gjUAnPW+Wzh8OV1pxeTJnRROfCDCmPlwb16DjggYameOfYjOAoheBLGRwWo0wm0Uncx78CRmWBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:27:40.183916Z"},"content_sha256":"9cd85e68a8ecfd618f8b977f03e86a7dfbc6ac58ca267ae797ad00b705454ac0","schema_version":"1.0","event_id":"sha256:9cd85e68a8ecfd618f8b977f03e86a7dfbc6ac58ca267ae797ad00b705454ac0"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.CO","authors_text":"Abhishek Dhawan, Jonathan A. Noel, Peter Allen","submitted_at":"2026-07-28T21:02:45Z","abstract_excerpt":"Martinsson and Steiner recently proved that the fractional chromatic number of any $d$-degenerate triangle-free graph $G$ satisfies $\\chi_f(G) = O\\left(\\frac{d}{\\log d}\\right)$. They further conjectured a sharp leading constant $1 + o(1)$. In this paper, we confirm their upper bound conjecture for graphs having girth at least $5$. Our proof is constructive: it gives an efficient randomized algorithm that, with high probability, computes a fractional coloring of weight at most $(1 + o(1))\\frac{d}{\\log d}$ in such graphs.\n  Furthermore, we establish their conjectured lower bound in a stronger fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26271","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/2607.26271/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-30T01:17:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dOK+km+u6hUZwKIKdx19kSXvZWr1XeN37oHSWw+rJu5bgrRKPlNFihW7i82bjxGPV3XpsrhQ4lQ4AeEH4BfhDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:27:40.184534Z"},"content_sha256":"8220f441a5157473c6eb1d34287894a2c9b82dbd8ad85406152321ce5e588efe","schema_version":"1.0","event_id":"sha256:8220f441a5157473c6eb1d34287894a2c9b82dbd8ad85406152321ce5e588efe"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","target":"integrity","payload":{"note":"Identifier '10.1002/rsa.20872(cit' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"H. Acan and B. Pittel. “On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph”. In:Random Structures Algorithms56.1 (2020), pp. 37–62.doi:10.1002/ rsa.20872.url:https://doi.org/10.1002/rsa.20872(cit. on","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1002/rsa.20872(cit","arxiv_id":null,"ref_index":1,"raw_excerpt":"H. Acan and B. Pittel. “On connectivity, conductance and bootstrap percolation for a random k-out, age-biased graph”. In:Random Structures Algorithms56.1 (2020), pp. 37–62.doi:10.1002/ rsa.20872.url:https://doi.org/10.1002/rsa.20872(cit. on pp. 4, 8)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":1,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1002/rsa.20872(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"4d8d12f939de51f752828f47e47f226c54d5162912f7051067551c732d9b8680","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14700,"payload_sha256":"dcc5d93cd7c62ce9bf1d5095996b5e30e89fe75674f23983a44f55137fb771be","signature_b64":"AbGJ9i8S1HxN2429ASgjv+3FTla/a6erwsbxaYCRMgNheRZuonKbji09Bh2YrNZlFvqXXzV+vXwJowTSIxsTBQ==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T00:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jSeq/NATqPglDYU/CylFOA9wjDLQju84NTXZAvmu2z36jK+FkUcWJ+/pUY2vdku4gijy+dESDKaqqiruwJFpAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:27:40.190506Z"},"content_sha256":"e28f4686929179b916f57c074ca98b1a2722b9ede6e17e99eb16a2ae65230ee0","schema_version":"1.0","event_id":"sha256:e28f4686929179b916f57c074ca98b1a2722b9ede6e17e99eb16a2ae65230ee0"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","target":"integrity","payload":{"note":"Identifier '10.1017/cbo9781139871495(cit' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"R. P. Stanley.Catalan numbers. Cambridge University Press, New York, 2015.doi:10 . 1017 / CBO9781139871495.url:https://doi.org/10.1017/CBO9781139871495(cit. on p. 14)","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1017/cbo9781139871495(cit","arxiv_id":null,"ref_index":30,"raw_excerpt":"R. P. Stanley.Catalan numbers. Cambridge University Press, New York, 2015.doi:10 . 1017 / CBO9781139871495.url:https://doi.org/10.1017/CBO9781139871495(cit. on p. 14)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":30,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1017/cbo9781139871495(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"0c67d83233c4119e4c1455fd08b8a10ee98b540a09c6908efe6a664c3a3f4d30","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14699,"payload_sha256":"004cc167fab919e9938eff410faf6bc366278f31bff38656462f13b7ff3a05d0","signature_b64":"a4Kn13Tz4dKtjTukVyfOoCCGzdDUYf4c/9VynWiB969YV3I3jurgGz5pJG2lEr8406zQo3B0UUv+ntnHBtNoAw==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T00:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"av1BNdepKaIMuTmKkHK+Nxb0oKRwMGHOrNhF1/m2sTCP4SauiQE/lUWk0+52PxwVlQ8zdZrTKVrCH68zfCOXBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:27:40.190921Z"},"content_sha256":"77260b64991dbb185f851979a889122a4017957ceb1d00278f3ec5704c8eaf87","schema_version":"1.0","event_id":"sha256:77260b64991dbb185f851979a889122a4017957ceb1d00278f3ec5704c8eaf87"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","target":"integrity","payload":{"note":"Identifier '10.1017/s0963548319000026(cit' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"L. Esperet, R. J. Kang, and S. Thomass´ e. “Separation choosability and dense bipartite induced subgraphs”. In:Combinatorics, Probability and Computing28.5 (2019), pp. 720–732.doi:10 . 1017/S0963548319000026.url:https://doi.org/10.1017/S096","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1017/s0963548319000026(cit","arxiv_id":null,"ref_index":13,"raw_excerpt":"L. Esperet, R. J. Kang, and S. Thomass´ e. “Separation choosability and dense bipartite induced subgraphs”. In:Combinatorics, Probability and Computing28.5 (2019), pp. 720–732.doi:10 . 1017/S0963548319000026.url:https://doi.org/10.1017/S0963548319000026(cit. on p. 3)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":13,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1017/s0963548319000026(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"30e5fc5b65fbf4a40973b5d3ab84a600b2ddda3865340b0936f71dac03010917","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14698,"payload_sha256":"e4415356b576a05505543359bc08960856b892e4702175fc458a85d11f512fa9","signature_b64":"NrDNAsK8GU8XJN5dB0GP1UCp2/CRc0Ru/tH/V2UjMceg24LoWzv/fWk5f+n160FPU8Vh0+c6e7f9MwxCmzmDAA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T00:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"biP9Wur9vYvP8TtB0e4WtHBjNU/sfaIW91TyOS2rgkWN/RqLVvm+4Bij4+KGHDSshD3RYVcYtIkXgPSd4BuKDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:27:40.191320Z"},"content_sha256":"862ed39dc4bf729dfca1d1c49ff0c9af558c7a0dbcbea8d73b4fa5f3128fb33a","schema_version":"1.0","event_id":"sha256:862ed39dc4bf729dfca1d1c49ff0c9af558c7a0dbcbea8d73b4fa5f3128fb33a"},{"event_type":"integrity_finding","subject_pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","target":"integrity","payload":{"note":"Identifier '10.1017/s0963548322000104(cit' is syntactically valid but the DOI registry (doi.org) returned 404, and Crossref / OpenAlex / internal corpus also have no record. The cited work could not be located through any authoritative source.","snippet":"J. Anderson, A. Bernshteyn, and A. Dhawan. “Coloring graphs with forbidden bipartite sub- graphs”. In:Combinatorics, Probability and Computing32.1 (2023), pp. 45–67.doi:10 . 1017 / S0963548322000104.url:https://doi.org/10.1017/S096354832200","arxiv_id":"2607.26271","detector":"doi_compliance","evidence":{"doi":"10.1017/s0963548322000104(cit","arxiv_id":null,"ref_index":3,"raw_excerpt":"J. Anderson, A. Bernshteyn, and A. Dhawan. “Coloring graphs with forbidden bipartite sub- graphs”. In:Combinatorics, Probability and Computing32.1 (2023), pp. 45–67.doi:10 . 1017 / S0963548322000104.url:https://doi.org/10.1017/S0963548322000104(cit. on pp. 1, 16)","parse_status":"well_formed","verdict_class":"cross_source","checked_sources":["crossref_by_doi","openalex_by_doi","doi_org_head"],"resolution_status":"hard_miss"},"severity":"critical","ref_index":3,"audited_at":"2026-08-01T00:32:22.995623Z","event_type":"pith.integrity.v1","detected_doi":"10.1017/s0963548322000104(cit","detector_url":"https://pith.science/pith-integrity-protocol#doi_compliance","external_url":null,"finding_type":"unresolvable_identifier","evidence_hash":"5e766f96b104ef40ddf562907e4f1a99562d53fcfa3194410b4e01d50556fe24","paper_version":1,"verdict_class":"cross_source","resolved_title":null,"detector_version":"1.1.0","detected_arxiv_id":null,"integrity_event_id":14697,"payload_sha256":"a8eadd4398fefac82d30a2f8f04b76e763cffc939a324a57f21314bde237b597","signature_b64":"DTUZKMEWcchiUZxQ7HIN8Qtb9ATYlwyK2TEEBy7VcwV3WkRF858NYYk4gJcmOTW0TjPfb2JhQvZbjg8NIk7eCA==","signing_key_id":"pith-v1-2026-05"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-08-01T00:36:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lu3NM5E1qidjtlYHYgSUBhWcGP7+HkDgft+SLh6rQrU7GWflmCM2lCZNY0noLYomC391/JF4f43u5PcDuh54AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T07:27:40.191899Z"},"content_sha256":"8771acff9a048abdc74a0cffd4166b969811e22423c1662c1f74640ffa223f07","schema_version":"1.0","event_id":"sha256:8771acff9a048abdc74a0cffd4166b969811e22423c1662c1f74640ffa223f07"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FWBGFFMQAGXMOOGNADHLWW3NVJ/bundle.json","state_url":"https://pith.science/pith/FWBGFFMQAGXMOOGNADHLWW3NVJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FWBGFFMQAGXMOOGNADHLWW3NVJ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T07:27:40Z","links":{"resolver":"https://pith.science/pith/FWBGFFMQAGXMOOGNADHLWW3NVJ","bundle":"https://pith.science/pith/FWBGFFMQAGXMOOGNADHLWW3NVJ/bundle.json","state":"https://pith.science/pith/FWBGFFMQAGXMOOGNADHLWW3NVJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FWBGFFMQAGXMOOGNADHLWW3NVJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:FWBGFFMQAGXMOOGNADHLWW3NVJ","merge_version":"pith-open-graph-merge-v1","event_count":6,"valid_event_count":6,"invalid_event_count":0,"equivocation_count":1,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"a42d4f6836868c89d36c1c7a0c1adc3983af391fc9c846f87e88503ecae1be9c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T21:02:45Z","title_canon_sha256":"2f70d37eca3d389d38a2282cb34b1da27b06091143f7a6fc1157906b1aade37d"},"schema_version":"1.0","source":{"id":"2607.26271","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26271","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26271v1","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26271","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"pith_short_12","alias_value":"FWBGFFMQAGXM","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"pith_short_16","alias_value":"FWBGFFMQAGXMOOGN","created_at":"2026-07-30T01:17:53Z"},{"alias_kind":"pith_short_8","alias_value":"FWBGFFMQ","created_at":"2026-07-30T01:17:53Z"}],"graph_snapshots":[{"event_id":"sha256:8220f441a5157473c6eb1d34287894a2c9b82dbd8ad85406152321ce5e588efe","target":"graph","created_at":"2026-07-30T01:17:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2607.26271/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Martinsson and Steiner recently proved that the fractional chromatic number of any $d$-degenerate triangle-free graph $G$ satisfies $\\chi_f(G) = O\\left(\\frac{d}{\\log d}\\right)$. They further conjectured a sharp leading constant $1 + o(1)$. In this paper, we confirm their upper bound conjecture for graphs having girth at least $5$. Our proof is constructive: it gives an efficient randomized algorithm that, with high probability, computes a fractional coloring of weight at most $(1 + o(1))\\frac{d}{\\log d}$ in such graphs.\n  Furthermore, we establish their conjectured lower bound in a stronger fo","authors_text":"Abhishek Dhawan, Jonathan A. Noel, Peter Allen","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T21:02:45Z","title":"Sharp bounds for the fractional chromatic number of high-girth $d$-degenerate graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26271","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:9cd85e68a8ecfd618f8b977f03e86a7dfbc6ac58ca267ae797ad00b705454ac0","target":"record","created_at":"2026-07-30T01:17:53Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"a42d4f6836868c89d36c1c7a0c1adc3983af391fc9c846f87e88503ecae1be9c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2026-07-28T21:02:45Z","title_canon_sha256":"2f70d37eca3d389d38a2282cb34b1da27b06091143f7a6fc1157906b1aade37d"},"schema_version":"1.0","source":{"id":"2607.26271","kind":"arxiv","version":1}},"canonical_sha256":"2d8262959001aec738cd00cebb5b6daa5796b42e4f5be15467d26d9e130ec892","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2d8262959001aec738cd00cebb5b6daa5796b42e4f5be15467d26d9e130ec892","first_computed_at":"2026-07-30T01:17:53.156973Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:17:53.156973Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26271","source_kind":"arxiv","source_version":1}}},"equivocations":[{"signer_id":"pith.science","event_type":"integrity_finding","target":"integrity","event_ids":["sha256:77260b64991dbb185f851979a889122a4017957ceb1d00278f3ec5704c8eaf87","sha256:862ed39dc4bf729dfca1d1c49ff0c9af558c7a0dbcbea8d73b4fa5f3128fb33a","sha256:8771acff9a048abdc74a0cffd4166b969811e22423c1662c1f74640ffa223f07","sha256:e28f4686929179b916f57c074ca98b1a2722b9ede6e17e99eb16a2ae65230ee0"]}],"invalid_events":[],"applied_event_ids":["sha256:9cd85e68a8ecfd618f8b977f03e86a7dfbc6ac58ca267ae797ad00b705454ac0","sha256:8220f441a5157473c6eb1d34287894a2c9b82dbd8ad85406152321ce5e588efe"],"state_sha256":"547efc3b4da9ede90269e66ecc410d38cf84fee64b625001ea4e4177a31618d2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gHovelWNVHEleVT5NZugo8ydYDC3rgdt1cs42JEzcIl625OOMYQojcbj/lxCzbdjoh/DX73gchi9QyelJMU1CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T07:27:40.195288Z","bundle_sha256":"39fd434c0c3a00cc5485d6658be6a12b350ab3031c2f4f5fe2a9dce41a669034"}}