{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:S2JPBV34MOQPEEWYNOJBCJYF3K","short_pith_number":"pith:S2JPBV34","canonical_record":{"source":{"id":"2405.00991","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-05-02T04:08:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"28f81badb702c8709c3ac3a28fd00da58c630cbdba68720776b87e7c4ffb5c05","abstract_canon_sha256":"b8420b99c27cfa85d5bed190ee3079f55370be2ea7f514e2ce1539774bb868bf"},"schema_version":"1.0"},"canonical_sha256":"9692f0d77c63a0f212d86b92112705dabdc0f31d88e4664be7e6f35622e6fba7","source":{"kind":"arxiv","id":"2405.00991","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.00991","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"arxiv_version","alias_value":"2405.00991v4","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00991","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"pith_short_12","alias_value":"S2JPBV34MOQP","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"pith_short_16","alias_value":"S2JPBV34MOQPEEWY","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"pith_short_8","alias_value":"S2JPBV34","created_at":"2026-06-11T00:08:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:S2JPBV34MOQPEEWYNOJBCJYF3K","target":"record","payload":{"canonical_record":{"source":{"id":"2405.00991","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-05-02T04:08:45Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"28f81badb702c8709c3ac3a28fd00da58c630cbdba68720776b87e7c4ffb5c05","abstract_canon_sha256":"b8420b99c27cfa85d5bed190ee3079f55370be2ea7f514e2ce1539774bb868bf"},"schema_version":"1.0"},"canonical_sha256":"9692f0d77c63a0f212d86b92112705dabdc0f31d88e4664be7e6f35622e6fba7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-11T00:08:10.169079Z","signature_b64":"ag8Uf0kweRaimZaXeQ1rpkron0yjrP629Bt7hSTQHdulL1ZD/4kWhskAaaHGtc7yx9EPCo+uRIuARomZ+5vWAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9692f0d77c63a0f212d86b92112705dabdc0f31d88e4664be7e6f35622e6fba7","last_reissued_at":"2026-06-11T00:08:10.168169Z","signature_status":"signed_v1","first_computed_at":"2026-06-11T00:08:10.168169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.00991","source_version":4,"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-06-11T00:08:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sfPZejjzp3BPVWVnjFhrThjDg3tq4kE9qMQSe7Y2Xi/p6SYJWb2HR4+ccsthhILEKckkoiSJPLziykUuUVdVDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:21:44.861849Z"},"content_sha256":"180d935a619959b7e5e5909d7aabc0ab47e341385e0f761fcb318417c5a356f6","schema_version":"1.0","event_id":"sha256:180d935a619959b7e5e5909d7aabc0ab47e341385e0f761fcb318417c5a356f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:S2JPBV34MOQPEEWYNOJBCJYF3K","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Measurable Brooks's Theorem for Directed Graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"Borel directed graphs of maximum degree d admit measurable d-dicolorings unless they contain the complete symmetric digraph on d+1 vertices.","cross_cats":["math.CO"],"primary_cat":"math.LO","authors_text":"Cecelia Higgins","submitted_at":"2024-05-02T04:08:45Z","abstract_excerpt":"We prove a descriptive version of Brooks's theorem for directed graphs. In particular, we show that, if $D$ is a Borel directed graph on a standard Borel space $X$ such that the maximum degree of each vertex is at most $d \\geq 3$, then unless $D$ contains the complete symmetric directed graph on $d + 1$ vertices, $D$ admits a $\\mu$-measurable $d$-dicoloring with respect to any Borel probability measure $\\mu$ on $X$, and $D$ admits a $\\tau$-Baire-measurable $d$-dicoloring with respect to any Polish topology $\\tau$ compatible with the Borel structure on $X$. We also prove a definable version of "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"if D is a Borel directed graph on a standard Borel space X such that the maximum degree of each vertex is at most d ≥ 3, then unless D contains the complete symmetric directed graph on d + 1 vertices, D admits a μ-measurable d-dicoloring with respect to any Borel probability measure μ on X, and D admits a τ-Baire-measurable d-dicoloring with respect to any Polish topology τ compatible with the Borel structure on X.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The directed graph D must be Borel as a subset of X × X on a standard Borel space X; this Borel assumption is what permits the existence of measurable colorings with respect to arbitrary Borel measures and compatible Polish topologies (abstract, first sentence of main result).","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Borel directed graphs of bounded degree admit mu-measurable and Baire-measurable d-dicolorings unless containing the complete symmetric digraph on d+1 vertices, plus a definable Gallai theorem for list dicolorings.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Borel directed graphs of maximum degree d admit measurable d-dicolorings unless they contain the complete symmetric digraph on d+1 vertices.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"ac106f239121593fd3f5ac2fb6258c05c8fe757e0f90d7601daeb9b65d452d43"},"source":{"id":"2405.00991","kind":"arxiv","version":4},"verdict":{"id":"e2b05219-09ba-4d32-b576-277c9bc26e6d","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-24T01:36:17.725709Z","strongest_claim":"if D is a Borel directed graph on a standard Borel space X such that the maximum degree of each vertex is at most d ≥ 3, then unless D contains the complete symmetric directed graph on d + 1 vertices, D admits a μ-measurable d-dicoloring with respect to any Borel probability measure μ on X, and D admits a τ-Baire-measurable d-dicoloring with respect to any Polish topology τ compatible with the Borel structure on X.","one_line_summary":"Borel directed graphs of bounded degree admit mu-measurable and Baire-measurable d-dicolorings unless containing the complete symmetric digraph on d+1 vertices, plus a definable Gallai theorem for list dicolorings.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The directed graph D must be Borel as a subset of X × X on a standard Borel space X; this Borel assumption is what permits the existence of measurable colorings with respect to arbitrary Borel measures and compatible Polish topologies (abstract, first sentence of main result).","pith_extraction_headline":"Borel directed graphs of maximum degree d admit measurable d-dicolorings unless they contain the complete symmetric digraph on d+1 vertices."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2405.00991/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":2,"sample":[{"doi":"","year":2024,"title":"[BCG+24] S. Brandt, Y. J. Chang, J. Greb´ ık, C. Grunau, V. Rozhoˇ n, and Z. Vidny´ anszky,On homomor- phism graphs, Forum Math. Pi12(2024), e10. [Ber19] A. Bernshteyn,Measurable versions of the Lov´ ","work_id":"24450fc0-5d61-4810-9fec-ea17b079141d","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"Borel order dimension","work_id":"64fe3eaa-f4f6-4a08-9973-129d704039ff","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":2,"snapshot_sha256":"4b85a9c1c0a794b812e27db7d0b2134bb704d0a63e56fecf78a97c937226c8c9","internal_anchors":0},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b4f05b2730c06bd7755d94d7bd8d17845268266095959fed49269c2fd4027e63"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"verdict_id":"e2b05219-09ba-4d32-b576-277c9bc26e6d"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-06-11T00:08:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hj6BMVcpHoSZBZkYm2CawoFlT+Lgboec/bCoro5FOBYqYA4NOy096n2SFHjZM6hmsAKAdjlv02b9pf9gFf2OCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:21:44.863098Z"},"content_sha256":"5bfec396817f4bf5be4941303beb5b42966c8b79554eb0d39af788624ecb6625","schema_version":"1.0","event_id":"sha256:5bfec396817f4bf5be4941303beb5b42966c8b79554eb0d39af788624ecb6625"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/S2JPBV34MOQPEEWYNOJBCJYF3K/bundle.json","state_url":"https://pith.science/pith/S2JPBV34MOQPEEWYNOJBCJYF3K/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/S2JPBV34MOQPEEWYNOJBCJYF3K/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-06-11T22:21:44Z","links":{"resolver":"https://pith.science/pith/S2JPBV34MOQPEEWYNOJBCJYF3K","bundle":"https://pith.science/pith/S2JPBV34MOQPEEWYNOJBCJYF3K/bundle.json","state":"https://pith.science/pith/S2JPBV34MOQPEEWYNOJBCJYF3K/state.json","well_known_bundle":"https://pith.science/.well-known/pith/S2JPBV34MOQPEEWYNOJBCJYF3K/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:S2JPBV34MOQPEEWYNOJBCJYF3K","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"b8420b99c27cfa85d5bed190ee3079f55370be2ea7f514e2ce1539774bb868bf","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-05-02T04:08:45Z","title_canon_sha256":"28f81badb702c8709c3ac3a28fd00da58c630cbdba68720776b87e7c4ffb5c05"},"schema_version":"1.0","source":{"id":"2405.00991","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.00991","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"arxiv_version","alias_value":"2405.00991v4","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.00991","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"pith_short_12","alias_value":"S2JPBV34MOQP","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"pith_short_16","alias_value":"S2JPBV34MOQPEEWY","created_at":"2026-06-11T00:08:10Z"},{"alias_kind":"pith_short_8","alias_value":"S2JPBV34","created_at":"2026-06-11T00:08:10Z"}],"graph_snapshots":[{"event_id":"sha256:5bfec396817f4bf5be4941303beb5b42966c8b79554eb0d39af788624ecb6625","target":"graph","created_at":"2026-06-11T00:08:10Z","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":4,"items":[{"attestation":"unclaimed","claim_id":"C1","kind":"strongest_claim","source":"verdict.strongest_claim","status":"machine_extracted","text":"if D is a Borel directed graph on a standard Borel space X such that the maximum degree of each vertex is at most d ≥ 3, then unless D contains the complete symmetric directed graph on d + 1 vertices, D admits a μ-measurable d-dicoloring with respect to any Borel probability measure μ on X, and D admits a τ-Baire-measurable d-dicoloring with respect to any Polish topology τ compatible with the Borel structure on X."},{"attestation":"unclaimed","claim_id":"C2","kind":"weakest_assumption","source":"verdict.weakest_assumption","status":"machine_extracted","text":"The directed graph D must be Borel as a subset of X × X on a standard Borel space X; this Borel assumption is what permits the existence of measurable colorings with respect to arbitrary Borel measures and compatible Polish topologies (abstract, first sentence of main result)."},{"attestation":"unclaimed","claim_id":"C3","kind":"one_line_summary","source":"verdict.one_line_summary","status":"machine_extracted","text":"Borel directed graphs of bounded degree admit mu-measurable and Baire-measurable d-dicolorings unless containing the complete symmetric digraph on d+1 vertices, plus a definable Gallai theorem for list dicolorings."},{"attestation":"unclaimed","claim_id":"C4","kind":"headline","source":"verdict.pith_extraction.headline","status":"machine_extracted","text":"Borel directed graphs of maximum degree d admit measurable d-dicolorings unless they contain the complete symmetric digraph on d+1 vertices."}],"snapshot_sha256":"ac106f239121593fd3f5ac2fb6258c05c8fe757e0f90d7601daeb9b65d452d43"},"formal_canon":{"evidence_count":2,"snapshot_sha256":"b4f05b2730c06bd7755d94d7bd8d17845268266095959fed49269c2fd4027e63"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.00991/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We prove a descriptive version of Brooks's theorem for directed graphs. In particular, we show that, if $D$ is a Borel directed graph on a standard Borel space $X$ such that the maximum degree of each vertex is at most $d \\geq 3$, then unless $D$ contains the complete symmetric directed graph on $d + 1$ vertices, $D$ admits a $\\mu$-measurable $d$-dicoloring with respect to any Borel probability measure $\\mu$ on $X$, and $D$ admits a $\\tau$-Baire-measurable $d$-dicoloring with respect to any Polish topology $\\tau$ compatible with the Borel structure on $X$. We also prove a definable version of ","authors_text":"Cecelia Higgins","cross_cats":["math.CO"],"headline":"Borel directed graphs of maximum degree d admit measurable d-dicolorings unless they contain the complete symmetric digraph on d+1 vertices.","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-05-02T04:08:45Z","title":"Measurable Brooks's Theorem for Directed Graphs"},"references":{"count":2,"internal_anchors":0,"resolved_work":2,"sample":[{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":1,"title":"[BCG+24] S. Brandt, Y. J. Chang, J. Greb´ ık, C. Grunau, V. Rozhoˇ n, and Z. Vidny´ anszky,On homomor- phism graphs, Forum Math. Pi12(2024), e10. [Ber19] A. Bernshteyn,Measurable versions of the Lov´ ","work_id":"24450fc0-5d61-4810-9fec-ea17b079141d","year":2024},{"cited_arxiv_id":"","doi":"","is_internal_anchor":false,"ref_index":2,"title":"Borel order dimension","work_id":"64fe3eaa-f4f6-4a08-9973-129d704039ff","year":1999}],"snapshot_sha256":"4b85a9c1c0a794b812e27db7d0b2134bb704d0a63e56fecf78a97c937226c8c9"},"source":{"id":"2405.00991","kind":"arxiv","version":4},"verdict":{"created_at":"2026-05-24T01:36:17.725709Z","id":"e2b05219-09ba-4d32-b576-277c9bc26e6d","model_set":{"reader":"grok-4.3"},"one_line_summary":"Borel directed graphs of bounded degree admit mu-measurable and Baire-measurable d-dicolorings unless containing the complete symmetric digraph on d+1 vertices, plus a definable Gallai theorem for list dicolorings.","pipeline_version":"pith-pipeline@v0.9.0","pith_extraction_headline":"Borel directed graphs of maximum degree d admit measurable d-dicolorings unless they contain the complete symmetric digraph on d+1 vertices.","strongest_claim":"if D is a Borel directed graph on a standard Borel space X such that the maximum degree of each vertex is at most d ≥ 3, then unless D contains the complete symmetric directed graph on d + 1 vertices, D admits a μ-measurable d-dicoloring with respect to any Borel probability measure μ on X, and D admits a τ-Baire-measurable d-dicoloring with respect to any Polish topology τ compatible with the Borel structure on X.","weakest_assumption":"The directed graph D must be Borel as a subset of X × X on a standard Borel space X; this Borel assumption is what permits the existence of measurable colorings with respect to arbitrary Borel measures and compatible Polish topologies (abstract, first sentence of main result)."}},"verdict_id":"e2b05219-09ba-4d32-b576-277c9bc26e6d"}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:180d935a619959b7e5e5909d7aabc0ab47e341385e0f761fcb318417c5a356f6","target":"record","created_at":"2026-06-11T00:08:10Z","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":"b8420b99c27cfa85d5bed190ee3079f55370be2ea7f514e2ce1539774bb868bf","cross_cats_sorted":["math.CO"],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.LO","submitted_at":"2024-05-02T04:08:45Z","title_canon_sha256":"28f81badb702c8709c3ac3a28fd00da58c630cbdba68720776b87e7c4ffb5c05"},"schema_version":"1.0","source":{"id":"2405.00991","kind":"arxiv","version":4}},"canonical_sha256":"9692f0d77c63a0f212d86b92112705dabdc0f31d88e4664be7e6f35622e6fba7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9692f0d77c63a0f212d86b92112705dabdc0f31d88e4664be7e6f35622e6fba7","first_computed_at":"2026-06-11T00:08:10.168169Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-11T00:08:10.168169Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ag8Uf0kweRaimZaXeQ1rpkron0yjrP629Bt7hSTQHdulL1ZD/4kWhskAaaHGtc7yx9EPCo+uRIuARomZ+5vWAA==","signature_status":"signed_v1","signed_at":"2026-06-11T00:08:10.169079Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.00991","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:180d935a619959b7e5e5909d7aabc0ab47e341385e0f761fcb318417c5a356f6","sha256:5bfec396817f4bf5be4941303beb5b42966c8b79554eb0d39af788624ecb6625"],"state_sha256":"365429b061f7feb82d2bf908b93c54bada4e118c8ed4625a7355bf325411976a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"T2w3vqmvfud8wr9MCu0fDefIOr0ojE80Cj003JflDQqerWox8GEMYX78kVQ0B04v/sIgC9FqUrcpeFA6ukx9Aw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:21:44.868212Z","bundle_sha256":"78783de16560f47ce42ca2ba420f8483fcdcc4f49a1270ff7f9997a7733d2942"}}