{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:3GYK7NFUYMCTYI2GVP5ZIGXNBG","short_pith_number":"pith:3GYK7NFU","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"},"canonical_sha256":"d9b0afb4b4c3053c2346abfb941aed09ab345a6a1934531884ebc75a8b7ab9ef","source":{"kind":"arxiv","id":"1106.5589","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5589","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5589v1","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5589","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"3GYK7NFUYMCT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3GYK7NFUYMCTYI2G","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3GYK7NFU","created_at":"2026-05-18T12:26:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:3GYK7NFUYMCTYI2GVP5ZIGXNBG","target":"record","payload":{"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"},"canonical_sha256":"d9b0afb4b4c3053c2346abfb941aed09ab345a6a1934531884ebc75a8b7ab9ef","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"},"source_kind":"arxiv","source_id":"1106.5589","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-05-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bnBplTwVcBchj3dDiQ/Fpyt29yOC53QQF/5hovYS8l1IS+w6NhPZLZbdBap8UvoopZEXzsFV5exa9bIlvDFLBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:50:56.497667Z"},"content_sha256":"427e6c38ecc1cc802899f5744bf3abdb63b0793a598847f751b79cd7a9d9dfe4","schema_version":"1.0","event_id":"sha256:427e6c38ecc1cc802899f5744bf3abdb63b0793a598847f751b79cd7a9d9dfe4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:3GYK7NFUYMCTYI2GVP5ZIGXNBG","target":"graph","payload":{"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"},"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-05-17T23:43:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cZipQ5MT7NPB6yw7/C9h2uBwkpWcWK2HysbS8wAub2dtzYPXWBuWhJvFREljm6EzUuDWGUDHulXpqBuJMN+1BQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T13:50:56.498024Z"},"content_sha256":"0ac7f5400efa2b688498f6a991a41e8979788f229db84f5dbaa8530c94f1dca2","schema_version":"1.0","event_id":"sha256:0ac7f5400efa2b688498f6a991a41e8979788f229db84f5dbaa8530c94f1dca2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/bundle.json","state_url":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/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-22T13:50:56Z","links":{"resolver":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG","bundle":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/bundle.json","state":"https://pith.science/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3GYK7NFUYMCTYI2GVP5ZIGXNBG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:3GYK7NFUYMCTYI2GVP5ZIGXNBG","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":"da1e406af1cbda7835d438e5fb08067e54b7eaec88a1ee7957c5bee821c54dcd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:24:04Z","title_canon_sha256":"0d5541f73848b1bd52d62698551de89b7ba251f4f9b887719c1352f1a87e0a83"},"schema_version":"1.0","source":{"id":"1106.5589","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5589","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5589v1","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5589","created_at":"2026-05-17T23:43:54Z"},{"alias_kind":"pith_short_12","alias_value":"3GYK7NFUYMCT","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_16","alias_value":"3GYK7NFUYMCTYI2G","created_at":"2026-05-18T12:26:18Z"},{"alias_kind":"pith_short_8","alias_value":"3GYK7NFU","created_at":"2026-05-18T12:26:18Z"}],"graph_snapshots":[{"event_id":"sha256:0ac7f5400efa2b688498f6a991a41e8979788f229db84f5dbaa8530c94f1dca2","target":"graph","created_at":"2026-05-17T23:43:54Z","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"},"paper":{"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","authors_text":"Adel P. Kazemi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:24:04Z","title":"The k-Tuple Domatic Number of a Graph"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5589","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:427e6c38ecc1cc802899f5744bf3abdb63b0793a598847f751b79cd7a9d9dfe4","target":"record","created_at":"2026-05-17T23:43:54Z","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":"da1e406af1cbda7835d438e5fb08067e54b7eaec88a1ee7957c5bee821c54dcd","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:24:04Z","title_canon_sha256":"0d5541f73848b1bd52d62698551de89b7ba251f4f9b887719c1352f1a87e0a83"},"schema_version":"1.0","source":{"id":"1106.5589","kind":"arxiv","version":1}},"canonical_sha256":"d9b0afb4b4c3053c2346abfb941aed09ab345a6a1934531884ebc75a8b7ab9ef","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d9b0afb4b4c3053c2346abfb941aed09ab345a6a1934531884ebc75a8b7ab9ef","first_computed_at":"2026-05-17T23:43:54.523860Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:54.523860Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OFujxdRgShnkrP/6Nhqwx3o1WCrV+wBmE/DT+k1hcxJ5aSLEAIYfZ7W9OXlU+duvMxJnUze8g9kBQ16SqkjdDw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:54.524460Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5589","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:427e6c38ecc1cc802899f5744bf3abdb63b0793a598847f751b79cd7a9d9dfe4","sha256:0ac7f5400efa2b688498f6a991a41e8979788f229db84f5dbaa8530c94f1dca2"],"state_sha256":"857070953c69b856ff8f4be2c3bfeaebaa96f1dbb25f97fdb6b9d1a5a2afcb7a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u3/B/7qa2mVVxe+KvBGirSM3ZA63sL4Y+FgknHfI/SHfNHfBo5bJeROTDAk5S2w2LTzp6mf1NRTD1Nr4OjfNDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T13:50:56.500056Z","bundle_sha256":"5956893d98fa1f51f472ed1f2e023b8343b2d097b3c79c2e2eb422c92963d361"}}