{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:S57K5C236QPK3FIW3IQ2REJMR4","short_pith_number":"pith:S57K5C23","schema_version":"1.0","canonical_sha256":"977eae8b5bf41ead9516da21a8912c8f39621941ec047482432bdee39d0b570a","source":{"kind":"arxiv","id":"1803.06878","version":4},"attestation_state":"computed","paper":{"title":"Parameterized Complexity of Fair Vertex Evaluation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO"],"primary_cat":"cs.CC","authors_text":"Du\\v{s}an Knop, Tom\\'a\\v{s} Masa\\v{r}\\'ik, Tom\\'a\\v{s} Toufar","submitted_at":"2018-03-19T11:49:02Z","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1803.06878","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-03-19T11:49:02Z","cross_cats_sorted":["cs.DS","cs.LO"],"title_canon_sha256":"a6400e29935e5dff23c55153084868b6a17069b718f0e35ff56c1b061591b743","abstract_canon_sha256":"7d1b12e55bb7ea5a5115a1d7a3dbd0dd4d60c9bd003bcb99db14791fb4926d0d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:08:57.638069Z","signature_b64":"VPs389kNVcQTNhtNewXJd65tjtlzmcmpVfXdDWWEUsmUVnDrnGaSdBx4EPq7PnX92nM7Nr93qyMVmdKQbLHBCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"977eae8b5bf41ead9516da21a8912c8f39621941ec047482432bdee39d0b570a","last_reissued_at":"2026-07-05T01:08:57.637638Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:08:57.637638Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Parameterized Complexity of Fair Vertex Evaluation Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","cs.LO"],"primary_cat":"cs.CC","authors_text":"Du\\v{s}an Knop, Tom\\'a\\v{s} Masa\\v{r}\\'ik, Tom\\'a\\v{s} Toufar","submitted_at":"2018-03-19T11:49:02Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1803.06878","kind":"arxiv","version":4},"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/1803.06878/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1803.06878","created_at":"2026-07-05T01:08:57.637698+00:00"},{"alias_kind":"arxiv_version","alias_value":"1803.06878v4","created_at":"2026-07-05T01:08:57.637698+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1803.06878","created_at":"2026-07-05T01:08:57.637698+00:00"},{"alias_kind":"pith_short_12","alias_value":"S57K5C236QPK","created_at":"2026-07-05T01:08:57.637698+00:00"},{"alias_kind":"pith_short_16","alias_value":"S57K5C236QPK3FIW","created_at":"2026-07-05T01:08:57.637698+00:00"},{"alias_kind":"pith_short_8","alias_value":"S57K5C23","created_at":"2026-07-05T01:08:57.637698+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.01400","citing_title":"Fair Vertex Problems Parameterized by Cluster Vertex Deletion","ref_index":15,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4","json":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4.json","graph_json":"https://pith.science/api/pith-number/S57K5C236QPK3FIW3IQ2REJMR4/graph.json","events_json":"https://pith.science/api/pith-number/S57K5C236QPK3FIW3IQ2REJMR4/events.json","paper":"https://pith.science/paper/S57K5C23"},"agent_actions":{"view_html":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4","download_json":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4.json","view_paper":"https://pith.science/paper/S57K5C23","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1803.06878&json=true","fetch_graph":"https://pith.science/api/pith-number/S57K5C236QPK3FIW3IQ2REJMR4/graph.json","fetch_events":"https://pith.science/api/pith-number/S57K5C236QPK3FIW3IQ2REJMR4/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4/action/timestamp_anchor","attest_storage":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4/action/storage_attestation","attest_author":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4/action/author_attestation","sign_citation":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4/action/citation_signature","submit_replication":"https://pith.science/pith/S57K5C236QPK3FIW3IQ2REJMR4/action/replication_record"}},"created_at":"2026-07-05T01:08:57.637698+00:00","updated_at":"2026-07-05T01:08:57.637698+00:00"}