{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:OGPUBTJ66ASCHCGOWTV4CNDWUX","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"13267c9e76c85213a276f8ed780ab3e08b1dcf011434a6bd5e9e08531d05aa91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T15:47:55Z","title_canon_sha256":"4a2240f2d722669bf0f03a2aa60d78ad86f928ed9f5eae872b7ee080920486b2"},"schema_version":"1.0","source":{"id":"1705.01036","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1705.01036","created_at":"2026-05-18T00:36:31Z"},{"alias_kind":"arxiv_version","alias_value":"1705.01036v2","created_at":"2026-05-18T00:36:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1705.01036","created_at":"2026-05-18T00:36:31Z"},{"alias_kind":"pith_short_12","alias_value":"OGPUBTJ66ASC","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_16","alias_value":"OGPUBTJ66ASCHCGO","created_at":"2026-05-18T12:31:34Z"},{"alias_kind":"pith_short_8","alias_value":"OGPUBTJ6","created_at":"2026-05-18T12:31:34Z"}],"graph_snapshots":[{"event_id":"sha256:8a45de0c6d592de4ae86dd130cbd48fe9f6f47c4a178185e1a8d22bc84707a7e","target":"graph","created_at":"2026-05-18T00:36:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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 ","authors_text":"Abel Cabrera Martinez, Frank A. Hernandez Mira, Ismael G. Yero, Jose M. Sigarreta Almira","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T15:47:55Z","title":"On computational and combinatorial properties of the total co-independent domination number of graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1705.01036","kind":"arxiv","version":2},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:4036884881577ee586315bd273e1eb5c1e6ef9aa4ad5289dbaa423267abb7728","target":"record","created_at":"2026-05-18T00:36:31Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"13267c9e76c85213a276f8ed780ab3e08b1dcf011434a6bd5e9e08531d05aa91","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-05-02T15:47:55Z","title_canon_sha256":"4a2240f2d722669bf0f03a2aa60d78ad86f928ed9f5eae872b7ee080920486b2"},"schema_version":"1.0","source":{"id":"1705.01036","kind":"arxiv","version":2}},"canonical_sha256":"719f40cd3ef0242388ceb4ebc13476a5c9bf58505b8b30ccc89c34664d89ad4f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"719f40cd3ef0242388ceb4ebc13476a5c9bf58505b8b30ccc89c34664d89ad4f","first_computed_at":"2026-05-18T00:36:31.794944Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:31.794944Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"knsA0B9+lCAjld4Py0oOT8OP6kisvi75bC/tEc5yyU+OrVZIgR72EQj31QdR90FAaOM82TEpHEbxM4J5t9oADA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:31.795448Z","signed_message":"canonical_sha256_bytes"},"source_id":"1705.01036","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4036884881577ee586315bd273e1eb5c1e6ef9aa4ad5289dbaa423267abb7728","sha256:8a45de0c6d592de4ae86dd130cbd48fe9f6f47c4a178185e1a8d22bc84707a7e"],"state_sha256":"0b96c7166a58592e4700e62d5a3a9e50ca69c7521054e29e99f7653f8ad28b48"}