{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:CDTXU7SCODDFPIZSYNFN62HX4H","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":"32761c4c7ab0a5b268aa62758151a84030989ef64a08ad0720d522568f430ddc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T15:20:20Z","title_canon_sha256":"72cef56e3ac061358c7ae4cc47654c873c8823872ce7e06b78432ddec2ddb638"},"schema_version":"1.0","source":{"id":"1409.1466","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1409.1466","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"arxiv_version","alias_value":"1409.1466v1","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1466","created_at":"2026-05-18T02:43:26Z"},{"alias_kind":"pith_short_12","alias_value":"CDTXU7SCODDF","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_16","alias_value":"CDTXU7SCODDFPIZS","created_at":"2026-05-18T12:28:22Z"},{"alias_kind":"pith_short_8","alias_value":"CDTXU7SC","created_at":"2026-05-18T12:28:22Z"}],"graph_snapshots":[{"event_id":"sha256:490fe43c04ef205ef3512653e844339dbfb77fca4d878e75fe97235a3deb9d1f","target":"graph","created_at":"2026-05-18T02:43:26Z","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":"Let $G$ be a graph. A set $S$ of vertices in $G$ dominates the graph if every vertex of $G$ is either in $S$ or a neighbor of a vertex in $S$. Finding a minimal cardinality set which dominates the graph is an NP-complete problem. The graph $G$ is well-dominated if all its minimal dominating sets are of the same cardinality. The complexity status of recognizing well-dominated graphs is not known. We show that recognizing well-dominated graphs can be done polynomially for graphs without cycles of lengths $4$ and $5$, by proving that a graph belonging to this family is well-dominated if and only ","authors_text":"David Tankus, Vadim E. Levit","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T15:20:20Z","title":"Well-dominated graphs without cycles of lengths 4 and 5"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1466","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:2e7603a684483f363630605b9680ef9d2273b7e80b16714f5aa0c5946cc16a54","target":"record","created_at":"2026-05-18T02:43:26Z","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":"32761c4c7ab0a5b268aa62758151a84030989ef64a08ad0720d522568f430ddc","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T15:20:20Z","title_canon_sha256":"72cef56e3ac061358c7ae4cc47654c873c8823872ce7e06b78432ddec2ddb638"},"schema_version":"1.0","source":{"id":"1409.1466","kind":"arxiv","version":1}},"canonical_sha256":"10e77a7e4270c657a332c34adf68f7e1f818624eaa02ceb3eb22ddcf1973a9e3","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"10e77a7e4270c657a332c34adf68f7e1f818624eaa02ceb3eb22ddcf1973a9e3","first_computed_at":"2026-05-18T02:43:26.871802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:43:26.871802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QuCvCrqyEo3rJ0/chfBXb4+CuNjRiHXcNWZ8jzaw2PkpAyeq3R/WyL1Ptsqc4xT+O96POFOuILjCOoF8P++vAw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:43:26.872589Z","signed_message":"canonical_sha256_bytes"},"source_id":"1409.1466","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2e7603a684483f363630605b9680ef9d2273b7e80b16714f5aa0c5946cc16a54","sha256:490fe43c04ef205ef3512653e844339dbfb77fca4d878e75fe97235a3deb9d1f"],"state_sha256":"7137a1b7dc76834100dc29b4548ef70227905e909c2a4b03dd01106514bc1956"}