{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:D3ZPFTVA7JPNJJ4ZVACIFVO2MH","short_pith_number":"pith:D3ZPFTVA","canonical_record":{"source":{"id":"1906.10078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-06-24T16:57:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"230b0bfeea2f7996e912653ed66af979c0d30a2a1f8d3487c8a3714213a44934","abstract_canon_sha256":"8dd113b1ce7d10a98046b64598be63b75e3b5d24bc31f5a34c196105b61057d5"},"schema_version":"1.0"},"canonical_sha256":"1ef2f2cea0fa5ed4a799a80482d5da61dcf1f5c80d8cc11d06a8880083132529","source":{"kind":"arxiv","id":"1906.10078","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10078","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10078v2","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10078","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"D3ZPFTVA7JPN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"D3ZPFTVA7JPNJJ4Z","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"D3ZPFTVA","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:D3ZPFTVA7JPNJJ4ZVACIFVO2MH","target":"record","payload":{"canonical_record":{"source":{"id":"1906.10078","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-06-24T16:57:47Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"230b0bfeea2f7996e912653ed66af979c0d30a2a1f8d3487c8a3714213a44934","abstract_canon_sha256":"8dd113b1ce7d10a98046b64598be63b75e3b5d24bc31f5a34c196105b61057d5"},"schema_version":"1.0"},"canonical_sha256":"1ef2f2cea0fa5ed4a799a80482d5da61dcf1f5c80d8cc11d06a8880083132529","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:42:32.156736Z","signature_b64":"i2Bbbjzq96YYFwqa2TuFDNkmi7DNjXUxzEu8Ujqydfsdp5vAvdsGeDhmt8forHk4z8pWLPF3FwjGF+xJSTmwBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ef2f2cea0fa5ed4a799a80482d5da61dcf1f5c80d8cc11d06a8880083132529","last_reissued_at":"2026-05-17T23:42:32.156131Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:42:32.156131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.10078","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-17T23:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dSIFnQ0PiZXzzL42RJ+3SR+H+yvsl0ZE4nF8jBmitB6VChELnwgJL8QWL2Fs/uhKDhmXFejdOAEJlCyUXuwYBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:15:21.244471Z"},"content_sha256":"c01d2ed3c6b2d416016b93f3351e9ebad5fd8258119bfa62f1f3d1d5560b2e76","schema_version":"1.0","event_id":"sha256:c01d2ed3c6b2d416016b93f3351e9ebad5fd8258119bfa62f1f3d1d5560b2e76"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:D3ZPFTVA7JPNJJ4ZVACIFVO2MH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Finding Optimal Solutions With Neighborly Help","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.CC","authors_text":"David Wehner, Dennis Komm, Edith Hemaspaandra, Elisabet Burjons, Fabian Frei","submitted_at":"2019-06-24T16:57:47Z","abstract_excerpt":"Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal colorings for all one-edge-deleted subgraphs? Studying such questions not only gives detailed insight into the structure of the problem itself, but also into the complexity of related problems; most notably graph theory's core notion of critical graphs (e.g., graphs whose chromatic number decreases under deletion of an arbitrary edge) and the complexity-theoretic"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10078","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-17T23:42:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"otMHgjt2iv3+u82LgT8GcxT2RB9opcUKII4vbCNkaocBKPtGMZAnxUjVyqRDZnM8pLSverKJts9vK0Tgz9XqCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T04:15:21.245137Z"},"content_sha256":"29104b7b724acd45209a8183cbf236e2ce4fca29cf6c620b3457792f042bac70","schema_version":"1.0","event_id":"sha256:29104b7b724acd45209a8183cbf236e2ce4fca29cf6c620b3457792f042bac70"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D3ZPFTVA7JPNJJ4ZVACIFVO2MH/bundle.json","state_url":"https://pith.science/pith/D3ZPFTVA7JPNJJ4ZVACIFVO2MH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D3ZPFTVA7JPNJJ4ZVACIFVO2MH/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-26T04:15:21Z","links":{"resolver":"https://pith.science/pith/D3ZPFTVA7JPNJJ4ZVACIFVO2MH","bundle":"https://pith.science/pith/D3ZPFTVA7JPNJJ4ZVACIFVO2MH/bundle.json","state":"https://pith.science/pith/D3ZPFTVA7JPNJJ4ZVACIFVO2MH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D3ZPFTVA7JPNJJ4ZVACIFVO2MH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:D3ZPFTVA7JPNJJ4ZVACIFVO2MH","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":"8dd113b1ce7d10a98046b64598be63b75e3b5d24bc31f5a34c196105b61057d5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-06-24T16:57:47Z","title_canon_sha256":"230b0bfeea2f7996e912653ed66af979c0d30a2a1f8d3487c8a3714213a44934"},"schema_version":"1.0","source":{"id":"1906.10078","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.10078","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"arxiv_version","alias_value":"1906.10078v2","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.10078","created_at":"2026-05-17T23:42:32Z"},{"alias_kind":"pith_short_12","alias_value":"D3ZPFTVA7JPN","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"D3ZPFTVA7JPNJJ4Z","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"D3ZPFTVA","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:29104b7b724acd45209a8183cbf236e2ce4fca29cf6c620b3457792f042bac70","target":"graph","created_at":"2026-05-17T23:42:32Z","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":"Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighboring (i.e., locally modified) instances? For example, can we efficiently compute an optimal coloring for a graph from optimal colorings for all one-edge-deleted subgraphs? Studying such questions not only gives detailed insight into the structure of the problem itself, but also into the complexity of related problems; most notably graph theory's core notion of critical graphs (e.g., graphs whose chromatic number decreases under deletion of an arbitrary edge) and the complexity-theoretic","authors_text":"David Wehner, Dennis Komm, Edith Hemaspaandra, Elisabet Burjons, Fabian Frei","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-06-24T16:57:47Z","title":"Finding Optimal Solutions With Neighborly Help"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.10078","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:c01d2ed3c6b2d416016b93f3351e9ebad5fd8258119bfa62f1f3d1d5560b2e76","target":"record","created_at":"2026-05-17T23:42:32Z","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":"8dd113b1ce7d10a98046b64598be63b75e3b5d24bc31f5a34c196105b61057d5","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2019-06-24T16:57:47Z","title_canon_sha256":"230b0bfeea2f7996e912653ed66af979c0d30a2a1f8d3487c8a3714213a44934"},"schema_version":"1.0","source":{"id":"1906.10078","kind":"arxiv","version":2}},"canonical_sha256":"1ef2f2cea0fa5ed4a799a80482d5da61dcf1f5c80d8cc11d06a8880083132529","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ef2f2cea0fa5ed4a799a80482d5da61dcf1f5c80d8cc11d06a8880083132529","first_computed_at":"2026-05-17T23:42:32.156131Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:42:32.156131Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"i2Bbbjzq96YYFwqa2TuFDNkmi7DNjXUxzEu8Ujqydfsdp5vAvdsGeDhmt8forHk4z8pWLPF3FwjGF+xJSTmwBQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:42:32.156736Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.10078","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c01d2ed3c6b2d416016b93f3351e9ebad5fd8258119bfa62f1f3d1d5560b2e76","sha256:29104b7b724acd45209a8183cbf236e2ce4fca29cf6c620b3457792f042bac70"],"state_sha256":"fbee92078f603d5c16e70aff02d5c0cc39bf5125c3c4b34ad22a979c267db2cb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mi4q4ji0mS+XsMazLQikM5Zcxih6pXZw3wiGnyWY1txqOOFlVw3FR7u7ME3jj4PrKbZaCuqRqCjYHUOvD8AVAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T04:15:21.248561Z","bundle_sha256":"af1421bb994f19478055d20dfbbf4f1f9529e6af563dab313c4674db7e174cb5"}}