{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:PHDOTLZPWKE6QD4IPRP7SPDSVS","short_pith_number":"pith:PHDOTLZP","canonical_record":{"source":{"id":"1906.08727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-20T16:16:04Z","cross_cats_sorted":[],"title_canon_sha256":"a2ffb42393b3cc44ffea870e277cf37981132903bab0e31212f469b7185cbf8d","abstract_canon_sha256":"8d64963897a7274363bcf5048398561c48e2e2bea06c55420528fff82854d4e3"},"schema_version":"1.0"},"canonical_sha256":"79c6e9af2fb289e80f887c5ff93c72aca3ff8cfcc616a908a9e0de8116b79c91","source":{"kind":"arxiv","id":"1906.08727","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08727","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08727v1","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08727","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"PHDOTLZPWKE6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PHDOTLZPWKE6QD4I","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PHDOTLZP","created_at":"2026-05-18T12:33:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:PHDOTLZPWKE6QD4IPRP7SPDSVS","target":"record","payload":{"canonical_record":{"source":{"id":"1906.08727","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-20T16:16:04Z","cross_cats_sorted":[],"title_canon_sha256":"a2ffb42393b3cc44ffea870e277cf37981132903bab0e31212f469b7185cbf8d","abstract_canon_sha256":"8d64963897a7274363bcf5048398561c48e2e2bea06c55420528fff82854d4e3"},"schema_version":"1.0"},"canonical_sha256":"79c6e9af2fb289e80f887c5ff93c72aca3ff8cfcc616a908a9e0de8116b79c91","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:49.458948Z","signature_b64":"vSDNA9532h8R/izySRvbhrenghHaA8/H9rx9MhIiVzIMziTaBf8uChcsKqE3482CHx+lDeCGML848Xtf8QGFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79c6e9af2fb289e80f887c5ff93c72aca3ff8cfcc616a908a9e0de8116b79c91","last_reissued_at":"2026-05-17T23:42:49.458538Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:49.458538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.08727","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-05-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QTsX/oir8ELeTB7HI/nHDsD099l0cYkl01HXSDl3XE1Q+iSh4AVL1V0vUJ2+1ZUGsO/gh9P+3zrVVmvj0ah4Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:54:53.463591Z"},"content_sha256":"98dd17a1ece621a0dbdb69f9071cc1324d4cd56389f56395f999382b504a71ad","schema_version":"1.0","event_id":"sha256:98dd17a1ece621a0dbdb69f9071cc1324d4cd56389f56395f999382b504a71ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:PHDOTLZPWKE6QD4IPRP7SPDSVS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Traceability of Connected Domination Critical Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat","submitted_at":"2019-06-20T16:16:04Z","abstract_excerpt":"A dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex outside $S$ is adjacent to a vertex in $S$. A connected dominating set in $G$ is a dominating set $S$ such that the subgraph $G[S]$ induced by $S$ is connected. The connected domination number of $G$, $\\gamma_c(G)$, is the minimum cardinality of a connected dominating set of $G$. A graph $G$ is said to be $k$-$\\gamma_{c}$-critical if the connected domination number $\\gamma_{c}(G)$ is equal to $k$ and $\\gamma_{c}(G + uv) < k$ for every pair of non-adjacent vertices $u$ and $v$ of $G$. Let $\\zeta$ be the numbe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08727","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"},"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-05-17T23:42:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x6Ir+iEaCB06uD9xZmIX4T32y7ah/8k7bTgJWT9a8sYfbL5rVBYH8qaqFNSl83K++15qQUw/+raRmXWRWi9cCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T09:54:53.464266Z"},"content_sha256":"32a9e1595dad38bcc8b304e2526a623a10692e96441dc7bf613382be99797286","schema_version":"1.0","event_id":"sha256:32a9e1595dad38bcc8b304e2526a623a10692e96441dc7bf613382be99797286"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PHDOTLZPWKE6QD4IPRP7SPDSVS/bundle.json","state_url":"https://pith.science/pith/PHDOTLZPWKE6QD4IPRP7SPDSVS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PHDOTLZPWKE6QD4IPRP7SPDSVS/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-05-26T09:54:53Z","links":{"resolver":"https://pith.science/pith/PHDOTLZPWKE6QD4IPRP7SPDSVS","bundle":"https://pith.science/pith/PHDOTLZPWKE6QD4IPRP7SPDSVS/bundle.json","state":"https://pith.science/pith/PHDOTLZPWKE6QD4IPRP7SPDSVS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PHDOTLZPWKE6QD4IPRP7SPDSVS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:PHDOTLZPWKE6QD4IPRP7SPDSVS","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":"8d64963897a7274363bcf5048398561c48e2e2bea06c55420528fff82854d4e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-20T16:16:04Z","title_canon_sha256":"a2ffb42393b3cc44ffea870e277cf37981132903bab0e31212f469b7185cbf8d"},"schema_version":"1.0","source":{"id":"1906.08727","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.08727","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"arxiv_version","alias_value":"1906.08727v1","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.08727","created_at":"2026-05-17T23:42:49Z"},{"alias_kind":"pith_short_12","alias_value":"PHDOTLZPWKE6","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_16","alias_value":"PHDOTLZPWKE6QD4I","created_at":"2026-05-18T12:33:24Z"},{"alias_kind":"pith_short_8","alias_value":"PHDOTLZP","created_at":"2026-05-18T12:33:24Z"}],"graph_snapshots":[{"event_id":"sha256:32a9e1595dad38bcc8b304e2526a623a10692e96441dc7bf613382be99797286","target":"graph","created_at":"2026-05-17T23:42:49Z","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":"A dominating set in a graph $G$ is a set $S$ of vertices of $G$ such that every vertex outside $S$ is adjacent to a vertex in $S$. A connected dominating set in $G$ is a dominating set $S$ such that the subgraph $G[S]$ induced by $S$ is connected. The connected domination number of $G$, $\\gamma_c(G)$, is the minimum cardinality of a connected dominating set of $G$. A graph $G$ is said to be $k$-$\\gamma_{c}$-critical if the connected domination number $\\gamma_{c}(G)$ is equal to $k$ and $\\gamma_{c}(G + uv) < k$ for every pair of non-adjacent vertices $u$ and $v$ of $G$. Let $\\zeta$ be the numbe","authors_text":"Michael A. Henning, Nawarat Ananchuen, Pawaton Kaemawichanurat","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-20T16:16:04Z","title":"Traceability of Connected Domination Critical Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.08727","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:98dd17a1ece621a0dbdb69f9071cc1324d4cd56389f56395f999382b504a71ad","target":"record","created_at":"2026-05-17T23:42:49Z","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":"8d64963897a7274363bcf5048398561c48e2e2bea06c55420528fff82854d4e3","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-06-20T16:16:04Z","title_canon_sha256":"a2ffb42393b3cc44ffea870e277cf37981132903bab0e31212f469b7185cbf8d"},"schema_version":"1.0","source":{"id":"1906.08727","kind":"arxiv","version":1}},"canonical_sha256":"79c6e9af2fb289e80f887c5ff93c72aca3ff8cfcc616a908a9e0de8116b79c91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79c6e9af2fb289e80f887c5ff93c72aca3ff8cfcc616a908a9e0de8116b79c91","first_computed_at":"2026-05-17T23:42:49.458538Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:49.458538Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"vSDNA9532h8R/izySRvbhrenghHaA8/H9rx9MhIiVzIMziTaBf8uChcsKqE3482CHx+lDeCGML848Xtf8QGFDg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:49.458948Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.08727","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:98dd17a1ece621a0dbdb69f9071cc1324d4cd56389f56395f999382b504a71ad","sha256:32a9e1595dad38bcc8b304e2526a623a10692e96441dc7bf613382be99797286"],"state_sha256":"de5ca900a6b5681125079c7ddc2b4a9b61c8f6b84f71bbb9d65542be3d3e2ed3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wF1+7eytBXzDTVaubmMCRco6QafAHWnfmO22vVuquovBngStjdEEm9x0PQ05JsAbvpnjMAMTk8i1Gaw0p0c4BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T09:54:53.468241Z","bundle_sha256":"29fbe6498070c0c626b2f4ab3e3f99f5ad94919616f37fc7b8787c3cff0ee0a7"}}