{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:GQE2FW32YHHUGWLANCAM7CE7IM","short_pith_number":"pith:GQE2FW32","schema_version":"1.0","canonical_sha256":"3409a2db7ac1cf4359606880cf889f431168fe4a9c405e5d389b8e93e285a68a","source":{"kind":"arxiv","id":"1410.0187","version":1},"attestation_state":"computed","paper":{"title":"Disjunctive Total Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Viroshan Naicker","submitted_at":"2014-10-01T11:48:29Z","abstract_excerpt":"Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\\gamma_t(G)$. A set $S$ of vertices in $G$ is a disjunctive total dominating set of $G$ if every vertex is adjacent to a vertex of $S$ or has at least two vertices in $S$ at distance2 from it. The disjunctive total domination number, $\\gamma^d_t(G)$, is the minimum cardinality of such a set. We observe that $\\gamma^d_t(G) \\le \\gamma_t(G)$. We prove that if $G$ is a connected graph of order$n \\ge 8$, then $"},"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":"1410.0187","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2014-10-01T11:48:29Z","cross_cats_sorted":[],"title_canon_sha256":"304e0252237d5ff78253934398eb4244a3720525379ae69ba9d60fe2cda6190e","abstract_canon_sha256":"684e13e9b19d3fcab9429b02af94f23522e5fe9e24e17cb3201577a57162b7a3"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:41:17.829966Z","signature_b64":"tVnTAMjgi0FjaUGuw3kS9h8+mAs9cxNZLHLwkaWrKMoCiqkzlfgIW/JPYdb7c9bxAO+fRZI/9yMVFWUWOQ35Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3409a2db7ac1cf4359606880cf889f431168fe4a9c405e5d389b8e93e285a68a","last_reissued_at":"2026-05-18T02:41:17.829474Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:41:17.829474Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjunctive Total Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Viroshan Naicker","submitted_at":"2014-10-01T11:48:29Z","abstract_excerpt":"Let $G$ be a graph with no isolated vertex. In this paper, we study a parameter that is a relaxation of arguably the most important domination parameter, namely the total domination number, $\\gamma_t(G)$. A set $S$ of vertices in $G$ is a disjunctive total dominating set of $G$ if every vertex is adjacent to a vertex of $S$ or has at least two vertices in $S$ at distance2 from it. The disjunctive total domination number, $\\gamma^d_t(G)$, is the minimum cardinality of such a set. We observe that $\\gamma^d_t(G) \\le \\gamma_t(G)$. We prove that if $G$ is a connected graph of order$n \\ge 8$, then $"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1410.0187","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":"1410.0187","created_at":"2026-05-18T02:41:17.829553+00:00"},{"alias_kind":"arxiv_version","alias_value":"1410.0187v1","created_at":"2026-05-18T02:41:17.829553+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1410.0187","created_at":"2026-05-18T02:41:17.829553+00:00"},{"alias_kind":"pith_short_12","alias_value":"GQE2FW32YHHU","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"GQE2FW32YHHUGWLA","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"GQE2FW32","created_at":"2026-05-18T12:28:30.664211+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/GQE2FW32YHHUGWLANCAM7CE7IM","json":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM.json","graph_json":"https://pith.science/api/pith-number/GQE2FW32YHHUGWLANCAM7CE7IM/graph.json","events_json":"https://pith.science/api/pith-number/GQE2FW32YHHUGWLANCAM7CE7IM/events.json","paper":"https://pith.science/paper/GQE2FW32"},"agent_actions":{"view_html":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM","download_json":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM.json","view_paper":"https://pith.science/paper/GQE2FW32","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1410.0187&json=true","fetch_graph":"https://pith.science/api/pith-number/GQE2FW32YHHUGWLANCAM7CE7IM/graph.json","fetch_events":"https://pith.science/api/pith-number/GQE2FW32YHHUGWLANCAM7CE7IM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/action/storage_attestation","attest_author":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/action/author_attestation","sign_citation":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/action/citation_signature","submit_replication":"https://pith.science/pith/GQE2FW32YHHUGWLANCAM7CE7IM/action/replication_record"}},"created_at":"2026-05-18T02:41:17.829553+00:00","updated_at":"2026-05-18T02:41:17.829553+00:00"}