{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:2R5AG334OJ4UHYJSFJK3CTQSPV","short_pith_number":"pith:2R5AG334","canonical_record":{"source":{"id":"1907.06172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-14T06:28:28Z","cross_cats_sorted":[],"title_canon_sha256":"3392ab44f6b0b7ddd3d4e0a9da16cbb0c2844fb946c28e05c8f6978e6a5df83f","abstract_canon_sha256":"4b1437fe7a0a8539a0f350b556713fa63935600d1ac9f688d9f0cbc452c05f30"},"schema_version":"1.0"},"canonical_sha256":"d47a036f7c727943e1322a55b14e127d4c4a6f035133c2a3073a9a54a9a4d209","source":{"kind":"arxiv","id":"1907.06172","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06172","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06172v1","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06172","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"2R5AG334OJ4U","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2R5AG334OJ4UHYJS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2R5AG334","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:2R5AG334OJ4UHYJSFJK3CTQSPV","target":"record","payload":{"canonical_record":{"source":{"id":"1907.06172","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-14T06:28:28Z","cross_cats_sorted":[],"title_canon_sha256":"3392ab44f6b0b7ddd3d4e0a9da16cbb0c2844fb946c28e05c8f6978e6a5df83f","abstract_canon_sha256":"4b1437fe7a0a8539a0f350b556713fa63935600d1ac9f688d9f0cbc452c05f30"},"schema_version":"1.0"},"canonical_sha256":"d47a036f7c727943e1322a55b14e127d4c4a6f035133c2a3073a9a54a9a4d209","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:38.308000Z","signature_b64":"D8n8tEvpSuXrjCgBhVyZK3MTNMktIa5UD9Ra7YRpXxBSkpjSbganHBzU3VARW2BJtOAQ/gZORg32U5qYAdYIAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d47a036f7c727943e1322a55b14e127d4c4a6f035133c2a3073a9a54a9a4d209","last_reissued_at":"2026-05-17T23:40:38.307523Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:38.307523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1907.06172","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-17T23:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"t9iIpztlMAmpJGgEZOqOwVt252URJgz78CgPTdZZ18RsUfE+Funxt5nDlYh/fRg7KeNLHezARX29nvmDooh/Dw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:16.723290Z"},"content_sha256":"d3970eb5258053e3644087a0ddb4a1aacd5f2b4dc442c6dcfce383a58f9b7d20","schema_version":"1.0","event_id":"sha256:d3970eb5258053e3644087a0ddb4a1aacd5f2b4dc442c6dcfce383a58f9b7d20"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:2R5AG334OJ4UHYJSFJK3CTQSPV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On Happy Colorings, Cuts, and Structural Parameterizations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Danil Sagunov, Ivan Bliznets","submitted_at":"2019-07-14T06:28:28Z","abstract_excerpt":"We study the Maximum Happy Vertices and Maximum Happy Edges problems. The former problem is a variant of clusterization, where some vertices have already been assigned to clusters. The second problem gives a natural generalization of Multiway Uncut, which is the complement of the classical Multiway Cut problem. Due to their fundamental role in theory and practice, clusterization and cut problems has always attracted a lot of attention. We establish a new connection between these two classes of problems by providing a reduction between Maximum Happy Vertices and Node Multiway Cut. Moreover, we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06172","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-17T23:40:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HajE7T/uka44P78cxeHTKv6q31hgcHRy5PtOkvfAKW3leovo4GIIQthHlGCsk7RCC8Wu6xXv+zPdy9u2FSTwAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T18:53:16.723808Z"},"content_sha256":"b1c7700649b56d810a55ba074239a02d9e51c4aacf92effd4fc2241667ca9a2d","schema_version":"1.0","event_id":"sha256:b1c7700649b56d810a55ba074239a02d9e51c4aacf92effd4fc2241667ca9a2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2R5AG334OJ4UHYJSFJK3CTQSPV/bundle.json","state_url":"https://pith.science/pith/2R5AG334OJ4UHYJSFJK3CTQSPV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2R5AG334OJ4UHYJSFJK3CTQSPV/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-25T18:53:16Z","links":{"resolver":"https://pith.science/pith/2R5AG334OJ4UHYJSFJK3CTQSPV","bundle":"https://pith.science/pith/2R5AG334OJ4UHYJSFJK3CTQSPV/bundle.json","state":"https://pith.science/pith/2R5AG334OJ4UHYJSFJK3CTQSPV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2R5AG334OJ4UHYJSFJK3CTQSPV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:2R5AG334OJ4UHYJSFJK3CTQSPV","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":"4b1437fe7a0a8539a0f350b556713fa63935600d1ac9f688d9f0cbc452c05f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-14T06:28:28Z","title_canon_sha256":"3392ab44f6b0b7ddd3d4e0a9da16cbb0c2844fb946c28e05c8f6978e6a5df83f"},"schema_version":"1.0","source":{"id":"1907.06172","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1907.06172","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"arxiv_version","alias_value":"1907.06172v1","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.06172","created_at":"2026-05-17T23:40:38Z"},{"alias_kind":"pith_short_12","alias_value":"2R5AG334OJ4U","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"2R5AG334OJ4UHYJS","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"2R5AG334","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:b1c7700649b56d810a55ba074239a02d9e51c4aacf92effd4fc2241667ca9a2d","target":"graph","created_at":"2026-05-17T23:40:38Z","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 study the Maximum Happy Vertices and Maximum Happy Edges problems. The former problem is a variant of clusterization, where some vertices have already been assigned to clusters. The second problem gives a natural generalization of Multiway Uncut, which is the complement of the classical Multiway Cut problem. Due to their fundamental role in theory and practice, clusterization and cut problems has always attracted a lot of attention. We establish a new connection between these two classes of problems by providing a reduction between Maximum Happy Vertices and Node Multiway Cut. Moreover, we ","authors_text":"Danil Sagunov, Ivan Bliznets","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-14T06:28:28Z","title":"On Happy Colorings, Cuts, and Structural Parameterizations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.06172","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:d3970eb5258053e3644087a0ddb4a1aacd5f2b4dc442c6dcfce383a58f9b7d20","target":"record","created_at":"2026-05-17T23:40:38Z","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":"4b1437fe7a0a8539a0f350b556713fa63935600d1ac9f688d9f0cbc452c05f30","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-14T06:28:28Z","title_canon_sha256":"3392ab44f6b0b7ddd3d4e0a9da16cbb0c2844fb946c28e05c8f6978e6a5df83f"},"schema_version":"1.0","source":{"id":"1907.06172","kind":"arxiv","version":1}},"canonical_sha256":"d47a036f7c727943e1322a55b14e127d4c4a6f035133c2a3073a9a54a9a4d209","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d47a036f7c727943e1322a55b14e127d4c4a6f035133c2a3073a9a54a9a4d209","first_computed_at":"2026-05-17T23:40:38.307523Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:38.307523Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8n8tEvpSuXrjCgBhVyZK3MTNMktIa5UD9Ra7YRpXxBSkpjSbganHBzU3VARW2BJtOAQ/gZORg32U5qYAdYIAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:38.308000Z","signed_message":"canonical_sha256_bytes"},"source_id":"1907.06172","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d3970eb5258053e3644087a0ddb4a1aacd5f2b4dc442c6dcfce383a58f9b7d20","sha256:b1c7700649b56d810a55ba074239a02d9e51c4aacf92effd4fc2241667ca9a2d"],"state_sha256":"59f1353c139d1236f9c5c07d82370121c7c0feb039a88fef59a03366c46ee912"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6UVmJxm/SZcjHy0zVI7HBcd1YeShEi9zxi81HzKhOSs+/IcJfcH0IcfMsB+Y28OM/Bl3p6wdVTGHL8WWNbffAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T18:53:16.726907Z","bundle_sha256":"e0c68915b28da0731ac32c30f799ad318230bad626cc14aae9498bdccce1710a"}}