{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:GXPMDTA3QI4ETSPUKXUVT5QOVN","short_pith_number":"pith:GXPMDTA3","schema_version":"1.0","canonical_sha256":"35dec1cc1b823849c9f455e959f60eab5a4c9defc3c2214895f1e67234d078f7","source":{"kind":"arxiv","id":"1204.3970","version":1},"attestation_state":"computed","paper":{"title":"Total Domination Value in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang","submitted_at":"2012-04-18T04:12:39Z","abstract_excerpt":"A set $D \\subseteq V(G)$ is a \\emph{total dominating set} of $G$ if for every vertex $v \\in V(G)$ there exists a vertex $u \\in D$ such that $u$ and $v$ are adjacent. A total dominating set of $G$ of minimum cardinality is called a $\\gamma_t(G)$-set. For each vertex $v \\in V(G)$, we define the \\emph{total domination value} of $v$, $TDV(v)$, to be the number of $\\gamma_t(G)$-sets to which $v$belongs. This definition gives rise to \\emph{a local study of total domination} in graphs. In this paper, we study some basic properties of the $TDV$ function; also, we derive explicit formulas for the $TDV$"},"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":"1204.3970","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-18T04:12:39Z","cross_cats_sorted":[],"title_canon_sha256":"f296f66fa2779505dd2e5d065aff2902bc082ed51e7e476b3a0d5e4f9a6041b2","abstract_canon_sha256":"4288750cb9831b354edce23ea0a468d0657a80f604765d191e1392b9b9439e20"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:26:53.181335Z","signature_b64":"VECe4E7zuZPmED6ebjKWa2BtHpYUfS7cGZYu2Lu9D2lfNS+n2/Uccx/crj+i31KQnhk+P6f4PRDaAQ23rbAUCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"35dec1cc1b823849c9f455e959f60eab5a4c9defc3c2214895f1e67234d078f7","last_reissued_at":"2026-05-18T02:26:53.180949Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:26:53.180949Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total Domination Value in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Cong X. Kang","submitted_at":"2012-04-18T04:12:39Z","abstract_excerpt":"A set $D \\subseteq V(G)$ is a \\emph{total dominating set} of $G$ if for every vertex $v \\in V(G)$ there exists a vertex $u \\in D$ such that $u$ and $v$ are adjacent. A total dominating set of $G$ of minimum cardinality is called a $\\gamma_t(G)$-set. For each vertex $v \\in V(G)$, we define the \\emph{total domination value} of $v$, $TDV(v)$, to be the number of $\\gamma_t(G)$-sets to which $v$belongs. This definition gives rise to \\emph{a local study of total domination} in graphs. In this paper, we study some basic properties of the $TDV$ function; also, we derive explicit formulas for the $TDV$"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.3970","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":"1204.3970","created_at":"2026-05-18T02:26:53.181009+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.3970v1","created_at":"2026-05-18T02:26:53.181009+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.3970","created_at":"2026-05-18T02:26:53.181009+00:00"},{"alias_kind":"pith_short_12","alias_value":"GXPMDTA3QI4E","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_16","alias_value":"GXPMDTA3QI4ETSPU","created_at":"2026-05-18T12:27:06.952714+00:00"},{"alias_kind":"pith_short_8","alias_value":"GXPMDTA3","created_at":"2026-05-18T12:27:06.952714+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/GXPMDTA3QI4ETSPUKXUVT5QOVN","json":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN.json","graph_json":"https://pith.science/api/pith-number/GXPMDTA3QI4ETSPUKXUVT5QOVN/graph.json","events_json":"https://pith.science/api/pith-number/GXPMDTA3QI4ETSPUKXUVT5QOVN/events.json","paper":"https://pith.science/paper/GXPMDTA3"},"agent_actions":{"view_html":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN","download_json":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN.json","view_paper":"https://pith.science/paper/GXPMDTA3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.3970&json=true","fetch_graph":"https://pith.science/api/pith-number/GXPMDTA3QI4ETSPUKXUVT5QOVN/graph.json","fetch_events":"https://pith.science/api/pith-number/GXPMDTA3QI4ETSPUKXUVT5QOVN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN/action/storage_attestation","attest_author":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN/action/author_attestation","sign_citation":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN/action/citation_signature","submit_replication":"https://pith.science/pith/GXPMDTA3QI4ETSPUKXUVT5QOVN/action/replication_record"}},"created_at":"2026-05-18T02:26:53.181009+00:00","updated_at":"2026-05-18T02:26:53.181009+00:00"}