{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:NGW3ZPOY2ZJ372IZOCBCTVETOZ","short_pith_number":"pith:NGW3ZPOY","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"},"canonical_sha256":"69adbcbdd8d653bfe919708229d493766e5ef89ef4c99ac387681eb45f5cf91c","source":{"kind":"arxiv","id":"1908.04189","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04189","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04189v1","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04189","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"NGW3ZPOY2ZJ3","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"pith_short_16","alias_value":"NGW3ZPOY2ZJ372IZ","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"pith_short_8","alias_value":"NGW3ZPOY","created_at":"2026-07-05T02:20:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:NGW3ZPOY2ZJ372IZOCBCTVETOZ","target":"record","payload":{"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"},"canonical_sha256":"69adbcbdd8d653bfe919708229d493766e5ef89ef4c99ac387681eb45f5cf91c","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"},"source_kind":"arxiv","source_id":"1908.04189","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fB3AvNhPXDljjybJt/43yqSD/jzUCykgkiYkQVYGK1YkdYqyvvFHW7DdCSgcV5fPN6lTuApm52kY5U5QwnUvCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:06:59.785376Z"},"content_sha256":"45203fa305ee6c9eec6be0bb487a0735b6c0ef979fefd8184f99ea6fbf67f340","schema_version":"1.0","event_id":"sha256:45203fa305ee6c9eec6be0bb487a0735b6c0ef979fefd8184f99ea6fbf67f340"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:NGW3ZPOY2ZJ372IZOCBCTVETOZ","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T02:20:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FzSdE1qX0lgad5LmQgwCb6aL53iFCHVO5r7RmDBj207u7H+fQ9G+e88ft2XkUNDJzOZ6OYZPdQN4GpYi+o7dCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-16T07:06:59.785916Z"},"content_sha256":"70a170d206fe5f9e611425da78948e773350fcfed09504487d68f707e7ff42e7","schema_version":"1.0","event_id":"sha256:70a170d206fe5f9e611425da78948e773350fcfed09504487d68f707e7ff42e7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/bundle.json","state_url":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-16T07:06:59Z","links":{"resolver":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ","bundle":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/bundle.json","state":"https://pith.science/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NGW3ZPOY2ZJ372IZOCBCTVETOZ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:NGW3ZPOY2ZJ372IZOCBCTVETOZ","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":"3ab777d0cbd0efce53c8f23ca0433412864c98c7daaf8a0988c949137cc90614","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T15:11:27Z","title_canon_sha256":"cd8aad1b72ffb09eb23bc755c6f41db7e7f3779b02190fc4d106b9e3bde8b4c7"},"schema_version":"1.0","source":{"id":"1908.04189","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1908.04189","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"arxiv_version","alias_value":"1908.04189v1","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.04189","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"pith_short_12","alias_value":"NGW3ZPOY2ZJ3","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"pith_short_16","alias_value":"NGW3ZPOY2ZJ372IZ","created_at":"2026-07-05T02:20:12Z"},{"alias_kind":"pith_short_8","alias_value":"NGW3ZPOY","created_at":"2026-07-05T02:20:12Z"}],"graph_snapshots":[{"event_id":"sha256:70a170d206fe5f9e611425da78948e773350fcfed09504487d68f707e7ff42e7","target":"graph","created_at":"2026-07-05T02:20:12Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1908.04189/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Jerzy Topp, Michael A. Henning","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T15:11:27Z","title":"Minimal graphs with disjoint dominating and paired-dominating sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.04189","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:45203fa305ee6c9eec6be0bb487a0735b6c0ef979fefd8184f99ea6fbf67f340","target":"record","created_at":"2026-07-05T02:20:12Z","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":"3ab777d0cbd0efce53c8f23ca0433412864c98c7daaf8a0988c949137cc90614","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-08-12T15:11:27Z","title_canon_sha256":"cd8aad1b72ffb09eb23bc755c6f41db7e7f3779b02190fc4d106b9e3bde8b4c7"},"schema_version":"1.0","source":{"id":"1908.04189","kind":"arxiv","version":1}},"canonical_sha256":"69adbcbdd8d653bfe919708229d493766e5ef89ef4c99ac387681eb45f5cf91c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69adbcbdd8d653bfe919708229d493766e5ef89ef4c99ac387681eb45f5cf91c","first_computed_at":"2026-07-05T02:20:12.391521Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:20:12.391521Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v7/+wxolk9147wDZURF8N3tpMG4jMdi6pfZY08SKg9mpzw3tJAR8P7ZrshhhZ6eLG6wxWNCkJRNyf7a8EgbpAg==","signature_status":"signed_v1","signed_at":"2026-07-05T02:20:12.391934Z","signed_message":"canonical_sha256_bytes"},"source_id":"1908.04189","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:45203fa305ee6c9eec6be0bb487a0735b6c0ef979fefd8184f99ea6fbf67f340","sha256:70a170d206fe5f9e611425da78948e773350fcfed09504487d68f707e7ff42e7"],"state_sha256":"777850c9c887db4f8b90249368e374ba0981ad662f0e6113329df50b6d6d4e85"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6es7mCPsFBM9tQkUcaXRGyGN+5YQKG+dGVBxeZNzt7F9r5jhJUI1D8+jfxUi/O1MKESbQJLXqmKxEjCcrIe0BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-16T07:06:59.789715Z","bundle_sha256":"11c929ade77defe97544f3338af5b89cf9e667b3d01de5560a8bd1174eae5247"}}