{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:6VHS2VS3IARTML2RYJIQPIOH35","short_pith_number":"pith:6VHS2VS3","schema_version":"1.0","canonical_sha256":"f54f2d565b4023362f51c25107a1c7df68a6835e4b79c338f209d359274c17fa","source":{"kind":"arxiv","id":"1807.08104","version":1},"attestation_state":"computed","paper":{"title":"$3$-tuple total domination number of rook's graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli","submitted_at":"2018-07-21T07:59:37Z","abstract_excerpt":"A $k$-tuple total dominating set ($k$TDS) of a graph $G$ is a set $S$ of vertices in which every vertex in $G$ is adjacent to at least $k$ vertices in $S$. The minimum size of a $k$TDS is called the $k$-tuple total dominating number and it is denoted by $\\gamma_{\\times k,t}(G)$. We give a constructive proof of a general formula for $\\gamma_{\\times 3, t}(K_n \\Box K_m)$."},"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":"1807.08104","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-07-21T07:59:37Z","cross_cats_sorted":[],"title_canon_sha256":"aa6a73b3b16313aa96f1adb835562a1a7bf95bbe2810ecbc6ce9b7ce05c19573","abstract_canon_sha256":"fcbbc6c497d4d959fb2862d2a96816e546ddc7e704aae0d076ed8f5471ff4c9d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:09.298839Z","signature_b64":"E1kQDAXUuW3FvHblMCoqSZ+WGv/e/JcEXLD4ISxBRfXGjlSwiruOHRp2Cq+qVr9NA9j3i4gInKpmW5SXM19wDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f54f2d565b4023362f51c25107a1c7df68a6835e4b79c338f209d359274c17fa","last_reissued_at":"2026-05-18T00:10:09.298157Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:09.298157Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$3$-tuple total domination number of rook's graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Behnaz Pahlavsay, Elisa Palezzato, Michele Torielli","submitted_at":"2018-07-21T07:59:37Z","abstract_excerpt":"A $k$-tuple total dominating set ($k$TDS) of a graph $G$ is a set $S$ of vertices in which every vertex in $G$ is adjacent to at least $k$ vertices in $S$. The minimum size of a $k$TDS is called the $k$-tuple total dominating number and it is denoted by $\\gamma_{\\times k,t}(G)$. We give a constructive proof of a general formula for $\\gamma_{\\times 3, t}(K_n \\Box K_m)$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.08104","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":"1807.08104","created_at":"2026-05-18T00:10:09.298254+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.08104v1","created_at":"2026-05-18T00:10:09.298254+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.08104","created_at":"2026-05-18T00:10:09.298254+00:00"},{"alias_kind":"pith_short_12","alias_value":"6VHS2VS3IART","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_16","alias_value":"6VHS2VS3IARTML2R","created_at":"2026-05-18T12:32:11.075285+00:00"},{"alias_kind":"pith_short_8","alias_value":"6VHS2VS3","created_at":"2026-05-18T12:32:11.075285+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/6VHS2VS3IARTML2RYJIQPIOH35","json":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35.json","graph_json":"https://pith.science/api/pith-number/6VHS2VS3IARTML2RYJIQPIOH35/graph.json","events_json":"https://pith.science/api/pith-number/6VHS2VS3IARTML2RYJIQPIOH35/events.json","paper":"https://pith.science/paper/6VHS2VS3"},"agent_actions":{"view_html":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35","download_json":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35.json","view_paper":"https://pith.science/paper/6VHS2VS3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.08104&json=true","fetch_graph":"https://pith.science/api/pith-number/6VHS2VS3IARTML2RYJIQPIOH35/graph.json","fetch_events":"https://pith.science/api/pith-number/6VHS2VS3IARTML2RYJIQPIOH35/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35/action/timestamp_anchor","attest_storage":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35/action/storage_attestation","attest_author":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35/action/author_attestation","sign_citation":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35/action/citation_signature","submit_replication":"https://pith.science/pith/6VHS2VS3IARTML2RYJIQPIOH35/action/replication_record"}},"created_at":"2026-05-18T00:10:09.298254+00:00","updated_at":"2026-05-18T00:10:09.298254+00:00"}