{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4UI5D4RUKJZJRAGCXQQSFBIEIA","short_pith_number":"pith:4UI5D4RU","canonical_record":{"source":{"id":"1509.06357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T19:35:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"eb8956c5202bdc6cb89726b2d075652fd07b04daa851cd8a769027b98dc4b83f","abstract_canon_sha256":"db72e8618ed7fd797fe041e6ead8a83b9cbba57f4d17831f9f1066dd730746e6"},"schema_version":"1.0"},"canonical_sha256":"e511d1f23452729880c2bc212285044030b42c20403e834c3334da3abe917d18","source":{"kind":"arxiv","id":"1509.06357","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06357","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06357v2","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06357","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"4UI5D4RUKJZJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UI5D4RUKJZJRAGC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UI5D4RU","created_at":"2026-05-18T12:29:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4UI5D4RUKJZJRAGCXQQSFBIEIA","target":"record","payload":{"canonical_record":{"source":{"id":"1509.06357","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T19:35:26Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"eb8956c5202bdc6cb89726b2d075652fd07b04daa851cd8a769027b98dc4b83f","abstract_canon_sha256":"db72e8618ed7fd797fe041e6ead8a83b9cbba57f4d17831f9f1066dd730746e6"},"schema_version":"1.0"},"canonical_sha256":"e511d1f23452729880c2bc212285044030b42c20403e834c3334da3abe917d18","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:10:57.431584Z","signature_b64":"NhgVbRMRYQ3TIYKQuEXujxjtZPHmuGc1GupPX3zpAj18JE7WMyjUT69C6/WzYx94dzwZmQ3V0LXoDvr94dN1Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e511d1f23452729880c2bc212285044030b42c20403e834c3334da3abe917d18","last_reissued_at":"2026-05-18T00:10:57.430804Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:10:57.430804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1509.06357","source_version":2,"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-18T00:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4zGzmSZxdd/Cc8Cv0wwl2R5atMk3f2aFbFepMxI/nBxdXQ/b309dWMdZOpaymXeKD5yoQjaTaUZqyTE+zLOCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:28:51.417968Z"},"content_sha256":"0d818c3d563910afb9e07085de6593c1e4a72cafe3c5f31e19719d41164a8973","schema_version":"1.0","event_id":"sha256:0d818c3d563910afb9e07085de6593c1e4a72cafe3c5f31e19719d41164a8973"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4UI5D4RUKJZJRAGCXQQSFBIEIA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using Contracted Solution Graphs for Solving Reconfiguration Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Daniel Paulusma, Paul Bonsma","submitted_at":"2015-09-21T19:35:26Z","abstract_excerpt":"We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge contractions that decrease the graph size without losing any critical information needed to solve the reconfiguration problem under consideration. Our general framework captures the approach behind known reconfiguration results of Bonsma (2012) and Hatanaka, Ito and Zhou (2014). As a third example, we apply the method to the following problem: given two $k$-colo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06357","kind":"arxiv","version":2},"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-18T00:10:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vlH+12zBOZpov8h3xRPYGbGBQDs8nvgfehV15RRJsySZXAJTLeS6D80hsg/fzvmLI+FS0lxwa1mXSpha7OemBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-20T22:28:51.418332Z"},"content_sha256":"de470198f7997200281935a589f7c902fda42b63566aa84386db2bd46945fa21","schema_version":"1.0","event_id":"sha256:de470198f7997200281935a589f7c902fda42b63566aa84386db2bd46945fa21"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4UI5D4RUKJZJRAGCXQQSFBIEIA/bundle.json","state_url":"https://pith.science/pith/4UI5D4RUKJZJRAGCXQQSFBIEIA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4UI5D4RUKJZJRAGCXQQSFBIEIA/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-06-20T22:28:51Z","links":{"resolver":"https://pith.science/pith/4UI5D4RUKJZJRAGCXQQSFBIEIA","bundle":"https://pith.science/pith/4UI5D4RUKJZJRAGCXQQSFBIEIA/bundle.json","state":"https://pith.science/pith/4UI5D4RUKJZJRAGCXQQSFBIEIA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4UI5D4RUKJZJRAGCXQQSFBIEIA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4UI5D4RUKJZJRAGCXQQSFBIEIA","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":"db72e8618ed7fd797fe041e6ead8a83b9cbba57f4d17831f9f1066dd730746e6","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T19:35:26Z","title_canon_sha256":"eb8956c5202bdc6cb89726b2d075652fd07b04daa851cd8a769027b98dc4b83f"},"schema_version":"1.0","source":{"id":"1509.06357","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1509.06357","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"arxiv_version","alias_value":"1509.06357v2","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1509.06357","created_at":"2026-05-18T00:10:57Z"},{"alias_kind":"pith_short_12","alias_value":"4UI5D4RUKJZJ","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_16","alias_value":"4UI5D4RUKJZJRAGC","created_at":"2026-05-18T12:29:05Z"},{"alias_kind":"pith_short_8","alias_value":"4UI5D4RU","created_at":"2026-05-18T12:29:05Z"}],"graph_snapshots":[{"event_id":"sha256:de470198f7997200281935a589f7c902fda42b63566aa84386db2bd46945fa21","target":"graph","created_at":"2026-05-18T00:10:57Z","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":"We introduce in a general setting a dynamic programming method for solving reconfiguration problems. Our method is based on contracted solution graphs, which are obtained from solution graphs by performing an appropriate series of edge contractions that decrease the graph size without losing any critical information needed to solve the reconfiguration problem under consideration. Our general framework captures the approach behind known reconfiguration results of Bonsma (2012) and Hatanaka, Ito and Zhou (2014). As a third example, we apply the method to the following problem: given two $k$-colo","authors_text":"Daniel Paulusma, Paul Bonsma","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T19:35:26Z","title":"Using Contracted Solution Graphs for Solving Reconfiguration Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1509.06357","kind":"arxiv","version":2},"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:0d818c3d563910afb9e07085de6593c1e4a72cafe3c5f31e19719d41164a8973","target":"record","created_at":"2026-05-18T00:10:57Z","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":"db72e8618ed7fd797fe041e6ead8a83b9cbba57f4d17831f9f1066dd730746e6","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-09-21T19:35:26Z","title_canon_sha256":"eb8956c5202bdc6cb89726b2d075652fd07b04daa851cd8a769027b98dc4b83f"},"schema_version":"1.0","source":{"id":"1509.06357","kind":"arxiv","version":2}},"canonical_sha256":"e511d1f23452729880c2bc212285044030b42c20403e834c3334da3abe917d18","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e511d1f23452729880c2bc212285044030b42c20403e834c3334da3abe917d18","first_computed_at":"2026-05-18T00:10:57.430804Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:10:57.430804Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NhgVbRMRYQ3TIYKQuEXujxjtZPHmuGc1GupPX3zpAj18JE7WMyjUT69C6/WzYx94dzwZmQ3V0LXoDvr94dN1Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:10:57.431584Z","signed_message":"canonical_sha256_bytes"},"source_id":"1509.06357","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d818c3d563910afb9e07085de6593c1e4a72cafe3c5f31e19719d41164a8973","sha256:de470198f7997200281935a589f7c902fda42b63566aa84386db2bd46945fa21"],"state_sha256":"fd00d3baf45785abd48d5b1704110cfde57c9cdb1936ce53b00b231a22b39c70"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"I90UVBZgCK9n8JIybBWBuOuKO3wN3kWAJar+RuPBOVHssUUu21w/IYCnV9swy6/ENmrWAz9gN0mHitvtIUqZCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-20T22:28:51.420529Z","bundle_sha256":"baeac61e1230fb684edc54a2c7de3f4c0d1cc9fb035da980f3239bcb9ccd286b"}}