{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:HRMUDABC22I3EWE5LDV54JN4BN","short_pith_number":"pith:HRMUDABC","schema_version":"1.0","canonical_sha256":"3c59418022d691b2589d58ebde25bc0b62cdd940e2ff2f651a70217ee3c91811","source":{"kind":"arxiv","id":"2606.02030","version":1},"attestation_state":"computed","paper":{"title":"A Domatic Analogue of $\\chi$-Bounded Graph Classes and the Gy\\'{a}rf\\'{a}s-Sumner Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fran\\c{c}ois Pirot, Hoang La, Hossein Zaredehabadi, Quentin Chuet, Selma Djelloul","submitted_at":"2026-06-01T10:18:06Z","abstract_excerpt":"Given a graph $G$, a dominating set is a subset $X\\subseteq V(G)$ such that $N[X]=V(G)$. The \\emph{domatic number} of $G$, denoted ${\\rm dom}(G)$, is the maximum size of a partition of $V(G)$ into dominating sets. In analogy with the lower bound of the chromatic number by the clique number, the domatic number satisfies the upper bound ${\\rm dom}(G)\\le \\delta(G)+1$ where $\\delta(G)$ is the minimum degree of $G$. Therefore, as an analogue of the notion of $\\chi$-bounded graph classes, we say that a class of graphs $\\mathscr{G}$ is \\emph{DOM-bounded} if there exists a positive unbounded function "},"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":"2606.02030","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T10:18:06Z","cross_cats_sorted":[],"title_canon_sha256":"2ef415b1c6e298ac37bc63a54c0430a55c90e16876249031a45b43ceebfbd63e","abstract_canon_sha256":"6d31955b15293949d68b688bd8b44259b2fbfa8a52702a4801676a3eea67a5b7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-02T02:05:03.991502Z","signature_b64":"JsVyh0a4dYgyw5iWMqAqaP4AykVChamVCEZs2252WdPqL+xhY+6AP1XFmvj8jNdlVVnyWv7VnhLY7t1rYCjiDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c59418022d691b2589d58ebde25bc0b62cdd940e2ff2f651a70217ee3c91811","last_reissued_at":"2026-06-02T02:05:03.991093Z","signature_status":"signed_v1","first_computed_at":"2026-06-02T02:05:03.991093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Domatic Analogue of $\\chi$-Bounded Graph Classes and the Gy\\'{a}rf\\'{a}s-Sumner Conjecture","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fran\\c{c}ois Pirot, Hoang La, Hossein Zaredehabadi, Quentin Chuet, Selma Djelloul","submitted_at":"2026-06-01T10:18:06Z","abstract_excerpt":"Given a graph $G$, a dominating set is a subset $X\\subseteq V(G)$ such that $N[X]=V(G)$. The \\emph{domatic number} of $G$, denoted ${\\rm dom}(G)$, is the maximum size of a partition of $V(G)$ into dominating sets. In analogy with the lower bound of the chromatic number by the clique number, the domatic number satisfies the upper bound ${\\rm dom}(G)\\le \\delta(G)+1$ where $\\delta(G)$ is the minimum degree of $G$. Therefore, as an analogue of the notion of $\\chi$-bounded graph classes, we say that a class of graphs $\\mathscr{G}$ is \\emph{DOM-bounded} if there exists a positive unbounded function "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02030","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/2606.02030/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":"2606.02030","created_at":"2026-06-02T02:05:03.991150+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.02030v1","created_at":"2026-06-02T02:05:03.991150+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02030","created_at":"2026-06-02T02:05:03.991150+00:00"},{"alias_kind":"pith_short_12","alias_value":"HRMUDABC22I3","created_at":"2026-06-02T02:05:03.991150+00:00"},{"alias_kind":"pith_short_16","alias_value":"HRMUDABC22I3EWE5","created_at":"2026-06-02T02:05:03.991150+00:00"},{"alias_kind":"pith_short_8","alias_value":"HRMUDABC","created_at":"2026-06-02T02:05:03.991150+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/HRMUDABC22I3EWE5LDV54JN4BN","json":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN.json","graph_json":"https://pith.science/api/pith-number/HRMUDABC22I3EWE5LDV54JN4BN/graph.json","events_json":"https://pith.science/api/pith-number/HRMUDABC22I3EWE5LDV54JN4BN/events.json","paper":"https://pith.science/paper/HRMUDABC"},"agent_actions":{"view_html":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN","download_json":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN.json","view_paper":"https://pith.science/paper/HRMUDABC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.02030&json=true","fetch_graph":"https://pith.science/api/pith-number/HRMUDABC22I3EWE5LDV54JN4BN/graph.json","fetch_events":"https://pith.science/api/pith-number/HRMUDABC22I3EWE5LDV54JN4BN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/action/storage_attestation","attest_author":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/action/author_attestation","sign_citation":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/action/citation_signature","submit_replication":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/action/replication_record"}},"created_at":"2026-06-02T02:05:03.991150+00:00","updated_at":"2026-06-02T02:05:03.991150+00:00"}