{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:Z5ST2OIIC3NH6VCAIQHOP5ENMD","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":"737829aec3fde797a58158a1d070e822c1a5fa45aa2091dc64849e5cee465321","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-10T17:01:25Z","title_canon_sha256":"59babcfb4485fb27777a83299ae77692dec6902c5bd4dc8dbc5c0e0abae4e10d"},"schema_version":"1.0","source":{"id":"1601.02234","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1601.02234","created_at":"2026-05-18T01:23:06Z"},{"alias_kind":"arxiv_version","alias_value":"1601.02234v1","created_at":"2026-05-18T01:23:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1601.02234","created_at":"2026-05-18T01:23:06Z"},{"alias_kind":"pith_short_12","alias_value":"Z5ST2OIIC3NH","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_16","alias_value":"Z5ST2OIIC3NH6VCA","created_at":"2026-05-18T12:30:53Z"},{"alias_kind":"pith_short_8","alias_value":"Z5ST2OII","created_at":"2026-05-18T12:30:53Z"}],"graph_snapshots":[{"event_id":"sha256:e67c5dc6a030b9fdf7d5452bc987a7111b6793204a290ca08a8f90f54b439583","target":"graph","created_at":"2026-05-18T01:23:06Z","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":"For a graph $G$ let $\\gamma (G)$ be its domination number. We define a graph G to be (i) a hypo-efficient domination graph (or a hypo-$\\mathcal{ED}$ graph) if $G$ has no efficient dominating set (EDS) but every graph formed by removing a single vertex from $G$ has at least one EDS, and (ii) a hypo-unique domination graph (a hypo-$\\mathcal{UD}$ graph) if $G$ has at least two minimum dominating sets,but $G-v$ has a unique minimum dominating set for each $v\\in V(G)$. We show that each hypo-$\\mathcal{UD}$ graph $G$ of order at least $3$ is connected and $\\gamma(G-v) < \\gamma(G)$ for all $v \\in V(G","authors_text":"Vladimir Samodivkin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-10T17:01:25Z","title":"Hypo-efficient domination and hypo-unique domination"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1601.02234","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:25945ad8f0ec686fd738b82eb32ab33929fa864d10acf46935049b3e492c8e59","target":"record","created_at":"2026-05-18T01:23:06Z","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":"737829aec3fde797a58158a1d070e822c1a5fa45aa2091dc64849e5cee465321","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-01-10T17:01:25Z","title_canon_sha256":"59babcfb4485fb27777a83299ae77692dec6902c5bd4dc8dbc5c0e0abae4e10d"},"schema_version":"1.0","source":{"id":"1601.02234","kind":"arxiv","version":1}},"canonical_sha256":"cf653d390816da7f5440440ee7f48d60cea77853f96bc6ad10c8623a2d9a0bf2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"cf653d390816da7f5440440ee7f48d60cea77853f96bc6ad10c8623a2d9a0bf2","first_computed_at":"2026-05-18T01:23:06.898592Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:23:06.898592Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3R28CihvPFB0Kb8B6DQvhvdqMMvdulnJ7CQg9aCD97h6/VlH8gIM5oM+bLTEG8e7k31n+k1sGTle8Hb/tj5PDw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:23:06.899122Z","signed_message":"canonical_sha256_bytes"},"source_id":"1601.02234","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25945ad8f0ec686fd738b82eb32ab33929fa864d10acf46935049b3e492c8e59","sha256:e67c5dc6a030b9fdf7d5452bc987a7111b6793204a290ca08a8f90f54b439583"],"state_sha256":"6f99cf29f52ee90b78a4e47b4e8a60842a7821a4138d8bfc63389db358cab5a4"}