{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:QWPIXNSTTTIZ6EL2KDWP75VYK6","short_pith_number":"pith:QWPIXNST","canonical_record":{"source":{"id":"1906.05422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T23:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"82a9ccbcf71aae72669fbde62f0dda814ae02bc2b10cb64466da6decae20eaf3","abstract_canon_sha256":"17ecc9f86b0ea9235e5f58a1a0ff178d6329049a7ac80ced3ad82fc8b454e852"},"schema_version":"1.0"},"canonical_sha256":"859e8bb6539cd19f117a50ecfff6b8579786f91b4b19f1ff63f307e999767d6c","source":{"kind":"arxiv","id":"1906.05422","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05422","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05422v3","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05422","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"QWPIXNSTTTIZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QWPIXNSTTTIZ6EL2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QWPIXNST","created_at":"2026-05-18T12:33:27Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:QWPIXNSTTTIZ6EL2KDWP75VYK6","target":"record","payload":{"canonical_record":{"source":{"id":"1906.05422","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T23:28:07Z","cross_cats_sorted":[],"title_canon_sha256":"82a9ccbcf71aae72669fbde62f0dda814ae02bc2b10cb64466da6decae20eaf3","abstract_canon_sha256":"17ecc9f86b0ea9235e5f58a1a0ff178d6329049a7ac80ced3ad82fc8b454e852"},"schema_version":"1.0"},"canonical_sha256":"859e8bb6539cd19f117a50ecfff6b8579786f91b4b19f1ff63f307e999767d6c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:55.015031Z","signature_b64":"gr3HIlY7Y4sbyOLr/nQlYYwu6/oCnTiQeA1sSrixYniIfHyxvl1LuPYCK7uhvn/fkW6xoURsE/CZCsMQIFCvCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"859e8bb6539cd19f117a50ecfff6b8579786f91b4b19f1ff63f307e999767d6c","last_reissued_at":"2026-05-17T23:40:55.014424Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:55.014424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1906.05422","source_version":3,"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:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bKW4ZProutRqw8g5drCGwAiqPPOGUNfhCfT3j2csDmUKpGr4xUEGF2ZcsycS0fVEJOdAekE/zBo9pDjtb/fwDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:29.013199Z"},"content_sha256":"b781687fc5d3a4095c70b31737e1c4160e586d648689cfa2beb85df66ed4053a","schema_version":"1.0","event_id":"sha256:b781687fc5d3a4095c70b31737e1c4160e586d648689cfa2beb85df66ed4053a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:QWPIXNSTTTIZ6EL2KDWP75VYK6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lower Bounds for the Happy Coloring Problems","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-06-12T23:28:07Z","abstract_excerpt":"In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were studied in Agrawal '17, Aravind et al. '16, Choudhari and Reddy '18, Misra and Reddy '17. Main focus of our work is lower bounds on the computational complexity of these problems. Established lower bounds can be divided into the following groups: NP-hardness of the above guarantee parameterization, kernelization lower bounds (answering questions of Misra and Reddy '17), exponential lower bounds under the Set Cover Con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05422","kind":"arxiv","version":3},"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:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5aAZwD9Z8HDAR3WZC3ZpeXRAhw5TO+u2W7ZhV6omf+1Xf1134LzCDowZ7CX+U7IiPSf/b1lPEuzMB5wSDKcTBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T20:08:29.013860Z"},"content_sha256":"5ae78b859363a55d8cbe0fc110c70b86e4af8b91563dca221a4ab8cb70a6c270","schema_version":"1.0","event_id":"sha256:5ae78b859363a55d8cbe0fc110c70b86e4af8b91563dca221a4ab8cb70a6c270"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QWPIXNSTTTIZ6EL2KDWP75VYK6/bundle.json","state_url":"https://pith.science/pith/QWPIXNSTTTIZ6EL2KDWP75VYK6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QWPIXNSTTTIZ6EL2KDWP75VYK6/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-31T20:08:29Z","links":{"resolver":"https://pith.science/pith/QWPIXNSTTTIZ6EL2KDWP75VYK6","bundle":"https://pith.science/pith/QWPIXNSTTTIZ6EL2KDWP75VYK6/bundle.json","state":"https://pith.science/pith/QWPIXNSTTTIZ6EL2KDWP75VYK6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QWPIXNSTTTIZ6EL2KDWP75VYK6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:QWPIXNSTTTIZ6EL2KDWP75VYK6","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":"17ecc9f86b0ea9235e5f58a1a0ff178d6329049a7ac80ced3ad82fc8b454e852","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T23:28:07Z","title_canon_sha256":"82a9ccbcf71aae72669fbde62f0dda814ae02bc2b10cb64466da6decae20eaf3"},"schema_version":"1.0","source":{"id":"1906.05422","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1906.05422","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"arxiv_version","alias_value":"1906.05422v3","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1906.05422","created_at":"2026-05-17T23:40:55Z"},{"alias_kind":"pith_short_12","alias_value":"QWPIXNSTTTIZ","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_16","alias_value":"QWPIXNSTTTIZ6EL2","created_at":"2026-05-18T12:33:27Z"},{"alias_kind":"pith_short_8","alias_value":"QWPIXNST","created_at":"2026-05-18T12:33:27Z"}],"graph_snapshots":[{"event_id":"sha256:5ae78b859363a55d8cbe0fc110c70b86e4af8b91563dca221a4ab8cb70a6c270","target":"graph","created_at":"2026-05-17T23:40:55Z","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":"In this paper, we study the Maximum Happy Vertices and the Maximum Happy Edges problems (MHV and MHE for short). Very recently, the problems attracted a lot of attention and were studied in Agrawal '17, Aravind et al. '16, Choudhari and Reddy '18, Misra and Reddy '17. Main focus of our work is lower bounds on the computational complexity of these problems. Established lower bounds can be divided into the following groups: NP-hardness of the above guarantee parameterization, kernelization lower bounds (answering questions of Misra and Reddy '17), exponential lower bounds under the Set Cover Con","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-06-12T23:28:07Z","title":"Lower Bounds for the Happy Coloring Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1906.05422","kind":"arxiv","version":3},"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:b781687fc5d3a4095c70b31737e1c4160e586d648689cfa2beb85df66ed4053a","target":"record","created_at":"2026-05-17T23:40:55Z","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":"17ecc9f86b0ea9235e5f58a1a0ff178d6329049a7ac80ced3ad82fc8b454e852","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-06-12T23:28:07Z","title_canon_sha256":"82a9ccbcf71aae72669fbde62f0dda814ae02bc2b10cb64466da6decae20eaf3"},"schema_version":"1.0","source":{"id":"1906.05422","kind":"arxiv","version":3}},"canonical_sha256":"859e8bb6539cd19f117a50ecfff6b8579786f91b4b19f1ff63f307e999767d6c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"859e8bb6539cd19f117a50ecfff6b8579786f91b4b19f1ff63f307e999767d6c","first_computed_at":"2026-05-17T23:40:55.014424Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:40:55.014424Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"gr3HIlY7Y4sbyOLr/nQlYYwu6/oCnTiQeA1sSrixYniIfHyxvl1LuPYCK7uhvn/fkW6xoURsE/CZCsMQIFCvCw==","signature_status":"signed_v1","signed_at":"2026-05-17T23:40:55.015031Z","signed_message":"canonical_sha256_bytes"},"source_id":"1906.05422","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b781687fc5d3a4095c70b31737e1c4160e586d648689cfa2beb85df66ed4053a","sha256:5ae78b859363a55d8cbe0fc110c70b86e4af8b91563dca221a4ab8cb70a6c270"],"state_sha256":"f8184f748e3c5a74d35a34ffb9ea66091e5bc4142120a8b525075e3c79b2e22d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"RNg3PaE7WHr+b4c8d8GPwHB5B0qVQj60IMk5D7ScbEbn5TwQW/3Q0Cp/AUBDe25KqGvGwpVNKPvpq1l/3GPsBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T20:08:29.017431Z","bundle_sha256":"01d37e322f3c7f7611a838e34263ff9d80d65cdd15703ffe35fca863e52a41f2"}}