{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:Y33E24BLCXEUKA5PAZUABMREFG","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":"6d40f1403429407fe7a3cb2a3551e9932649215b90ea7bf4bc28fa88831789d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T15:28:21Z","title_canon_sha256":"cd45266fbd13f61d407c191acd4a501f57e709a667666b075a0c9b87628e2a09"},"schema_version":"1.0","source":{"id":"1708.09774","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.09774","created_at":"2026-05-18T00:36:15Z"},{"alias_kind":"arxiv_version","alias_value":"1708.09774v1","created_at":"2026-05-18T00:36:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.09774","created_at":"2026-05-18T00:36:15Z"},{"alias_kind":"pith_short_12","alias_value":"Y33E24BLCXEU","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_16","alias_value":"Y33E24BLCXEUKA5P","created_at":"2026-05-18T12:31:56Z"},{"alias_kind":"pith_short_8","alias_value":"Y33E24BL","created_at":"2026-05-18T12:31:56Z"}],"graph_snapshots":[{"event_id":"sha256:1299f114e1fd48178423f537d1fa8c9cbba3972c646050e938e13db243c7187f","target":"graph","created_at":"2026-05-18T00:36:15Z","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":"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)$, ","authors_text":"Alejandro Angeli Ayello, Margaret-Ellen Messinger, William F. Klostermeyer","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T15:28:21Z","title":"Disjoint Dominating Sets with a Perfect Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.09774","kind":"arxiv","version":1},"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:4fafc9e955ea249ed742777653f58d193e0e26dae076a5f0c58273d9527b6385","target":"record","created_at":"2026-05-18T00:36:15Z","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":"6d40f1403429407fe7a3cb2a3551e9932649215b90ea7bf4bc28fa88831789d4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-08-31T15:28:21Z","title_canon_sha256":"cd45266fbd13f61d407c191acd4a501f57e709a667666b075a0c9b87628e2a09"},"schema_version":"1.0","source":{"id":"1708.09774","kind":"arxiv","version":1}},"canonical_sha256":"c6f64d702b15c94503af066800b22429a9ce0658df83c7b0cf716c2e24085477","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c6f64d702b15c94503af066800b22429a9ce0658df83c7b0cf716c2e24085477","first_computed_at":"2026-05-18T00:36:15.123420Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:36:15.123420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3rJkxFvvg98IUi+n3xsbqQChUg6Rknm6iqfTRf+qPq4XUe8IGe6ICJcDJFDnC0eMwWMLWbsDf3Ob5WsPqghKCw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:36:15.124054Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.09774","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4fafc9e955ea249ed742777653f58d193e0e26dae076a5f0c58273d9527b6385","sha256:1299f114e1fd48178423f537d1fa8c9cbba3972c646050e938e13db243c7187f"],"state_sha256":"d5777e6001f21242caec3c6ce98e38d3e952b3b1e6b935b7b085fa810a976471"}