{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:TTWDXWIOIAFCAOPEOXFF7GTEM5","short_pith_number":"pith:TTWDXWIO","canonical_record":{"source":{"id":"2606.30298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T13:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"3d2218edd7adb7be9048601c3181e04504312c568639724a7731307e2d8ebe5a","abstract_canon_sha256":"49a7797bde367f9b330fde230e91b792733b954cb3a56fd21dee5446ddad473b"},"schema_version":"1.0"},"canonical_sha256":"9cec3bd90e400a2039e475ca5f9a64674e60a106ff9d2275da4fd370ed28487f","source":{"kind":"arxiv","id":"2606.30298","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30298","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30298v1","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30298","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"TTWDXWIOIAFC","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"TTWDXWIOIAFCAOPE","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"TTWDXWIO","created_at":"2026-06-30T02:17:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:TTWDXWIOIAFCAOPEOXFF7GTEM5","target":"record","payload":{"canonical_record":{"source":{"id":"2606.30298","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T13:40:41Z","cross_cats_sorted":[],"title_canon_sha256":"3d2218edd7adb7be9048601c3181e04504312c568639724a7731307e2d8ebe5a","abstract_canon_sha256":"49a7797bde367f9b330fde230e91b792733b954cb3a56fd21dee5446ddad473b"},"schema_version":"1.0"},"canonical_sha256":"9cec3bd90e400a2039e475ca5f9a64674e60a106ff9d2275da4fd370ed28487f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-30T02:17:57.916145Z","signature_b64":"G6Q+mmvV0TDR2mnXTFYsvqLrTUlOEmRwAbZ71aelxL4NiztnR0nqn5llo0ZBstNVH28nNEchpR6+ayO5E2gBBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9cec3bd90e400a2039e475ca5f9a64674e60a106ff9d2275da4fd370ed28487f","last_reissued_at":"2026-06-30T02:17:57.915409Z","signature_status":"signed_v1","first_computed_at":"2026-06-30T02:17:57.915409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2606.30298","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-06-30T02:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VBahrJ28I+fZ/ZkZZ9Hm/cWMmIkdY4016S/PUxnX6ksxX6+qKwo7/Pxqw9TBgXT/Aryxf+6ueV07BH9xgDrABA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:33:56.980212Z"},"content_sha256":"8a94128e8fc95b3797eaac2638a1240885f7a859fdc2e2c72610ecefba3342db","schema_version":"1.0","event_id":"sha256:8a94128e8fc95b3797eaac2638a1240885f7a859fdc2e2c72610ecefba3342db"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:TTWDXWIOIAFCAOPEOXFF7GTEM5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Convex Recoloring of General Graphs: Formulations, Polyhedra, and Computational Experiments","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DM","authors_text":"Boyue Lin, Phablo F. S. Moura, Roel Leus","submitted_at":"2026-06-29T13:40:41Z","abstract_excerpt":"A vertex coloring of a graph is convex if the vertices of each color induce a connected subgraph. In the convex recoloring problem (CR), the goal is to find a convex coloring while minimizing the weight of recolored vertices, i.e., vertices assigned a color different from their original one. This problem was originally motivated by the study of phylogenetic trees in bioinformatics and is NP-hard even on paths. Most existing research focuses on trees, with only limited results available for general graphs. We advance the state of the art by developing exact solution methods for CR on general gr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30298","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/2606.30298/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-06-30T02:17:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"TfByNDtDl0jbhIO0iBfcW4d2Jj6CJCn+myokvu5selBNARme9R8QncEQJTUEtbW3V57HHlqLmsF9dwDHKQEQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T10:33:56.980594Z"},"content_sha256":"63b99118460d4b58e5d62f885cc299f4f0966bb4751fdf7aa772efd3cdb6eb6c","schema_version":"1.0","event_id":"sha256:63b99118460d4b58e5d62f885cc299f4f0966bb4751fdf7aa772efd3cdb6eb6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TTWDXWIOIAFCAOPEOXFF7GTEM5/bundle.json","state_url":"https://pith.science/pith/TTWDXWIOIAFCAOPEOXFF7GTEM5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TTWDXWIOIAFCAOPEOXFF7GTEM5/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-30T10:33:56Z","links":{"resolver":"https://pith.science/pith/TTWDXWIOIAFCAOPEOXFF7GTEM5","bundle":"https://pith.science/pith/TTWDXWIOIAFCAOPEOXFF7GTEM5/bundle.json","state":"https://pith.science/pith/TTWDXWIOIAFCAOPEOXFF7GTEM5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TTWDXWIOIAFCAOPEOXFF7GTEM5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:TTWDXWIOIAFCAOPEOXFF7GTEM5","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":"49a7797bde367f9b330fde230e91b792733b954cb3a56fd21dee5446ddad473b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T13:40:41Z","title_canon_sha256":"3d2218edd7adb7be9048601c3181e04504312c568639724a7731307e2d8ebe5a"},"schema_version":"1.0","source":{"id":"2606.30298","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2606.30298","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"arxiv_version","alias_value":"2606.30298v1","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.30298","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_12","alias_value":"TTWDXWIOIAFC","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_16","alias_value":"TTWDXWIOIAFCAOPE","created_at":"2026-06-30T02:17:57Z"},{"alias_kind":"pith_short_8","alias_value":"TTWDXWIO","created_at":"2026-06-30T02:17:57Z"}],"graph_snapshots":[{"event_id":"sha256:63b99118460d4b58e5d62f885cc299f4f0966bb4751fdf7aa772efd3cdb6eb6c","target":"graph","created_at":"2026-06-30T02:17: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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2606.30298/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A vertex coloring of a graph is convex if the vertices of each color induce a connected subgraph. In the convex recoloring problem (CR), the goal is to find a convex coloring while minimizing the weight of recolored vertices, i.e., vertices assigned a color different from their original one. This problem was originally motivated by the study of phylogenetic trees in bioinformatics and is NP-hard even on paths. Most existing research focuses on trees, with only limited results available for general graphs. We advance the state of the art by developing exact solution methods for CR on general gr","authors_text":"Boyue Lin, Phablo F. S. Moura, Roel Leus","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T13:40:41Z","title":"Convex Recoloring of General Graphs: Formulations, Polyhedra, and Computational Experiments"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.30298","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:8a94128e8fc95b3797eaac2638a1240885f7a859fdc2e2c72610ecefba3342db","target":"record","created_at":"2026-06-30T02:17: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":"49a7797bde367f9b330fde230e91b792733b954cb3a56fd21dee5446ddad473b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2026-06-29T13:40:41Z","title_canon_sha256":"3d2218edd7adb7be9048601c3181e04504312c568639724a7731307e2d8ebe5a"},"schema_version":"1.0","source":{"id":"2606.30298","kind":"arxiv","version":1}},"canonical_sha256":"9cec3bd90e400a2039e475ca5f9a64674e60a106ff9d2275da4fd370ed28487f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9cec3bd90e400a2039e475ca5f9a64674e60a106ff9d2275da4fd370ed28487f","first_computed_at":"2026-06-30T02:17:57.915409Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-06-30T02:17:57.915409Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"G6Q+mmvV0TDR2mnXTFYsvqLrTUlOEmRwAbZ71aelxL4NiztnR0nqn5llo0ZBstNVH28nNEchpR6+ayO5E2gBBg==","signature_status":"signed_v1","signed_at":"2026-06-30T02:17:57.916145Z","signed_message":"canonical_sha256_bytes"},"source_id":"2606.30298","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8a94128e8fc95b3797eaac2638a1240885f7a859fdc2e2c72610ecefba3342db","sha256:63b99118460d4b58e5d62f885cc299f4f0966bb4751fdf7aa772efd3cdb6eb6c"],"state_sha256":"f3f93fba26cb54abe55d4160ad0da45d123bb3aa2375aa9632367f8307b6165d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJSFSXewByTxQBhLvkVKducJiltpWBQRWpO4GGk4w7/yKR6xdcaZgZmyfrldFjr/qiGpgVNiwDZS85alpT3vDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T10:33:56.982540Z","bundle_sha256":"1263ae220bd332122d1c53de100e00466240b3a0912e58cb429c02feea8fcf4a"}}