{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:FESYI7IU5YIJKNUIO5HDXZGYCO","short_pith_number":"pith:FESYI7IU","schema_version":"1.0","canonical_sha256":"2925847d14ee10953688774e3be4d813ad781b49c5ed61b5d938ccc068872122","source":{"kind":"arxiv","id":"2507.11446","version":1},"attestation_state":"computed","paper":{"title":"Lower bounds for dominating set reconfiguration on sparse (directed) graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre Vigny, Jona Dirks","submitted_at":"2025-07-15T16:09:47Z","abstract_excerpt":"In a graph, a vertex dominates itself and its neighbors, and a dominating set is a set of vertices that together dominate the entire graph. Given a graph and two dominating sets of equal size $k$, the {\\em Dominating Set Reconfiguration with Token sliding} (DSR-TS) problem asks whether one can, by iteratively replacing a vertex by an adjacent one, transform the first set into the second one, while ensuring that every set during the reconfiguration process is a dominating set.\n  The token jumping variant, where a vertex can be replaced by a non-adjacent one, is known to be efficiently solvable "},"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":"2507.11446","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-07-15T16:09:47Z","cross_cats_sorted":[],"title_canon_sha256":"b5372f0543f689bd06140e204635c36d244e492d546654754ca146f2de9df2e7","abstract_canon_sha256":"1cfd491b810832248c72b5310196a90d9d1a89c67067e9ec6cede5a201d4da31"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:37:39.451301Z","signature_b64":"D7K88a+LmP8QVFTNYVmkM5AeLBActPrDQdIS1wUgmk7vdv7amaIPMpcGRDzTqkGc10tgLOrxh3o5fuxqo1G0DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2925847d14ee10953688774e3be4d813ad781b49c5ed61b5d938ccc068872122","last_reissued_at":"2026-07-05T11:37:39.450802Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:37:39.450802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Lower bounds for dominating set reconfiguration on sparse (directed) graphs","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Alexandre Vigny, Jona Dirks","submitted_at":"2025-07-15T16:09:47Z","abstract_excerpt":"In a graph, a vertex dominates itself and its neighbors, and a dominating set is a set of vertices that together dominate the entire graph. Given a graph and two dominating sets of equal size $k$, the {\\em Dominating Set Reconfiguration with Token sliding} (DSR-TS) problem asks whether one can, by iteratively replacing a vertex by an adjacent one, transform the first set into the second one, while ensuring that every set during the reconfiguration process is a dominating set.\n  The token jumping variant, where a vertex can be replaced by a non-adjacent one, is known to be efficiently solvable "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11446","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.11446/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2507.11446","created_at":"2026-07-05T11:37:39.450869+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.11446v1","created_at":"2026-07-05T11:37:39.450869+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11446","created_at":"2026-07-05T11:37:39.450869+00:00"},{"alias_kind":"pith_short_12","alias_value":"FESYI7IU5YIJ","created_at":"2026-07-05T11:37:39.450869+00:00"},{"alias_kind":"pith_short_16","alias_value":"FESYI7IU5YIJKNUI","created_at":"2026-07-05T11:37:39.450869+00:00"},{"alias_kind":"pith_short_8","alias_value":"FESYI7IU","created_at":"2026-07-05T11:37:39.450869+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/FESYI7IU5YIJKNUIO5HDXZGYCO","json":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO.json","graph_json":"https://pith.science/api/pith-number/FESYI7IU5YIJKNUIO5HDXZGYCO/graph.json","events_json":"https://pith.science/api/pith-number/FESYI7IU5YIJKNUIO5HDXZGYCO/events.json","paper":"https://pith.science/paper/FESYI7IU"},"agent_actions":{"view_html":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO","download_json":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO.json","view_paper":"https://pith.science/paper/FESYI7IU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.11446&json=true","fetch_graph":"https://pith.science/api/pith-number/FESYI7IU5YIJKNUIO5HDXZGYCO/graph.json","fetch_events":"https://pith.science/api/pith-number/FESYI7IU5YIJKNUIO5HDXZGYCO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/action/storage_attestation","attest_author":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/action/author_attestation","sign_citation":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/action/citation_signature","submit_replication":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/action/replication_record"}},"created_at":"2026-07-05T11:37:39.450869+00:00","updated_at":"2026-07-05T11:37:39.450869+00:00"}