{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:D3OBIFGIAMDWS44NDAC5MYGWBN","short_pith_number":"pith:D3OBIFGI","schema_version":"1.0","canonical_sha256":"1edc1414c8030769738d1805d660d60b7a61e66752a4f7de32685c364f10a5a5","source":{"kind":"arxiv","id":"1804.02532","version":1},"attestation_state":"computed","paper":{"title":"Total domination in cubic Kn\\\"odel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doost Ali Mojdeh, Esmaeil Nazari, Nader Jafari Rad, Seyed Reza Musawi","submitted_at":"2018-04-07T09:11:24Z","abstract_excerpt":"A subset $D$ of vertices of a graph $G$ is a \\textit{dominating set} if for each $u\\in V(G)\\setminus D$, $u$ is adjacent to some vertex $v\\in D$. The \\textit{dominating number}, $\\gamma(G)$ of $G$, is the minimum cardinality of a dominating set of $G$. A set $D\\subseteq V(G)$ is a \\textit{total dominating set} if for each $u\\in V(G)$, $u$ is adjacent to some vertex $v\\in D$. the The \\textit{total dominating number}, $\\gamma_t(G)$ of $G$, is the minimum cardinality of a total dominating set of $G$. For an even integer $n\\ge2$ and $1\\le\\Delta\\le\\lfloor\\log_2n\\rfloor$, a \\textit{Kn\\\"odel graph} $"},"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":"1804.02532","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-04-07T09:11:24Z","cross_cats_sorted":[],"title_canon_sha256":"c58f36ff911e85a57721d2c97c49ce71c1d2e28f3cb6b3aed3dfc9224b17c942","abstract_canon_sha256":"322a314f5c9a75aa24bdece6cbc4112fa5490d110f7e6179a2a3ebba32d8ec49"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:59.188358Z","signature_b64":"ppBoJs8QkDaAEESZiZzD5mTioJUiBUndO6JfO+VPNnUtWH252+6aVC9vAZGIjxs6TuzCvlNQIRs0Ir7dzoEQAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1edc1414c8030769738d1805d660d60b7a61e66752a4f7de32685c364f10a5a5","last_reissued_at":"2026-05-18T00:18:59.187942Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:59.187942Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total domination in cubic Kn\\\"odel graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Doost Ali Mojdeh, Esmaeil Nazari, Nader Jafari Rad, Seyed Reza Musawi","submitted_at":"2018-04-07T09:11:24Z","abstract_excerpt":"A subset $D$ of vertices of a graph $G$ is a \\textit{dominating set} if for each $u\\in V(G)\\setminus D$, $u$ is adjacent to some vertex $v\\in D$. The \\textit{dominating number}, $\\gamma(G)$ of $G$, is the minimum cardinality of a dominating set of $G$. A set $D\\subseteq V(G)$ is a \\textit{total dominating set} if for each $u\\in V(G)$, $u$ is adjacent to some vertex $v\\in D$. the The \\textit{total dominating number}, $\\gamma_t(G)$ of $G$, is the minimum cardinality of a total dominating set of $G$. For an even integer $n\\ge2$ and $1\\le\\Delta\\le\\lfloor\\log_2n\\rfloor$, a \\textit{Kn\\\"odel graph} $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.02532","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":"1804.02532","created_at":"2026-05-18T00:18:59.188009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.02532v1","created_at":"2026-05-18T00:18:59.188009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.02532","created_at":"2026-05-18T00:18:59.188009+00:00"},{"alias_kind":"pith_short_12","alias_value":"D3OBIFGIAMDW","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"D3OBIFGIAMDWS44N","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"D3OBIFGI","created_at":"2026-05-18T12:32:19.392346+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2004.05435","citing_title":"Diameter of General Kn\\\"odel Graphs","ref_index":12,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN","json":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN.json","graph_json":"https://pith.science/api/pith-number/D3OBIFGIAMDWS44NDAC5MYGWBN/graph.json","events_json":"https://pith.science/api/pith-number/D3OBIFGIAMDWS44NDAC5MYGWBN/events.json","paper":"https://pith.science/paper/D3OBIFGI"},"agent_actions":{"view_html":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN","download_json":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN.json","view_paper":"https://pith.science/paper/D3OBIFGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.02532&json=true","fetch_graph":"https://pith.science/api/pith-number/D3OBIFGIAMDWS44NDAC5MYGWBN/graph.json","fetch_events":"https://pith.science/api/pith-number/D3OBIFGIAMDWS44NDAC5MYGWBN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN/action/storage_attestation","attest_author":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN/action/author_attestation","sign_citation":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN/action/citation_signature","submit_replication":"https://pith.science/pith/D3OBIFGIAMDWS44NDAC5MYGWBN/action/replication_record"}},"created_at":"2026-05-18T00:18:59.188009+00:00","updated_at":"2026-05-18T00:18:59.188009+00:00"}