{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:GPBR2HDK4W5RN2NZVSQUS5LVRA","short_pith_number":"pith:GPBR2HDK","canonical_record":{"source":{"id":"1106.5591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"faa8a03a04e76d28700dfd0ab09e62e5fd85bd79013fd50b470115f4b95a42d2","abstract_canon_sha256":"62cbd2802bccce24fe5a9cda371014bdc1add24e07c8d1ae5acab0a651852275"},"schema_version":"1.0"},"canonical_sha256":"33c31d1c6ae5bb16e9b9aca1497575881586b60e86954a7bb5656fd0f49af4cf","source":{"kind":"arxiv","id":"1106.5591","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5591","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5591v1","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5591","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"GPBR2HDK4W5R","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPBR2HDK4W5RN2NZ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPBR2HDK","created_at":"2026-05-18T12:26:30Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:GPBR2HDK4W5RN2NZVSQUS5LVRA","target":"record","payload":{"canonical_record":{"source":{"id":"1106.5591","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:30:21Z","cross_cats_sorted":[],"title_canon_sha256":"faa8a03a04e76d28700dfd0ab09e62e5fd85bd79013fd50b470115f4b95a42d2","abstract_canon_sha256":"62cbd2802bccce24fe5a9cda371014bdc1add24e07c8d1ae5acab0a651852275"},"schema_version":"1.0"},"canonical_sha256":"33c31d1c6ae5bb16e9b9aca1497575881586b60e86954a7bb5656fd0f49af4cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:43:43.669823Z","signature_b64":"ZkEKEhGfOEfQUGRxjFMYuRD1k9T7EESCxnsQiVDWJ2OZw0Lkaaz0meWsfk769u3uqN9H4qz63XJWPO7kuZCCBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33c31d1c6ae5bb16e9b9aca1497575881586b60e86954a7bb5656fd0f49af4cf","last_reissued_at":"2026-05-17T23:43:43.669182Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:43:43.669182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1106.5591","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H1JPN5qrF0w27TH1MBiEcWlNRJ0ilHch16oQgoms9xXIKdQc311yVeOCeEIze33etW1aEgheS0nSE6+EM9SKCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:01:34.526076Z"},"content_sha256":"79f8abd5a053f3a7b66f95f3dc0658b6de0319fbddf6c90f28f44f7900307c73","schema_version":"1.0","event_id":"sha256:79f8abd5a053f3a7b66f95f3dc0658b6de0319fbddf6c90f28f44f7900307c73"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:GPBR2HDK4W5RN2NZVSQUS5LVRA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"k-tuple total restrained domination and k-tuple total restrained domatic in graphs","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:30:21Z","abstract_excerpt":"Let $G$ be a graph of order $n$ and size $m$ and let $k\\geq 1$ be an integer. A $k$-tuple total dominating set in $G$ is called a $k$-tuple total restrained dominating set of $G$ if each vertex $x\\in V(G)-S$ is adjacent to at least $k$ vertices of $V(G)-S$. The minimum number of vertices of a such sets in $G$ are the $k$-tuple total restrained domination number $\\gamma_{\\times k,t}^{r}(G)$ of $G$. The maximum number of classes of a partition of $V(G)$ such that its all classes are $k$-tuple total restrained dominating sets in $G$, is called the $k$-tuple total restrained domatic number of $G$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5591","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:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KO74jpONhdjEHRf0vtIBGR9WboSErDOA1JcHEwmZai9buZPO9yHftm0Gte4W6BZpKy3lemGudQGeZQgMHsV0DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-22T14:01:34.526438Z"},"content_sha256":"ca558978a5431a5c6a6b17c8623e66db69a452037ee91407c9742fec20bc998e","schema_version":"1.0","event_id":"sha256:ca558978a5431a5c6a6b17c8623e66db69a452037ee91407c9742fec20bc998e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPBR2HDK4W5RN2NZVSQUS5LVRA/bundle.json","state_url":"https://pith.science/pith/GPBR2HDK4W5RN2NZVSQUS5LVRA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPBR2HDK4W5RN2NZVSQUS5LVRA/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-22T14:01:34Z","links":{"resolver":"https://pith.science/pith/GPBR2HDK4W5RN2NZVSQUS5LVRA","bundle":"https://pith.science/pith/GPBR2HDK4W5RN2NZVSQUS5LVRA/bundle.json","state":"https://pith.science/pith/GPBR2HDK4W5RN2NZVSQUS5LVRA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPBR2HDK4W5RN2NZVSQUS5LVRA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:GPBR2HDK4W5RN2NZVSQUS5LVRA","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":"62cbd2802bccce24fe5a9cda371014bdc1add24e07c8d1ae5acab0a651852275","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:30:21Z","title_canon_sha256":"faa8a03a04e76d28700dfd0ab09e62e5fd85bd79013fd50b470115f4b95a42d2"},"schema_version":"1.0","source":{"id":"1106.5591","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1106.5591","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"arxiv_version","alias_value":"1106.5591v1","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1106.5591","created_at":"2026-05-17T23:43:43Z"},{"alias_kind":"pith_short_12","alias_value":"GPBR2HDK4W5R","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_16","alias_value":"GPBR2HDK4W5RN2NZ","created_at":"2026-05-18T12:26:30Z"},{"alias_kind":"pith_short_8","alias_value":"GPBR2HDK","created_at":"2026-05-18T12:26:30Z"}],"graph_snapshots":[{"event_id":"sha256:ca558978a5431a5c6a6b17c8623e66db69a452037ee91407c9742fec20bc998e","target":"graph","created_at":"2026-05-17T23:43:43Z","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":"Let $G$ be a graph of order $n$ and size $m$ and let $k\\geq 1$ be an integer. A $k$-tuple total dominating set in $G$ is called a $k$-tuple total restrained dominating set of $G$ if each vertex $x\\in V(G)-S$ is adjacent to at least $k$ vertices of $V(G)-S$. The minimum number of vertices of a such sets in $G$ are the $k$-tuple total restrained domination number $\\gamma_{\\times k,t}^{r}(G)$ of $G$. The maximum number of classes of a partition of $V(G)$ such that its all classes are $k$-tuple total restrained dominating sets in $G$, is called the $k$-tuple total restrained domatic number of $G$.","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:30:21Z","title":"k-tuple total restrained domination and k-tuple total restrained domatic in graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1106.5591","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:79f8abd5a053f3a7b66f95f3dc0658b6de0319fbddf6c90f28f44f7900307c73","target":"record","created_at":"2026-05-17T23:43:43Z","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":"62cbd2802bccce24fe5a9cda371014bdc1add24e07c8d1ae5acab0a651852275","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-06-28T08:30:21Z","title_canon_sha256":"faa8a03a04e76d28700dfd0ab09e62e5fd85bd79013fd50b470115f4b95a42d2"},"schema_version":"1.0","source":{"id":"1106.5591","kind":"arxiv","version":1}},"canonical_sha256":"33c31d1c6ae5bb16e9b9aca1497575881586b60e86954a7bb5656fd0f49af4cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33c31d1c6ae5bb16e9b9aca1497575881586b60e86954a7bb5656fd0f49af4cf","first_computed_at":"2026-05-17T23:43:43.669182Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:43:43.669182Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZkEKEhGfOEfQUGRxjFMYuRD1k9T7EESCxnsQiVDWJ2OZw0Lkaaz0meWsfk769u3uqN9H4qz63XJWPO7kuZCCBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:43:43.669823Z","signed_message":"canonical_sha256_bytes"},"source_id":"1106.5591","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79f8abd5a053f3a7b66f95f3dc0658b6de0319fbddf6c90f28f44f7900307c73","sha256:ca558978a5431a5c6a6b17c8623e66db69a452037ee91407c9742fec20bc998e"],"state_sha256":"b71f50499f7b02634152f2313fafdc8da8e05e670c028b69ca05a1668f28ecaa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lt7G1FynUvZUG0c4ZCjzvyCWFkZOc7qdllk0p0RmgcBO7qPRoBgeouTslzobCFPn9hw3DjYK1fekdY5mYCljAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-22T14:01:34.528294Z","bundle_sha256":"1c6ee7d3ba87c14a4502124cbe05db61c661bcfb7e627d38896dbe790d72fd29"}}