{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:VAEWESWE7E4HR2K7MK5HTP26CY","short_pith_number":"pith:VAEWESWE","schema_version":"1.0","canonical_sha256":"a809624ac4f93878e95f62ba79bf5e1623e0e991a5b487737f9d53f23bedf181","source":{"kind":"arxiv","id":"1607.00400","version":1},"attestation_state":"computed","paper":{"title":"Total domination polynomials of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bing Wei, Chunxiang Wang, Erfang Shan, Jiuhua Hu, Shaohui Wang","submitted_at":"2016-07-01T20:28:10Z","abstract_excerpt":"Given a graph $G$, a total dominating set $D_t$ is a vertex set that every vertex of $G$ is adjacent to some vertices of $D_t$ and let $d_t(G,i)$ be the number of all total dominating sets with size $i$. The total domination polynomial, defined as $D_t(G,x)=\\sum\\limits_{i=1}^{| V(G)|} d_t(G,i)x^i$, recently has been one of the considerable extended research in the field of domination theory. In this paper, we obtain the vertex-reduction and edge-reduction formulas of total domination polynomials. As consequences, we give the total domination polynomials for paths and cycles. Additionally, we d"},"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":"1607.00400","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-07-01T20:28:10Z","cross_cats_sorted":[],"title_canon_sha256":"32d4cdd8000a92736990a3cc97536b5f3437a14abce87c3ceb360d6fc6678464","abstract_canon_sha256":"cd9558b72f97a88fc831b34c8f5a54d4d79baa507709d4848edf50707937e67e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:11:37.175521Z","signature_b64":"9GFlkgk3+x0VyejyA9nCsz/92bRHpUlZ7bMlCyGKX5temBjT+5Xt9NF9ekbxxdpleRnhGXlnm7qRWdJiWjnWDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a809624ac4f93878e95f62ba79bf5e1623e0e991a5b487737f9d53f23bedf181","last_reissued_at":"2026-05-18T01:11:37.175143Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:11:37.175143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total domination polynomials of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Bing Wei, Chunxiang Wang, Erfang Shan, Jiuhua Hu, Shaohui Wang","submitted_at":"2016-07-01T20:28:10Z","abstract_excerpt":"Given a graph $G$, a total dominating set $D_t$ is a vertex set that every vertex of $G$ is adjacent to some vertices of $D_t$ and let $d_t(G,i)$ be the number of all total dominating sets with size $i$. The total domination polynomial, defined as $D_t(G,x)=\\sum\\limits_{i=1}^{| V(G)|} d_t(G,i)x^i$, recently has been one of the considerable extended research in the field of domination theory. In this paper, we obtain the vertex-reduction and edge-reduction formulas of total domination polynomials. As consequences, we give the total domination polynomials for paths and cycles. Additionally, we d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1607.00400","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":"1607.00400","created_at":"2026-05-18T01:11:37.175211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1607.00400v1","created_at":"2026-05-18T01:11:37.175211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1607.00400","created_at":"2026-05-18T01:11:37.175211+00:00"},{"alias_kind":"pith_short_12","alias_value":"VAEWESWE7E4H","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_16","alias_value":"VAEWESWE7E4HR2K7","created_at":"2026-05-18T12:30:48.956258+00:00"},{"alias_kind":"pith_short_8","alias_value":"VAEWESWE","created_at":"2026-05-18T12:30:48.956258+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/VAEWESWE7E4HR2K7MK5HTP26CY","json":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY.json","graph_json":"https://pith.science/api/pith-number/VAEWESWE7E4HR2K7MK5HTP26CY/graph.json","events_json":"https://pith.science/api/pith-number/VAEWESWE7E4HR2K7MK5HTP26CY/events.json","paper":"https://pith.science/paper/VAEWESWE"},"agent_actions":{"view_html":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY","download_json":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY.json","view_paper":"https://pith.science/paper/VAEWESWE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1607.00400&json=true","fetch_graph":"https://pith.science/api/pith-number/VAEWESWE7E4HR2K7MK5HTP26CY/graph.json","fetch_events":"https://pith.science/api/pith-number/VAEWESWE7E4HR2K7MK5HTP26CY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY/action/storage_attestation","attest_author":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY/action/author_attestation","sign_citation":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY/action/citation_signature","submit_replication":"https://pith.science/pith/VAEWESWE7E4HR2K7MK5HTP26CY/action/replication_record"}},"created_at":"2026-05-18T01:11:37.175211+00:00","updated_at":"2026-05-18T01:11:37.175211+00:00"}