{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:ZWCDZXGTHN3RVBSPIHAIGSHHY3","short_pith_number":"pith:ZWCDZXGT","schema_version":"1.0","canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","source":{"kind":"arxiv","id":"1709.01245","version":2},"attestation_state":"computed","paper":{"title":"On $k$-tuple and $k$-tuple total domination numbers of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Jafari, Morteza Saghafian, Sharareh Alipour","submitted_at":"2017-09-05T06:03:30Z","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$"},"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":"1709.01245","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-09-05T06:03:30Z","cross_cats_sorted":[],"title_canon_sha256":"b66c80b7e847e17fb8f6d02eb30f3f6243a164a30cd2eaf65a05416525de3705","abstract_canon_sha256":"c9f162d041a2b403c59c5b402421dadc6fc24b1e7496cb90d07f7caa0c6b259a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:25:28.865258Z","signature_b64":"p9KNjK5dZnLxzL3gyl2+nO+qBjhXzrdIceviQPgA6ymyOWjrOb3a96TiBTVBKQZitiRVDiPZQpSWRNpOZeulAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"cd843cdcd33b771a864f41c08348e7c6ffdb8e2ecdb8c044320d85908e8459f3","last_reissued_at":"2026-05-18T00:25:28.864680Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:25:28.864680Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On $k$-tuple and $k$-tuple total domination numbers of regular graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Amir Jafari, Morteza Saghafian, Sharareh Alipour","submitted_at":"2017-09-05T06:03:30Z","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$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1709.01245","kind":"arxiv","version":2},"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":"1709.01245","created_at":"2026-05-18T00:25:28.864766+00:00"},{"alias_kind":"arxiv_version","alias_value":"1709.01245v2","created_at":"2026-05-18T00:25:28.864766+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1709.01245","created_at":"2026-05-18T00:25:28.864766+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZWCDZXGTHN3R","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZWCDZXGTHN3RVBSP","created_at":"2026-05-18T12:31:59.375834+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZWCDZXGT","created_at":"2026-05-18T12:31:59.375834+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/ZWCDZXGTHN3RVBSPIHAIGSHHY3","json":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3.json","graph_json":"https://pith.science/api/pith-number/ZWCDZXGTHN3RVBSPIHAIGSHHY3/graph.json","events_json":"https://pith.science/api/pith-number/ZWCDZXGTHN3RVBSPIHAIGSHHY3/events.json","paper":"https://pith.science/paper/ZWCDZXGT"},"agent_actions":{"view_html":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3","download_json":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3.json","view_paper":"https://pith.science/paper/ZWCDZXGT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1709.01245&json=true","fetch_graph":"https://pith.science/api/pith-number/ZWCDZXGTHN3RVBSPIHAIGSHHY3/graph.json","fetch_events":"https://pith.science/api/pith-number/ZWCDZXGTHN3RVBSPIHAIGSHHY3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/action/storage_attestation","attest_author":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/action/author_attestation","sign_citation":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/action/citation_signature","submit_replication":"https://pith.science/pith/ZWCDZXGTHN3RVBSPIHAIGSHHY3/action/replication_record"}},"created_at":"2026-05-18T00:25:28.864766+00:00","updated_at":"2026-05-18T00:25:28.864766+00:00"}