{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:3GYK7NFUYMCTYI2GVP5ZIGXNBG","short_pith_number":"pith:3GYK7NFU","schema_version":"1.0","canonical_sha256":"d9b0afb4b4c3053c2346abfb941aed09ab345a6a1934531884ebc75a8b7ab9ef","source":{"kind":"arxiv","id":"1106.5589","version":1},"attestation_state":"computed","paper":{"title":"The k-Tuple Domatic Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi","submitted_at":"2011-06-28T08:24:04Z","abstract_excerpt":"For every positive integer $k$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple dominating set of $G$ if every vertex of $V-S$ is adjacent to least $k$ vertices and every vertex of $S$ is adjacent to least $k-1$ vertices in $S$. The minimum cardinality of a $k$-tuple dominating set of $G$ is the $k$-tuple domination number of $G$. When $k=1$, a $k$-tuple domination number is the well-studied domination number. We define the $k$-tuple domatic number of $G$ as the largest number of sets in a partition of $V$ into $k$-tuple dominating sets. Recall that when $k=1$, a $k$-tuple domatic nu"},"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":"1106.5589","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:24:04Z","cross_cats_sorted":[],"title_canon_sha256":"0d5541f73848b1bd52d62698551de89b7ba251f4f9b887719c1352f1a87e0a83","abstract_canon_sha256":"da1e406af1cbda7835d438e5fb08067e54b7eaec88a1ee7957c5bee821c54dcd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:54.524460Z","signature_b64":"OFujxdRgShnkrP/6Nhqwx3o1WCrV+wBmE/DT+k1hcxJ5aSLEAIYfZ7W9OXlU+duvMxJnUze8g9kBQ16SqkjdDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d9b0afb4b4c3053c2346abfb941aed09ab345a6a1934531884ebc75a8b7ab9ef","last_reissued_at":"2026-05-17T23:43:54.523860Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:54.523860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The k-Tuple Domatic Number of a Graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi","submitted_at":"2011-06-28T08:24:04Z","abstract_excerpt":"For every positive integer $k$, a set $S$ of vertices in a graph $G=(V,E)$ is a $k$-tuple dominating set of $G$ if every vertex of $V-S$ is adjacent to least $k$ vertices and every vertex of $S$ is adjacent to least $k-1$ vertices in $S$. The minimum cardinality of a $k$-tuple dominating set of $G$ is the $k$-tuple domination number of $G$. When $k=1$, a $k$-tuple domination number is the well-studied domination number. We define the $k$-tuple domatic number of $G$ as the largest number of sets in a partition of $V$ into $k$-tuple dominating sets. Recall that when $k=1$, a $k$-tuple domatic nu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5589","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":""},"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":"1106.5589","created_at":"2026-05-17T23:43:54.523960+00:00"},{"alias_kind":"arxiv_version","alias_value":"1106.5589v1","created_at":"2026-05-17T23:43:54.523960+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5589","created_at":"2026-05-17T23:43:54.523960+00:00"},{"alias_kind":"pith_short_12","alias_value":"3GYK7NFUYMCT","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_16","alias_value":"3GYK7NFUYMCTYI2G","created_at":"2026-05-18T12:26:18.847500+00:00"},{"alias_kind":"pith_short_8","alias_value":"3GYK7NFU","created_at":"2026-05-18T12:26:18.847500+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/3GYK7NFUYMCTYI2GVP5ZIGXNBG","json":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG.json","graph_json":"https://pith.science/api/pith-number/3GYK7NFUYMCTYI2GVP5ZIGXNBG/graph.json","events_json":"https://pith.science/api/pith-number/3GYK7NFUYMCTYI2GVP5ZIGXNBG/events.json","paper":"https://pith.science/paper/3GYK7NFU"},"agent_actions":{"view_html":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG","download_json":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG.json","view_paper":"https://pith.science/paper/3GYK7NFU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1106.5589&json=true","fetch_graph":"https://pith.science/api/pith-number/3GYK7NFUYMCTYI2GVP5ZIGXNBG/graph.json","fetch_events":"https://pith.science/api/pith-number/3GYK7NFUYMCTYI2GVP5ZIGXNBG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/action/storage_attestation","attest_author":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/action/author_attestation","sign_citation":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/action/citation_signature","submit_replication":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/action/replication_record"}},"created_at":"2026-05-17T23:43:54.523960+00:00","updated_at":"2026-05-17T23:43:54.523960+00:00"}