{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:P4RRVFDFSV5OG6RPWT4DEBSFLJ","short_pith_number":"pith:P4RRVFDF","schema_version":"1.0","canonical_sha256":"7f231a9465957ae37a2fb4f83206455a7d02dd7230692f11545b956e581860dc","source":{"kind":"arxiv","id":"1904.00964","version":1},"attestation_state":"computed","paper":{"title":"Complexity and Algorithms for Semipaired Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arti Pandey, Michael A. Henning, Vikash Tripathi","submitted_at":"2019-04-01T16:58:46Z","abstract_excerpt":"For a graph $G=(V,E)$ with no isolated vertices, a set $D\\subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$, and $(ii)$ $D$ can be partitioned into two element subsets such that the vertices in each two element set are at distance at most two. The minimum cardinality of a semipaired dominating set of $G$ is called the semipaired domination number of $G$, and is denoted by $\\gamma_{pr2}(G)$. The \\textsc{Minimum Semipaired Domination} problem is to find a semipaired dominating set of $G$ of cardinality $\\gamma_{pr2}(G)$. In this paper, we initiate the"},"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":"1904.00964","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2019-04-01T16:58:46Z","cross_cats_sorted":[],"title_canon_sha256":"86f516e21baeef3a4692a679af7b1f4e437e85b7e2d8fa862d675bff98eb7e66","abstract_canon_sha256":"94012de661f101cbc7ca3c850f0517f30505868cdc565d47a69ef2213b429eab"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:44.741552Z","signature_b64":"36hIDy1uK/uM8CWx4J5hf3acQs9wm6cSwILA670PtRLHVABoYT4Lpv3US7cenFim866OhSQEJE1IQrN7bJYfCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7f231a9465957ae37a2fb4f83206455a7d02dd7230692f11545b956e581860dc","last_reissued_at":"2026-05-17T23:49:44.741028Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:44.741028Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Complexity and Algorithms for Semipaired Domination in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Arti Pandey, Michael A. Henning, Vikash Tripathi","submitted_at":"2019-04-01T16:58:46Z","abstract_excerpt":"For a graph $G=(V,E)$ with no isolated vertices, a set $D\\subseteq V$ is called a semipaired dominating set of G if $(i)$ $D$ is a dominating set of $G$, and $(ii)$ $D$ can be partitioned into two element subsets such that the vertices in each two element set are at distance at most two. The minimum cardinality of a semipaired dominating set of $G$ is called the semipaired domination number of $G$, and is denoted by $\\gamma_{pr2}(G)$. The \\textsc{Minimum Semipaired Domination} problem is to find a semipaired dominating set of $G$ of cardinality $\\gamma_{pr2}(G)$. In this paper, we initiate the"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00964","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":"1904.00964","created_at":"2026-05-17T23:49:44.741114+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00964v1","created_at":"2026-05-17T23:49:44.741114+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00964","created_at":"2026-05-17T23:49:44.741114+00:00"},{"alias_kind":"pith_short_12","alias_value":"P4RRVFDFSV5O","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_16","alias_value":"P4RRVFDFSV5OG6RP","created_at":"2026-05-18T12:33:24.271573+00:00"},{"alias_kind":"pith_short_8","alias_value":"P4RRVFDF","created_at":"2026-05-18T12:33:24.271573+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/P4RRVFDFSV5OG6RPWT4DEBSFLJ","json":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ.json","graph_json":"https://pith.science/api/pith-number/P4RRVFDFSV5OG6RPWT4DEBSFLJ/graph.json","events_json":"https://pith.science/api/pith-number/P4RRVFDFSV5OG6RPWT4DEBSFLJ/events.json","paper":"https://pith.science/paper/P4RRVFDF"},"agent_actions":{"view_html":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ","download_json":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ.json","view_paper":"https://pith.science/paper/P4RRVFDF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00964&json=true","fetch_graph":"https://pith.science/api/pith-number/P4RRVFDFSV5OG6RPWT4DEBSFLJ/graph.json","fetch_events":"https://pith.science/api/pith-number/P4RRVFDFSV5OG6RPWT4DEBSFLJ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ/action/storage_attestation","attest_author":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ/action/author_attestation","sign_citation":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ/action/citation_signature","submit_replication":"https://pith.science/pith/P4RRVFDFSV5OG6RPWT4DEBSFLJ/action/replication_record"}},"created_at":"2026-05-17T23:49:44.741114+00:00","updated_at":"2026-05-17T23:49:44.741114+00:00"}