{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:HRMUDABC22I3EWE5LDV54JN4BN","short_pith_number":"pith:HRMUDABC","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"},"canonical_sha256":"3c59418022d691b2589d58ebde25bc0b62cdd940e2ff2f651a70217ee3c91811","source":{"kind":"arxiv","id":"2606.02030","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02030","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02030v1","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02030","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"HRMUDABC22I3","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"HRMUDABC22I3EWE5","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"HRMUDABC","created_at":"2026-06-02T02:05:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:HRMUDABC22I3EWE5LDV54JN4BN","target":"record","payload":{"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"},"canonical_sha256":"3c59418022d691b2589d58ebde25bc0b62cdd940e2ff2f651a70217ee3c91811","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"},"source_kind":"arxiv","source_id":"2606.02030","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-06-02T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"lnJ3uaKTYO0krIRiRjLLXg133QvsvHIJWMQIGTshy3MYtomxMTofN3vbmxJenwWksPokzxgbTUjSvkdgqg2tAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:04:55.841699Z"},"content_sha256":"63ef530e8c323859033577c8b2ec8336cc5e62b96479de18462160ea97d1240c","schema_version":"1.0","event_id":"sha256:63ef530e8c323859033577c8b2ec8336cc5e62b96479de18462160ea97d1240c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:HRMUDABC22I3EWE5LDV54JN4BN","target":"graph","payload":{"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"},"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-06-02T02:05:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1MiboTNtlVk79aMVfZPK37j1k9Qc9I4liThKCTWx9GgLU9hipNype4dx1Dlo9miky/Pw11C7NZVm9clg5cjHAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-10T15:04:55.842398Z"},"content_sha256":"74779190397ec3e6b0c232b02fdcae82a6dc8f47d119cd501ce91771fde2ee35","schema_version":"1.0","event_id":"sha256:74779190397ec3e6b0c232b02fdcae82a6dc8f47d119cd501ce91771fde2ee35"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/bundle.json","state_url":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HRMUDABC22I3EWE5LDV54JN4BN/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-10T15:04:55Z","links":{"resolver":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN","bundle":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/bundle.json","state":"https://pith.science/pith/HRMUDABC22I3EWE5LDV54JN4BN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HRMUDABC22I3EWE5LDV54JN4BN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:HRMUDABC22I3EWE5LDV54JN4BN","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":"6d31955b15293949d68b688bd8b44259b2fbfa8a52702a4801676a3eea67a5b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T10:18:06Z","title_canon_sha256":"2ef415b1c6e298ac37bc63a54c0430a55c90e16876249031a45b43ceebfbd63e"},"schema_version":"1.0","source":{"id":"2606.02030","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.02030","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"arxiv_version","alias_value":"2606.02030v1","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.02030","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_12","alias_value":"HRMUDABC22I3","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_16","alias_value":"HRMUDABC22I3EWE5","created_at":"2026-06-02T02:05:03Z"},{"alias_kind":"pith_short_8","alias_value":"HRMUDABC","created_at":"2026-06-02T02:05:03Z"}],"graph_snapshots":[{"event_id":"sha256:74779190397ec3e6b0c232b02fdcae82a6dc8f47d119cd501ce91771fde2ee35","target":"graph","created_at":"2026-06-02T02:05:03Z","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/2606.02030/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Fran\\c{c}ois Pirot, Hoang La, Hossein Zaredehabadi, Quentin Chuet, Selma Djelloul","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T10:18:06Z","title":"A Domatic Analogue of $\\chi$-Bounded Graph Classes and the Gy\\'{a}rf\\'{a}s-Sumner Conjecture"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.02030","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:63ef530e8c323859033577c8b2ec8336cc5e62b96479de18462160ea97d1240c","target":"record","created_at":"2026-06-02T02:05:03Z","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":"6d31955b15293949d68b688bd8b44259b2fbfa8a52702a4801676a3eea67a5b7","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.CO","submitted_at":"2026-06-01T10:18:06Z","title_canon_sha256":"2ef415b1c6e298ac37bc63a54c0430a55c90e16876249031a45b43ceebfbd63e"},"schema_version":"1.0","source":{"id":"2606.02030","kind":"arxiv","version":1}},"canonical_sha256":"3c59418022d691b2589d58ebde25bc0b62cdd940e2ff2f651a70217ee3c91811","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c59418022d691b2589d58ebde25bc0b62cdd940e2ff2f651a70217ee3c91811","first_computed_at":"2026-06-02T02:05:03.991093Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-02T02:05:03.991093Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"JsVyh0a4dYgyw5iWMqAqaP4AykVChamVCEZs2252WdPqL+xhY+6AP1XFmvj8jNdlVVnyWv7VnhLY7t1rYCjiDg==","signature_status":"signed_v1","signed_at":"2026-06-02T02:05:03.991502Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.02030","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63ef530e8c323859033577c8b2ec8336cc5e62b96479de18462160ea97d1240c","sha256:74779190397ec3e6b0c232b02fdcae82a6dc8f47d119cd501ce91771fde2ee35"],"state_sha256":"eeb50364e21dbc20e283610d6d6dc1362496c15b778b833eec4e768d75b61777"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tc6lNQWz93taGz9S6TkTaOVGGwyO3E4uk/G1lep+ElZCAjVMm0g4aej5XtshIZfm8JSh/fE85c7mi6GJSQhTAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-10T15:04:55.845959Z","bundle_sha256":"a49b0c26a4c63ebca1036b974e434b34f3e05cc6552f568cba7767dbeaf19ee3"}}