{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:S57K5C236QPK3FIW3IQ2REJMR4","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":"7d1b12e55bb7ea5a5115a1d7a3dbd0dd4d60c9bd003bcb99db14791fb4926d0d","cross_cats_sorted":["cs.DS","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-19T11:49:02Z","title_canon_sha256":"a6400e29935e5dff23c55153084868b6a17069b718f0e35ff56c1b061591b743"},"schema_version":"1.0","source":{"id":"1803.06878","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1803.06878","created_at":"2026-07-05T01:08:57Z"},{"alias_kind":"arxiv_version","alias_value":"1803.06878v4","created_at":"2026-07-05T01:08:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06878","created_at":"2026-07-05T01:08:57Z"},{"alias_kind":"pith_short_12","alias_value":"S57K5C236QPK","created_at":"2026-07-05T01:08:57Z"},{"alias_kind":"pith_short_16","alias_value":"S57K5C236QPK3FIW","created_at":"2026-07-05T01:08:57Z"},{"alias_kind":"pith_short_8","alias_value":"S57K5C23","created_at":"2026-07-05T01:08:57Z"}],"graph_snapshots":[{"event_id":"sha256:77d3bfe511ee3734afa6bbb9e6f9c60f015c125c02bf439e2bf97598a3868d4f","target":"graph","created_at":"2026-07-05T01:08: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/1803.06878/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A prototypical graph problem is centered around a graph-theoretic property for a set of vertices and a solution to it is a set of vertices for which the desired property holds. The task is to decide whether, in the given graph, there exists a solution of a certain quality, where we use size as a quality measure. In this work, we are changing the measure to the fair measure [Lin&Sahni: Fair edge deletion problems. IEEE Trans. Comput. 89]. The measure is k if the number of solution neighbors does not exceed k for any vertex in the graph. One possible way to study graph problems is by defining th","authors_text":"Du\\v{s}an Knop, Tom\\'a\\v{s} Masa\\v{r}\\'ik, Tom\\'a\\v{s} Toufar","cross_cats":["cs.DS","cs.LO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-19T11:49:02Z","title":"Parameterized Complexity of Fair Vertex Evaluation Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06878","kind":"arxiv","version":4},"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:6c8a3b765f64fa709d7fb433993b7ff69cc17582efd86074df137884cdcbe8c4","target":"record","created_at":"2026-07-05T01:08: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":"7d1b12e55bb7ea5a5115a1d7a3dbd0dd4d60c9bd003bcb99db14791fb4926d0d","cross_cats_sorted":["cs.DS","cs.LO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-19T11:49:02Z","title_canon_sha256":"a6400e29935e5dff23c55153084868b6a17069b718f0e35ff56c1b061591b743"},"schema_version":"1.0","source":{"id":"1803.06878","kind":"arxiv","version":4}},"canonical_sha256":"977eae8b5bf41ead9516da21a8912c8f39621941ec047482432bdee39d0b570a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"977eae8b5bf41ead9516da21a8912c8f39621941ec047482432bdee39d0b570a","first_computed_at":"2026-07-05T01:08:57.637638Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T01:08:57.637638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"VPs389kNVcQTNhtNewXJd65tjtlzmcmpVfXdDWWEUsmUVnDrnGaSdBx4EPq7PnX92nM7Nr93qyMVmdKQbLHBCw==","signature_status":"signed_v1","signed_at":"2026-07-05T01:08:57.638069Z","signed_message":"canonical_sha256_bytes"},"source_id":"1803.06878","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c8a3b765f64fa709d7fb433993b7ff69cc17582efd86074df137884cdcbe8c4","sha256:77d3bfe511ee3734afa6bbb9e6f9c60f015c125c02bf439e2bf97598a3868d4f"],"state_sha256":"86666284539b59854d966a99cc932d1324d83e07c01ad69f9fe1c21ef85fc4cf"}