{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:Y33E24BLCXEUKA5PAZUABMREFG","short_pith_number":"pith:Y33E24BL","schema_version":"1.0","canonical_sha256":"c6f64d702b15c94503af066800b22429a9ce0658df83c7b0cf716c2e24085477","source":{"kind":"arxiv","id":"1708.09774","version":1},"attestation_state":"computed","paper":{"title":"Disjoint Dominating Sets with a Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Angeli Ayello, Margaret-Ellen Messinger, William F. Klostermeyer","submitted_at":"2017-08-31T15:28:21Z","abstract_excerpt":"In this paper, we consider dominating sets $D$ and $D'$ such that $D$ and $D'$ are disjoint and there exists a perfect matching between them. Let $DD_{\\textrm{m}}(G)$ denote the cardinality of smallest such sets $D, D'$ in $G$ (provided they exist, otherwise $DD_{\\textrm{m}}(G) = \\infty$). This concept was introduced in [Klostermeyer et al., Theory and Application of Graphs, 2017] in the context of studying a certain graph protection problem. We characterize the trees $T$ for which $DD_{\\textrm{m}}(T)$ equals a certain graph protection parameter and for which $DD_{\\textrm{m}}(T) = \\alpha(T)$, "},"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":"1708.09774","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T15:28:21Z","cross_cats_sorted":[],"title_canon_sha256":"cd45266fbd13f61d407c191acd4a501f57e709a667666b075a0c9b87628e2a09","abstract_canon_sha256":"6d40f1403429407fe7a3cb2a3551e9932649215b90ea7bf4bc28fa88831789d4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:36:15.124054Z","signature_b64":"3rJkxFvvg98IUi+n3xsbqQChUg6Rknm6iqfTRf+qPq4XUe8IGe6ICJcDJFDnC0eMwWMLWbsDf3Ob5WsPqghKCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c6f64d702b15c94503af066800b22429a9ce0658df83c7b0cf716c2e24085477","last_reissued_at":"2026-05-18T00:36:15.123420Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:36:15.123420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Disjoint Dominating Sets with a Perfect Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Alejandro Angeli Ayello, Margaret-Ellen Messinger, William F. Klostermeyer","submitted_at":"2017-08-31T15:28:21Z","abstract_excerpt":"In this paper, we consider dominating sets $D$ and $D'$ such that $D$ and $D'$ are disjoint and there exists a perfect matching between them. Let $DD_{\\textrm{m}}(G)$ denote the cardinality of smallest such sets $D, D'$ in $G$ (provided they exist, otherwise $DD_{\\textrm{m}}(G) = \\infty$). This concept was introduced in [Klostermeyer et al., Theory and Application of Graphs, 2017] in the context of studying a certain graph protection problem. We characterize the trees $T$ for which $DD_{\\textrm{m}}(T)$ equals a certain graph protection parameter and for which $DD_{\\textrm{m}}(T) = \\alpha(T)$, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09774","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":"1708.09774","created_at":"2026-05-18T00:36:15.123507+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.09774v1","created_at":"2026-05-18T00:36:15.123507+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09774","created_at":"2026-05-18T00:36:15.123507+00:00"},{"alias_kind":"pith_short_12","alias_value":"Y33E24BLCXEU","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_16","alias_value":"Y33E24BLCXEUKA5P","created_at":"2026-05-18T12:31:56.362134+00:00"},{"alias_kind":"pith_short_8","alias_value":"Y33E24BL","created_at":"2026-05-18T12:31:56.362134+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/Y33E24BLCXEUKA5PAZUABMREFG","json":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG.json","graph_json":"https://pith.science/api/pith-number/Y33E24BLCXEUKA5PAZUABMREFG/graph.json","events_json":"https://pith.science/api/pith-number/Y33E24BLCXEUKA5PAZUABMREFG/events.json","paper":"https://pith.science/paper/Y33E24BL"},"agent_actions":{"view_html":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG","download_json":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG.json","view_paper":"https://pith.science/paper/Y33E24BL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.09774&json=true","fetch_graph":"https://pith.science/api/pith-number/Y33E24BLCXEUKA5PAZUABMREFG/graph.json","fetch_events":"https://pith.science/api/pith-number/Y33E24BLCXEUKA5PAZUABMREFG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG/action/storage_attestation","attest_author":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG/action/author_attestation","sign_citation":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG/action/citation_signature","submit_replication":"https://pith.science/pith/Y33E24BLCXEUKA5PAZUABMREFG/action/replication_record"}},"created_at":"2026-05-18T00:36:15.123507+00:00","updated_at":"2026-05-18T00:36:15.123507+00:00"}