{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:F54CG3U4UGPOYRKSH4BQZQSYR5","short_pith_number":"pith:F54CG3U4","schema_version":"1.0","canonical_sha256":"2f78236e9ca19eec45523f030cc2588f79be78b6fc57ab80a52fa52eb9395082","source":{"kind":"arxiv","id":"1109.3928","version":1},"attestation_state":"computed","paper":{"title":"Total and paired domination numbers of toroidal meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu","submitted_at":"2011-09-19T02:35:41Z","abstract_excerpt":"Let $G$ be a graph without isolated vertices. The total domination number of $G$ is the minimum number of vertices that can dominate all vertices in $G$, and the paired domination number of $G$ is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching. This paper determines the total domination number and the paired domination number of the toroidal meshes, i.e., the Cartesian product of two cycles $C_n$ and $C_m$ for any $n\\ge 3$ and $m\\in\\{3,4\\}$, and gives some upper bounds for $n, m\\ge 5$."},"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":"1109.3928","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2011-09-19T02:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"74a18bdfeab06c1f9f635cdfc895f63b5f34e58923503342954831833c22845b","abstract_canon_sha256":"a94a124676a6bd31bd6ea2e6168f0dfa78c65057165bc5a7dee38a8f4e89457f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:45.570983Z","signature_b64":"UzTg2mhiKofAxo0Tlx3duUKHWPzJwrYzC1Qh9wke8AAiXt4uNhxeePnL/0OgZ2IOcWrsxPKAK+2HDK7PLH3QCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f78236e9ca19eec45523f030cc2588f79be78b6fc57ab80a52fa52eb9395082","last_reissued_at":"2026-05-18T04:12:45.570528Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:45.570528Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total and paired domination numbers of toroidal meshes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Fu-Tao Hu, Jun-Ming Xu","submitted_at":"2011-09-19T02:35:41Z","abstract_excerpt":"Let $G$ be a graph without isolated vertices. The total domination number of $G$ is the minimum number of vertices that can dominate all vertices in $G$, and the paired domination number of $G$ is the minimum number of vertices in a dominating set whose induced subgraph contains a perfect matching. This paper determines the total domination number and the paired domination number of the toroidal meshes, i.e., the Cartesian product of two cycles $C_n$ and $C_m$ for any $n\\ge 3$ and $m\\in\\{3,4\\}$, and gives some upper bounds for $n, m\\ge 5$."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.3928","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":"1109.3928","created_at":"2026-05-18T04:12:45.570597+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.3928v1","created_at":"2026-05-18T04:12:45.570597+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.3928","created_at":"2026-05-18T04:12:45.570597+00:00"},{"alias_kind":"pith_short_12","alias_value":"F54CG3U4UGPO","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_16","alias_value":"F54CG3U4UGPOYRKS","created_at":"2026-05-18T12:26:28.662955+00:00"},{"alias_kind":"pith_short_8","alias_value":"F54CG3U4","created_at":"2026-05-18T12:26:28.662955+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/F54CG3U4UGPOYRKSH4BQZQSYR5","json":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5.json","graph_json":"https://pith.science/api/pith-number/F54CG3U4UGPOYRKSH4BQZQSYR5/graph.json","events_json":"https://pith.science/api/pith-number/F54CG3U4UGPOYRKSH4BQZQSYR5/events.json","paper":"https://pith.science/paper/F54CG3U4"},"agent_actions":{"view_html":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5","download_json":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5.json","view_paper":"https://pith.science/paper/F54CG3U4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.3928&json=true","fetch_graph":"https://pith.science/api/pith-number/F54CG3U4UGPOYRKSH4BQZQSYR5/graph.json","fetch_events":"https://pith.science/api/pith-number/F54CG3U4UGPOYRKSH4BQZQSYR5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5/action/storage_attestation","attest_author":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5/action/author_attestation","sign_citation":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5/action/citation_signature","submit_replication":"https://pith.science/pith/F54CG3U4UGPOYRKSH4BQZQSYR5/action/replication_record"}},"created_at":"2026-05-18T04:12:45.570597+00:00","updated_at":"2026-05-18T04:12:45.570597+00:00"}