{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:ZWCDZXGTHN3RVBSPIHAIGSHHY3","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":"c9f162d041a2b403c59c5b402421dadc6fc24b1e7496cb90d07f7caa0c6b259a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","title_canon_sha256":"b66c80b7e847e17fb8f6d02eb30f3f6243a164a30cd2eaf65a05416525de3705"},"schema_version":"1.0","source":{"id":"1709.01245","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1709.01245","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"arxiv_version","alias_value":"1709.01245v2","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01245","created_at":"2026-05-18T00:25:28Z"},{"alias_kind":"pith_short_12","alias_value":"ZWCDZXGTHN3R","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_16","alias_value":"ZWCDZXGTHN3RVBSP","created_at":"2026-05-18T12:31:59Z"},{"alias_kind":"pith_short_8","alias_value":"ZWCDZXGT","created_at":"2026-05-18T12:31:59Z"}],"graph_snapshots":[{"event_id":"sha256:158c2e0cbad06e1191f4ee6002b167e94166a64280feb32440006affd76eaf38","target":"graph","created_at":"2026-05-18T00:25:28Z","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 connected graph of order $n$, whose minimum vertex degree is at least $k$. A subset $S$ of vertices in $G$ is a $k$-tuple total dominating set if every vertex of $G$ is adjacent to at least $k$ vertices in $S$. The minimum cardinality of a $k$-tuple total dominating set of $G$ is the $k$-tuple total domination number of $G$, denoted by $\\gamma_{\\times k,t}(G)$. Henning and Yeo in \\cite{hen} proved that if $G$ is a cubic graph different from the Heawood graph, $\\gamma_{\\times 2, t}(G) \\leq \\frac{5}{6}n$, and this bound is sharp. Similarly, a $k$-tuple dominating set is a subset $S$","authors_text":"Amir Jafari, Morteza Saghafian, Sharareh Alipour","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","title":"On $k$-tuple and $k$-tuple total domination numbers of regular graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01245","kind":"arxiv","version":2},"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:390ae278abcf1c284d7c84dc7573c434fc2dddc827b73213451bc821ebbe1c3c","target":"record","created_at":"2026-05-18T00:25:28Z","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":"c9f162d041a2b403c59c5b402421dadc6fc24b1e7496cb90d07f7caa0c6b259a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","title_canon_sha256":"b66c80b7e847e17fb8f6d02eb30f3f6243a164a30cd2eaf65a05416525de3705"},"schema_version":"1.0","source":{"id":"1709.01245","kind":"arxiv","version":2}},"canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","first_computed_at":"2026-05-18T00:25:28.864680Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:25:28.864680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p9KNjK5dZnLxzL3gyl2+nO+qBjhXzrdIceviQPgA6ymyOWjrOb3a96TiBTVBKQZitiRVDiPZQpSWRNpOZeulAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:25:28.865258Z","signed_message":"canonical_sha256_bytes"},"source_id":"1709.01245","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:390ae278abcf1c284d7c84dc7573c434fc2dddc827b73213451bc821ebbe1c3c","sha256:158c2e0cbad06e1191f4ee6002b167e94166a64280feb32440006affd76eaf38"],"state_sha256":"c50745df48745d5c17ef947898c2d35db52a07b2773fae35cd6ba3fbc07ca4bd"}