{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:CDTXU7SCODDFPIZSYNFN62HX4H","short_pith_number":"pith:CDTXU7SC","schema_version":"1.0","canonical_sha256":"10e77a7e4270c657a332c34adf68f7e1f818624eaa02ceb3eb22ddcf1973a9e3","source":{"kind":"arxiv","id":"1409.1466","version":1},"attestation_state":"computed","paper":{"title":"Well-dominated graphs without cycles of lengths 4 and 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Tankus, Vadim E. Levit","submitted_at":"2014-09-04T15:20:20Z","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 "},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1409.1466","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2014-09-04T15:20:20Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"72cef56e3ac061358c7ae4cc47654c873c8823872ce7e06b78432ddec2ddb638","abstract_canon_sha256":"32761c4c7ab0a5b268aa62758151a84030989ef64a08ad0720d522568f430ddc"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:43:26.872589Z","signature_b64":"QuCvCrqyEo3rJ0/chfBXb4+CuNjRiHXcNWZ8jzaw2PkpAyeq3R/WyL1Ptsqc4xT+O96POFOuILjCOoF8P++vAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"10e77a7e4270c657a332c34adf68f7e1f818624eaa02ceb3eb22ddcf1973a9e3","last_reissued_at":"2026-05-18T02:43:26.871802Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:43:26.871802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Well-dominated graphs without cycles of lengths 4 and 5","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"cs.DM","authors_text":"David Tankus, Vadim E. Levit","submitted_at":"2014-09-04T15:20:20Z","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 "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1409.1466","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1409.1466","created_at":"2026-05-18T02:43:26.871937+00:00"},{"alias_kind":"arxiv_version","alias_value":"1409.1466v1","created_at":"2026-05-18T02:43:26.871937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1409.1466","created_at":"2026-05-18T02:43:26.871937+00:00"},{"alias_kind":"pith_short_12","alias_value":"CDTXU7SCODDF","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_16","alias_value":"CDTXU7SCODDFPIZS","created_at":"2026-05-18T12:28:22.404517+00:00"},{"alias_kind":"pith_short_8","alias_value":"CDTXU7SC","created_at":"2026-05-18T12:28:22.404517+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H","json":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H.json","graph_json":"https://pith.science/api/pith-number/CDTXU7SCODDFPIZSYNFN62HX4H/graph.json","events_json":"https://pith.science/api/pith-number/CDTXU7SCODDFPIZSYNFN62HX4H/events.json","paper":"https://pith.science/paper/CDTXU7SC"},"agent_actions":{"view_html":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H","download_json":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H.json","view_paper":"https://pith.science/paper/CDTXU7SC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1409.1466&json=true","fetch_graph":"https://pith.science/api/pith-number/CDTXU7SCODDFPIZSYNFN62HX4H/graph.json","fetch_events":"https://pith.science/api/pith-number/CDTXU7SCODDFPIZSYNFN62HX4H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H/action/storage_attestation","attest_author":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H/action/author_attestation","sign_citation":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H/action/citation_signature","submit_replication":"https://pith.science/pith/CDTXU7SCODDFPIZSYNFN62HX4H/action/replication_record"}},"created_at":"2026-05-18T02:43:26.871937+00:00","updated_at":"2026-05-18T02:43:26.871937+00:00"}