{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:KSZ55VELKB4VKVTU5IWYSDFLCA","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":"a42ea097b3ef3c33c511eafc4065942877638362f9dfdd116309ebab0c7b2f71","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-19T14:45:36Z","title_canon_sha256":"57ab5385783b4a87f083586b66fa89d9518e8b514cdab27a7a2d2cf53b6574a0"},"schema_version":"1.0","source":{"id":"2304.09701","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2304.09701","created_at":"2026-07-05T06:02:41Z"},{"alias_kind":"arxiv_version","alias_value":"2304.09701v1","created_at":"2026-07-05T06:02:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2304.09701","created_at":"2026-07-05T06:02:41Z"},{"alias_kind":"pith_short_12","alias_value":"KSZ55VELKB4V","created_at":"2026-07-05T06:02:41Z"},{"alias_kind":"pith_short_16","alias_value":"KSZ55VELKB4VKVTU","created_at":"2026-07-05T06:02:41Z"},{"alias_kind":"pith_short_8","alias_value":"KSZ55VEL","created_at":"2026-07-05T06:02:41Z"}],"graph_snapshots":[{"event_id":"sha256:afde1c2a0adc72ee07a421b82ae3972c93ab846f046ff390ced2774263013268","target":"graph","created_at":"2026-07-05T06:02:41Z","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/2304.09701/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A set $S\\subseteq V$ of a graph $G=(V,E)$ is a dominating set if each vertex has a neighbor in $S$ or belongs to $S$. Dominating Set is the problem of deciding, given a graph $G$ and an integer $k\\geq 1$, if $G$ has a dominating set of size at most $k$. It is well known that this problem is $\\mathsf{NP}$-complete even for claw-free graphs. We give a complexity dichotomy for Dominating Set for the class of claw-free graphs with diameter $d$. We show that the problem is $\\mathsf{NP}$-complete for every fixed $d\\ge 3$ and polynomial time solvable for $d\\le 2$. To prove the case $d=2$, we show tha","authors_text":"Christophe Picouleau, Fran\\c{c}ois Delbot, St\\'ephane Rovedakis, Valentin Bouquet","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-19T14:45:36Z","title":"On the complexity of Dominating Set for graphs with fixed diameter"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2304.09701","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:79ed7279645ba5f056b4cb4d334cf67f25f82c7306f462d5cdec98162ae67c33","target":"record","created_at":"2026-07-05T06:02:41Z","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":"a42ea097b3ef3c33c511eafc4065942877638362f9dfdd116309ebab0c7b2f71","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2023-04-19T14:45:36Z","title_canon_sha256":"57ab5385783b4a87f083586b66fa89d9518e8b514cdab27a7a2d2cf53b6574a0"},"schema_version":"1.0","source":{"id":"2304.09701","kind":"arxiv","version":1}},"canonical_sha256":"54b3ded48b5079555674ea2d890cab103a2ba30b40ced4987e8b3894d8d58204","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"54b3ded48b5079555674ea2d890cab103a2ba30b40ced4987e8b3894d8d58204","first_computed_at":"2026-07-05T06:02:41.301269Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:02:41.301269Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q2WBC7LTARZxfXpArd6AFVydtl8T/VCndLeZHnud9IgCckQEFFTCHCz9li1nrp07a9t6Gyr3I1ZTD5WpSGjzAQ==","signature_status":"signed_v1","signed_at":"2026-07-05T06:02:41.301718Z","signed_message":"canonical_sha256_bytes"},"source_id":"2304.09701","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:79ed7279645ba5f056b4cb4d334cf67f25f82c7306f462d5cdec98162ae67c33","sha256:afde1c2a0adc72ee07a421b82ae3972c93ab846f046ff390ced2774263013268"],"state_sha256":"fbfdaa01b112df0da455b745dcffc798149a66cb836ca52c779a4c17b2cd76a6"}