{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:NGW3ZPOY2ZJ372IZOCBCTVETOZ","short_pith_number":"pith:NGW3ZPOY","schema_version":"1.0","canonical_sha256":"69adbcbdd8d653bfe919708229d493766e5ef89ef4c99ac387681eb45f5cf91c","source":{"kind":"arxiv","id":"1908.04189","version":1},"attestation_state":"computed","paper":{"title":"Minimal graphs with disjoint dominating and paired-dominating sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy Topp, Michael A. Henning","submitted_at":"2019-08-12T15:11:27Z","abstract_excerpt":"A subset $D\\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G-D$ has a~neighbor in $D$, while $D$ is a paired-dominating set of $G$ if $D$ is a~dominating set and the subgraph induced by $D$ contains a perfect matching. A graph $G$ is a $D\\!P\\!D\\!P$-graph if it has a pair $(D,P)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $P$ is a paired-dominating set of $G$. The study of the $D\\!P\\!D\\!P$-graphs was initiated by Southey and Henning (Cent. Eur. J. Math. 8 (2010) 459--467; J. Comb. Optim. 22 (2011) 217--234). In this paper, we provide conditions whi"},"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":"1908.04189","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T15:11:27Z","cross_cats_sorted":[],"title_canon_sha256":"cd8aad1b72ffb09eb23bc755c6f41db7e7f3779b02190fc4d106b9e3bde8b4c7","abstract_canon_sha256":"3ab777d0cbd0efce53c8f23ca0433412864c98c7daaf8a0988c949137cc90614"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:20:12.391934Z","signature_b64":"v7/+wxolk9147wDZURF8N3tpMG4jMdi6pfZY08SKg9mpzw3tJAR8P7ZrshhhZ6eLG6wxWNCkJRNyf7a8EgbpAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69adbcbdd8d653bfe919708229d493766e5ef89ef4c99ac387681eb45f5cf91c","last_reissued_at":"2026-07-05T02:20:12.391521Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:20:12.391521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimal graphs with disjoint dominating and paired-dominating sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Jerzy Topp, Michael A. Henning","submitted_at":"2019-08-12T15:11:27Z","abstract_excerpt":"A subset $D\\subseteq V_G$ is a dominating set of $G$ if every vertex in $V_G-D$ has a~neighbor in $D$, while $D$ is a paired-dominating set of $G$ if $D$ is a~dominating set and the subgraph induced by $D$ contains a perfect matching. A graph $G$ is a $D\\!P\\!D\\!P$-graph if it has a pair $(D,P)$ of disjoint sets of vertices of $G$ such that $D$ is a dominating set and $P$ is a paired-dominating set of $G$. The study of the $D\\!P\\!D\\!P$-graphs was initiated by Southey and Henning (Cent. Eur. J. Math. 8 (2010) 459--467; J. Comb. Optim. 22 (2011) 217--234). In this paper, we provide conditions whi"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04189","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1908.04189/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1908.04189","created_at":"2026-07-05T02:20:12.391585+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.04189v1","created_at":"2026-07-05T02:20:12.391585+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04189","created_at":"2026-07-05T02:20:12.391585+00:00"},{"alias_kind":"pith_short_12","alias_value":"NGW3ZPOY2ZJ3","created_at":"2026-07-05T02:20:12.391585+00:00"},{"alias_kind":"pith_short_16","alias_value":"NGW3ZPOY2ZJ372IZ","created_at":"2026-07-05T02:20:12.391585+00:00"},{"alias_kind":"pith_short_8","alias_value":"NGW3ZPOY","created_at":"2026-07-05T02:20:12.391585+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/NGW3ZPOY2ZJ372IZOCBCTVETOZ","json":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ.json","graph_json":"https://pith.science/api/pith-number/NGW3ZPOY2ZJ372IZOCBCTVETOZ/graph.json","events_json":"https://pith.science/api/pith-number/NGW3ZPOY2ZJ372IZOCBCTVETOZ/events.json","paper":"https://pith.science/paper/NGW3ZPOY"},"agent_actions":{"view_html":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ","download_json":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ.json","view_paper":"https://pith.science/paper/NGW3ZPOY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.04189&json=true","fetch_graph":"https://pith.science/api/pith-number/NGW3ZPOY2ZJ372IZOCBCTVETOZ/graph.json","fetch_events":"https://pith.science/api/pith-number/NGW3ZPOY2ZJ372IZOCBCTVETOZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/action/storage_attestation","attest_author":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/action/author_attestation","sign_citation":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/action/citation_signature","submit_replication":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/action/replication_record"}},"created_at":"2026-07-05T02:20:12.391585+00:00","updated_at":"2026-07-05T02:20:12.391585+00:00"}