{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:OGPUBTJ66ASCHCGOWTV4CNDWUX","short_pith_number":"pith:OGPUBTJ6","schema_version":"1.0","canonical_sha256":"719f40cd3ef0242388ceb4ebc13476a5c9bf58505b8b30ccc89c34664d89ad4f","source":{"kind":"arxiv","id":"1705.01036","version":2},"attestation_state":"computed","paper":{"title":"On computational and combinatorial properties of the total co-independent domination number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abel Cabrera Martinez, Frank A. Hernandez Mira, Ismael G. Yero, Jose M. Sigarreta Almira","submitted_at":"2017-05-02T15:47:55Z","abstract_excerpt":"A subset $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total dominating set $D$ is called a total co-independent dominating set if the subgraph induced by $V-D$ is edgeless and has at least one vertex. The minimum cardinality of any total co-independent dominating set is the total co-independent domination number of $G$ and is denoted by $\\gamma_{t,coi}(G)$. In this work we study some complexity and combinatorial properties of $\\gamma_{t,coi}(G)$. Specifically, we prove that deciding whether $\\gamma_{t,coi}(G)\\le "},"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":"1705.01036","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T15:47:55Z","cross_cats_sorted":[],"title_canon_sha256":"4a2240f2d722669bf0f03a2aa60d78ad86f928ed9f5eae872b7ee080920486b2","abstract_canon_sha256":"13267c9e76c85213a276f8ed780ab3e08b1dcf011434a6bd5e9e08531d05aa91"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:31.795448Z","signature_b64":"knsA0B9+lCAjld4Py0oOT8OP6kisvi75bC/tEc5yyU+OrVZIgR72EQj31QdR90FAaOM82TEpHEbxM4J5t9oADA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"719f40cd3ef0242388ceb4ebc13476a5c9bf58505b8b30ccc89c34664d89ad4f","last_reissued_at":"2026-05-18T00:36:31.794944Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:31.794944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On computational and combinatorial properties of the total co-independent domination number of graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Abel Cabrera Martinez, Frank A. Hernandez Mira, Ismael G. Yero, Jose M. Sigarreta Almira","submitted_at":"2017-05-02T15:47:55Z","abstract_excerpt":"A subset $D$ of vertices of a graph $G$ is a total dominating set if every vertex of $G$ is adjacent to at least one vertex of $D$. The total dominating set $D$ is called a total co-independent dominating set if the subgraph induced by $V-D$ is edgeless and has at least one vertex. The minimum cardinality of any total co-independent dominating set is the total co-independent domination number of $G$ and is denoted by $\\gamma_{t,coi}(G)$. In this work we study some complexity and combinatorial properties of $\\gamma_{t,coi}(G)$. Specifically, we prove that deciding whether $\\gamma_{t,coi}(G)\\le "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01036","kind":"arxiv","version":2},"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":"1705.01036","created_at":"2026-05-18T00:36:31.795015+00:00"},{"alias_kind":"arxiv_version","alias_value":"1705.01036v2","created_at":"2026-05-18T00:36:31.795015+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01036","created_at":"2026-05-18T00:36:31.795015+00:00"},{"alias_kind":"pith_short_12","alias_value":"OGPUBTJ66ASC","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_16","alias_value":"OGPUBTJ66ASCHCGO","created_at":"2026-05-18T12:31:34.259226+00:00"},{"alias_kind":"pith_short_8","alias_value":"OGPUBTJ6","created_at":"2026-05-18T12:31:34.259226+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/OGPUBTJ66ASCHCGOWTV4CNDWUX","json":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX.json","graph_json":"https://pith.science/api/pith-number/OGPUBTJ66ASCHCGOWTV4CNDWUX/graph.json","events_json":"https://pith.science/api/pith-number/OGPUBTJ66ASCHCGOWTV4CNDWUX/events.json","paper":"https://pith.science/paper/OGPUBTJ6"},"agent_actions":{"view_html":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX","download_json":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX.json","view_paper":"https://pith.science/paper/OGPUBTJ6","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1705.01036&json=true","fetch_graph":"https://pith.science/api/pith-number/OGPUBTJ66ASCHCGOWTV4CNDWUX/graph.json","fetch_events":"https://pith.science/api/pith-number/OGPUBTJ66ASCHCGOWTV4CNDWUX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX/action/storage_attestation","attest_author":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX/action/author_attestation","sign_citation":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX/action/citation_signature","submit_replication":"https://pith.science/pith/OGPUBTJ66ASCHCGOWTV4CNDWUX/action/replication_record"}},"created_at":"2026-05-18T00:36:31.795015+00:00","updated_at":"2026-05-18T00:36:31.795015+00:00"}