{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:AJNQLUBPBATBBOOLD7YVFG5ENC","short_pith_number":"pith:AJNQLUBP","schema_version":"1.0","canonical_sha256":"025b05d02f082610b9cb1ff1529ba4688a57527881f66da4854ec2c17aea6889","source":{"kind":"arxiv","id":"1810.08773","version":1},"attestation_state":"computed","paper":{"title":"Total mixed domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Farshad Kazemnejad, Somayeh Moradi","submitted_at":"2018-10-20T08:53:57Z","abstract_excerpt":"For a graph $G=(V,E)$, we call a subset $ S\\subseteq V \\cup E$ a total mixed dominating set of $G$ if each element of $V \\cup E$ is either adjacent or incident to an element of $S$, and the total mixed domination number $\\gamma_{tm}(G)$ of $G$ is the minimum cardinality of a total mixed dominating set of $G$. In this paper, we initiate to study the total mixed domination number of a connected graph by giving some tight bounds in terms of some parameters such as order and total domination numbers of the graph and its line graph. Then we discuss on the relation between total mixed domination num"},"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":"1810.08773","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-10-20T08:53:57Z","cross_cats_sorted":[],"title_canon_sha256":"8a4b44bb80ae47f75133904086d3b867e3e2d6fb59729b464ff92066e98d4449","abstract_canon_sha256":"a5081517d0bda873c9a89feef989dfc679a407a67be166205558e69bf8da1dff"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:02:41.940198Z","signature_b64":"7XjhcJqmeAL6YbAhNWuWeOaS70cK8kv3VONwYJ/YTsm9oHwJw8HTKTBRFbnU5v91DyfjArX7TNwfylJqhNg5Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"025b05d02f082610b9cb1ff1529ba4688a57527881f66da4854ec2c17aea6889","last_reissued_at":"2026-05-18T00:02:41.939736Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:02:41.939736Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Total mixed domination in graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Adel P. Kazemi, Farshad Kazemnejad, Somayeh Moradi","submitted_at":"2018-10-20T08:53:57Z","abstract_excerpt":"For a graph $G=(V,E)$, we call a subset $ S\\subseteq V \\cup E$ a total mixed dominating set of $G$ if each element of $V \\cup E$ is either adjacent or incident to an element of $S$, and the total mixed domination number $\\gamma_{tm}(G)$ of $G$ is the minimum cardinality of a total mixed dominating set of $G$. In this paper, we initiate to study the total mixed domination number of a connected graph by giving some tight bounds in terms of some parameters such as order and total domination numbers of the graph and its line graph. Then we discuss on the relation between total mixed domination num"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08773","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":"1810.08773","created_at":"2026-05-18T00:02:41.939823+00:00"},{"alias_kind":"arxiv_version","alias_value":"1810.08773v1","created_at":"2026-05-18T00:02:41.939823+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08773","created_at":"2026-05-18T00:02:41.939823+00:00"},{"alias_kind":"pith_short_12","alias_value":"AJNQLUBPBATB","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_16","alias_value":"AJNQLUBPBATBBOOL","created_at":"2026-05-18T12:32:13.499390+00:00"},{"alias_kind":"pith_short_8","alias_value":"AJNQLUBP","created_at":"2026-05-18T12:32:13.499390+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/AJNQLUBPBATBBOOLD7YVFG5ENC","json":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC.json","graph_json":"https://pith.science/api/pith-number/AJNQLUBPBATBBOOLD7YVFG5ENC/graph.json","events_json":"https://pith.science/api/pith-number/AJNQLUBPBATBBOOLD7YVFG5ENC/events.json","paper":"https://pith.science/paper/AJNQLUBP"},"agent_actions":{"view_html":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC","download_json":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC.json","view_paper":"https://pith.science/paper/AJNQLUBP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1810.08773&json=true","fetch_graph":"https://pith.science/api/pith-number/AJNQLUBPBATBBOOLD7YVFG5ENC/graph.json","fetch_events":"https://pith.science/api/pith-number/AJNQLUBPBATBBOOLD7YVFG5ENC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/action/storage_attestation","attest_author":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/action/author_attestation","sign_citation":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/action/citation_signature","submit_replication":"https://pith.science/pith/AJNQLUBPBATBBOOLD7YVFG5ENC/action/replication_record"}},"created_at":"2026-05-18T00:02:41.939823+00:00","updated_at":"2026-05-18T00:02:41.939823+00:00"}