{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:R424NTRKZUFAFUUD7A3YWDQ73F","short_pith_number":"pith:R424NTRK","canonical_record":{"source":{"id":"1503.00833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T06:44:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bc209c07519010d35d201a0f2179d69a0c0b9e16460ee1df8b6105c74f88af41","abstract_canon_sha256":"f2b1e518c2c1e68fc4c64edbb389c2c74c00d6fc52d3a2f6b87d059986f6486f"},"schema_version":"1.0"},"canonical_sha256":"8f35c6ce2acd0a02d283f8378b0e1fd97151c28b2eb81c2148d89e65ecaf0c85","source":{"kind":"arxiv","id":"1503.00833","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00833","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00833v1","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00833","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"R424NTRKZUFA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R424NTRKZUFAFUUD","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R424NTRK","created_at":"2026-05-18T12:29:39Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:R424NTRKZUFAFUUD7A3YWDQ73F","target":"record","payload":{"canonical_record":{"source":{"id":"1503.00833","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T06:44:38Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"bc209c07519010d35d201a0f2179d69a0c0b9e16460ee1df8b6105c74f88af41","abstract_canon_sha256":"f2b1e518c2c1e68fc4c64edbb389c2c74c00d6fc52d3a2f6b87d059986f6486f"},"schema_version":"1.0"},"canonical_sha256":"8f35c6ce2acd0a02d283f8378b0e1fd97151c28b2eb81c2148d89e65ecaf0c85","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:25:48.271243Z","signature_b64":"/lgztHjmORZt37DtAcpbmRdi7jrqpAmXMOvmqdBz7SvYmPLwQudO+RH/ghd6DAP86zqqh3Rw/QBvVRtSyQRYDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8f35c6ce2acd0a02d283f8378b0e1fd97151c28b2eb81c2148d89e65ecaf0c85","last_reissued_at":"2026-05-18T02:25:48.270814Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:25:48.270814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1503.00833","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-05-18T02:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RjIF/eFNB0mJ374L7ABVJvsnmrpxMchoicbMFQywN1ehCk2AN5BpKHoSINr3xZ67jG4X1XQ+3xsUSgM4iOl9CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:55:08.892640Z"},"content_sha256":"604433c0112926fa79fb16bd0e23a865ed02d1100a341aa91943f8b40b66d275","schema_version":"1.0","event_id":"sha256:604433c0112926fa79fb16bd0e23a865ed02d1100a341aa91943f8b40b66d275"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:R424NTRKZUFAFUUD7A3YWDQ73F","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"The complexity of dominating set reconfiguration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.DM","authors_text":"Akira Suzuki, Amer E. Mouawad, Arash Haddadan, Hirotaka Ono, Naomi Nishimura, Takehiro Ito, Youcef Tebbal","submitted_at":"2015-03-03T06:44:38Z","abstract_excerpt":"Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each dominating set in the sequence is of cardinality at most $k$ and can be obtained from the previous one by either adding or deleting exactly one vertex. This problem is known to be PSPACE-complete in general. In this paper, we study the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem remains PSP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00833","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"},"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-05-18T02:25:48Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RGeuKZVTNUoGKotdjHZgXGyNXrQF+Ko9ldSYsL8vFNQTOFe6A8NaSDumB67V1HyWNZdXQydB0K6mnxjrnn1AAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-22T09:55:08.893025Z"},"content_sha256":"851b8a054edd066779e19712c09ca47393ae8a5ef6018d335a0a36db63055a38","schema_version":"1.0","event_id":"sha256:851b8a054edd066779e19712c09ca47393ae8a5ef6018d335a0a36db63055a38"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/bundle.json","state_url":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/R424NTRKZUFAFUUD7A3YWDQ73F/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-05-22T09:55:08Z","links":{"resolver":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F","bundle":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/bundle.json","state":"https://pith.science/pith/R424NTRKZUFAFUUD7A3YWDQ73F/state.json","well_known_bundle":"https://pith.science/.well-known/pith/R424NTRKZUFAFUUD7A3YWDQ73F/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:R424NTRKZUFAFUUD7A3YWDQ73F","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":"f2b1e518c2c1e68fc4c64edbb389c2c74c00d6fc52d3a2f6b87d059986f6486f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T06:44:38Z","title_canon_sha256":"bc209c07519010d35d201a0f2179d69a0c0b9e16460ee1df8b6105c74f88af41"},"schema_version":"1.0","source":{"id":"1503.00833","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.00833","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"arxiv_version","alias_value":"1503.00833v1","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.00833","created_at":"2026-05-18T02:25:48Z"},{"alias_kind":"pith_short_12","alias_value":"R424NTRKZUFA","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_16","alias_value":"R424NTRKZUFAFUUD","created_at":"2026-05-18T12:29:39Z"},{"alias_kind":"pith_short_8","alias_value":"R424NTRK","created_at":"2026-05-18T12:29:39Z"}],"graph_snapshots":[{"event_id":"sha256:851b8a054edd066779e19712c09ca47393ae8a5ef6018d335a0a36db63055a38","target":"graph","created_at":"2026-05-18T02:25:48Z","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":"Suppose that we are given two dominating sets $D_s$ and $D_t$ of a graph $G$ whose cardinalities are at most a given threshold $k$. Then, we are asked whether there exists a sequence of dominating sets of $G$ between $D_s$ and $D_t$ such that each dominating set in the sequence is of cardinality at most $k$ and can be obtained from the previous one by either adding or deleting exactly one vertex. This problem is known to be PSPACE-complete in general. In this paper, we study the complexity of this decision problem from the viewpoint of graph classes. We first prove that the problem remains PSP","authors_text":"Akira Suzuki, Amer E. Mouawad, Arash Haddadan, Hirotaka Ono, Naomi Nishimura, Takehiro Ito, Youcef Tebbal","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T06:44:38Z","title":"The complexity of dominating set reconfiguration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.00833","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:604433c0112926fa79fb16bd0e23a865ed02d1100a341aa91943f8b40b66d275","target":"record","created_at":"2026-05-18T02:25:48Z","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":"f2b1e518c2c1e68fc4c64edbb389c2c74c00d6fc52d3a2f6b87d059986f6486f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2015-03-03T06:44:38Z","title_canon_sha256":"bc209c07519010d35d201a0f2179d69a0c0b9e16460ee1df8b6105c74f88af41"},"schema_version":"1.0","source":{"id":"1503.00833","kind":"arxiv","version":1}},"canonical_sha256":"8f35c6ce2acd0a02d283f8378b0e1fd97151c28b2eb81c2148d89e65ecaf0c85","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8f35c6ce2acd0a02d283f8378b0e1fd97151c28b2eb81c2148d89e65ecaf0c85","first_computed_at":"2026-05-18T02:25:48.270814Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:25:48.270814Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"/lgztHjmORZt37DtAcpbmRdi7jrqpAmXMOvmqdBz7SvYmPLwQudO+RH/ghd6DAP86zqqh3Rw/QBvVRtSyQRYDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:25:48.271243Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.00833","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:604433c0112926fa79fb16bd0e23a865ed02d1100a341aa91943f8b40b66d275","sha256:851b8a054edd066779e19712c09ca47393ae8a5ef6018d335a0a36db63055a38"],"state_sha256":"17ca9ca2193fa6ad7298f72d1f72d22c1adf51e49f75f35a7fc1e3d78bfd931c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"88B7pYe9RXfJdsksKad1EDc2xIqh3Ji/ZTsE+N6/jN3TRx0n38kJ4n7reyFbaZRJEvHwlrJgmb5hTTmTzboNDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-22T09:55:08.895402Z","bundle_sha256":"2c90d404161d887829d750ea893723fa241a34a7f3d3648a0c064b0b75436379"}}