{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:JPPN7POLI4QEN7DXWTDE4PMKL3","short_pith_number":"pith:JPPN7POL","schema_version":"1.0","canonical_sha256":"4bdedfbdcb472046fc77b4c64e3d8a5ee2ebc06315984e55bfb4c9bedd5cda4e","source":{"kind":"arxiv","id":"1804.03594","version":1},"attestation_state":"computed","paper":{"title":"Approximating multiobjective combinatorial optimization problems with the OWA criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Andr\\'e Chassein, Marc Goerigk, Pawe{\\l} Zieli\\'nski","submitted_at":"2018-04-10T15:41:29Z","abstract_excerpt":"The paper deals with a multiobjective combinatorial optimization problem with $K$ linear cost functions. The popular Ordered Weighted Averaging (OWA) criterion is used to aggregate the cost functions and compute a solution. It is well known that minimizing OWA for most basic combinatorial problems is weakly NP-hard even if the number of objectives $K$ equals two, and strongly NP-hard when $K$ is a part of the input. In this paper, the problem with nonincreasing weights in the OWA criterion and a large $K$ is considered. A method of reducing the number of objectives by appropriately aggregating"},"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":"1804.03594","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-10T15:41:29Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"9d858215ae3d86fc8e165facddff369a71cc7475c3904c9c4bfe28b39b104bcb","abstract_canon_sha256":"6f650fd0304dbfcb332a2ef28ef592b155b996ffa3e67078f8961117e4361575"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:18:47.602510Z","signature_b64":"UgNy3TQzCtq84ogUKkqyVGJL6r6FPQVHmgjkGQkVbyzDtEK0dASMq1jgbuHKiZqf02eN7gTaeJBMNyOPEITIBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4bdedfbdcb472046fc77b4c64e3d8a5ee2ebc06315984e55bfb4c9bedd5cda4e","last_reissued_at":"2026-05-18T00:18:47.601791Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:18:47.601791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximating multiobjective combinatorial optimization problems with the OWA criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Andr\\'e Chassein, Marc Goerigk, Pawe{\\l} Zieli\\'nski","submitted_at":"2018-04-10T15:41:29Z","abstract_excerpt":"The paper deals with a multiobjective combinatorial optimization problem with $K$ linear cost functions. The popular Ordered Weighted Averaging (OWA) criterion is used to aggregate the cost functions and compute a solution. It is well known that minimizing OWA for most basic combinatorial problems is weakly NP-hard even if the number of objectives $K$ equals two, and strongly NP-hard when $K$ is a part of the input. In this paper, the problem with nonincreasing weights in the OWA criterion and a large $K$ is considered. A method of reducing the number of objectives by appropriately aggregating"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03594","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1804.03594","created_at":"2026-05-18T00:18:47.601907+00:00"},{"alias_kind":"arxiv_version","alias_value":"1804.03594v1","created_at":"2026-05-18T00:18:47.601907+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03594","created_at":"2026-05-18T00:18:47.601907+00:00"},{"alias_kind":"pith_short_12","alias_value":"JPPN7POLI4QE","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_16","alias_value":"JPPN7POLI4QEN7DX","created_at":"2026-05-18T12:32:31.084164+00:00"},{"alias_kind":"pith_short_8","alias_value":"JPPN7POL","created_at":"2026-05-18T12:32:31.084164+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3","json":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3.json","graph_json":"https://pith.science/api/pith-number/JPPN7POLI4QEN7DXWTDE4PMKL3/graph.json","events_json":"https://pith.science/api/pith-number/JPPN7POLI4QEN7DXWTDE4PMKL3/events.json","paper":"https://pith.science/paper/JPPN7POL"},"agent_actions":{"view_html":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3","download_json":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3.json","view_paper":"https://pith.science/paper/JPPN7POL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1804.03594&json=true","fetch_graph":"https://pith.science/api/pith-number/JPPN7POLI4QEN7DXWTDE4PMKL3/graph.json","fetch_events":"https://pith.science/api/pith-number/JPPN7POLI4QEN7DXWTDE4PMKL3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/action/storage_attestation","attest_author":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/action/author_attestation","sign_citation":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/action/citation_signature","submit_replication":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/action/replication_record"}},"created_at":"2026-05-18T00:18:47.601907+00:00","updated_at":"2026-05-18T00:18:47.601907+00:00"}