{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:FESYI7IU5YIJKNUIO5HDXZGYCO","short_pith_number":"pith:FESYI7IU","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"},"canonical_sha256":"2925847d14ee10953688774e3be4d813ad781b49c5ed61b5d938ccc068872122","source":{"kind":"arxiv","id":"2507.11446","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11446","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11446v1","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11446","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"FESYI7IU5YIJ","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_16","alias_value":"FESYI7IU5YIJKNUI","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_8","alias_value":"FESYI7IU","created_at":"2026-07-05T11:37:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:FESYI7IU5YIJKNUIO5HDXZGYCO","target":"record","payload":{"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"},"canonical_sha256":"2925847d14ee10953688774e3be4d813ad781b49c5ed61b5d938ccc068872122","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"},"source_kind":"arxiv","source_id":"2507.11446","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5/5h04kDGfiFbkJQB4v/K0UI7+2C4ZYpKfXR3yc8JAQnfVtAJq2z1pEGCTpXfx1FXXACVqvd3MbR/BGj+BmNDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:12:52.722805Z"},"content_sha256":"0ee119b7fbe4a2094b0337a45e1d17e060d40c0d32e07ec820a3994a9c08d375","schema_version":"1.0","event_id":"sha256:0ee119b7fbe4a2094b0337a45e1d17e060d40c0d32e07ec820a3994a9c08d375"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:FESYI7IU5YIJKNUIO5HDXZGYCO","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T11:37:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UhGm8iw80WysTQNfB2gBWJ4N3+2Prcp2/oLEbqQv7CNZqBzjyXqRFv8knLlo3cKZrGau9uvp/P2YfoYjJBfrBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-09T23:12:52.723756Z"},"content_sha256":"6b0e5f8901c8e7939426e7b7768c2b96081d3318b8e814262110e857940e1789","schema_version":"1.0","event_id":"sha256:6b0e5f8901c8e7939426e7b7768c2b96081d3318b8e814262110e857940e1789"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/bundle.json","state_url":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-09T23:12:52Z","links":{"resolver":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO","bundle":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/bundle.json","state":"https://pith.science/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FESYI7IU5YIJKNUIO5HDXZGYCO/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:FESYI7IU5YIJKNUIO5HDXZGYCO","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":"1cfd491b810832248c72b5310196a90d9d1a89c67067e9ec6cede5a201d4da31","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-07-15T16:09:47Z","title_canon_sha256":"b5372f0543f689bd06140e204635c36d244e492d546654754ca146f2de9df2e7"},"schema_version":"1.0","source":{"id":"2507.11446","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.11446","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"arxiv_version","alias_value":"2507.11446v1","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.11446","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_12","alias_value":"FESYI7IU5YIJ","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_16","alias_value":"FESYI7IU5YIJKNUI","created_at":"2026-07-05T11:37:39Z"},{"alias_kind":"pith_short_8","alias_value":"FESYI7IU","created_at":"2026-07-05T11:37:39Z"}],"graph_snapshots":[{"event_id":"sha256:6b0e5f8901c8e7939426e7b7768c2b96081d3318b8e814262110e857940e1789","target":"graph","created_at":"2026-07-05T11:37:39Z","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/2507.11446/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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 ","authors_text":"Alexandre Vigny, Jona Dirks","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-07-15T16:09:47Z","title":"Lower bounds for dominating set reconfiguration on sparse (directed) graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.11446","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:0ee119b7fbe4a2094b0337a45e1d17e060d40c0d32e07ec820a3994a9c08d375","target":"record","created_at":"2026-07-05T11:37:39Z","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":"1cfd491b810832248c72b5310196a90d9d1a89c67067e9ec6cede5a201d4da31","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.DM","submitted_at":"2025-07-15T16:09:47Z","title_canon_sha256":"b5372f0543f689bd06140e204635c36d244e492d546654754ca146f2de9df2e7"},"schema_version":"1.0","source":{"id":"2507.11446","kind":"arxiv","version":1}},"canonical_sha256":"2925847d14ee10953688774e3be4d813ad781b49c5ed61b5d938ccc068872122","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2925847d14ee10953688774e3be4d813ad781b49c5ed61b5d938ccc068872122","first_computed_at":"2026-07-05T11:37:39.450802Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:37:39.450802Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D7K88a+LmP8QVFTNYVmkM5AeLBActPrDQdIS1wUgmk7vdv7amaIPMpcGRDzTqkGc10tgLOrxh3o5fuxqo1G0DA==","signature_status":"signed_v1","signed_at":"2026-07-05T11:37:39.451301Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.11446","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0ee119b7fbe4a2094b0337a45e1d17e060d40c0d32e07ec820a3994a9c08d375","sha256:6b0e5f8901c8e7939426e7b7768c2b96081d3318b8e814262110e857940e1789"],"state_sha256":"95f70e3dfa768df57f26dd8ab3da08120d6dfb8b3a46be885e3914a040d56c6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TYAa/34MT831v87bFJ9CvF1U/yzFkNE1cEr206SP6n4YhDK/4UrDMmU5Y5EsU1T+pCqM04Unvvthgbdz3nbVDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-09T23:12:52.729849Z","bundle_sha256":"43addee890bed7163de7580d5a793d0d5da3d0de39a11ff460d91ebcfe666fd7"}}