{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JPPN7POLI4QEN7DXWTDE4PMKL3","short_pith_number":"pith:JPPN7POL","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"},"canonical_sha256":"4bdedfbdcb472046fc77b4c64e3d8a5ee2ebc06315984e55bfb4c9bedd5cda4e","source":{"kind":"arxiv","id":"1804.03594","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03594","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03594v1","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03594","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"JPPN7POLI4QE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JPPN7POLI4QEN7DX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JPPN7POL","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JPPN7POLI4QEN7DXWTDE4PMKL3","target":"record","payload":{"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"},"canonical_sha256":"4bdedfbdcb472046fc77b4c64e3d8a5ee2ebc06315984e55bfb4c9bedd5cda4e","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"},"source_kind":"arxiv","source_id":"1804.03594","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-18T00:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IPyMaL9vmiSLJffo42GhZt9teUokjzXfU84GHazXzRqudXONyPKDn22lL8Tc4XSrDXn7gbdzJc53XIGj80GbAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:34:29.235282Z"},"content_sha256":"447feec9818568edd825738e794de0a48d078c600861508ff10e9e187d496b6d","schema_version":"1.0","event_id":"sha256:447feec9818568edd825738e794de0a48d078c600861508ff10e9e187d496b6d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JPPN7POLI4QEN7DXWTDE4PMKL3","target":"graph","payload":{"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"},"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-18T00:18:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N4CF5wns2OgqReRKXtFU3WE6PbngfjNKoQDKp0X/TAye738cVUamJH34BvJ+UHIXFoPaTHu7GgQwwZChv2B9AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-31T07:34:29.235927Z"},"content_sha256":"e4169fb1abedc3d83b06d744b595f68ff6fae806a63b4a3c5be04e931f5a4d79","schema_version":"1.0","event_id":"sha256:e4169fb1abedc3d83b06d744b595f68ff6fae806a63b4a3c5be04e931f5a4d79"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/bundle.json","state_url":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/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-31T07:34:29Z","links":{"resolver":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3","bundle":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/bundle.json","state":"https://pith.science/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JPPN7POLI4QEN7DXWTDE4PMKL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JPPN7POLI4QEN7DXWTDE4PMKL3","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":"6f650fd0304dbfcb332a2ef28ef592b155b996ffa3e67078f8961117e4361575","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-10T15:41:29Z","title_canon_sha256":"9d858215ae3d86fc8e165facddff369a71cc7475c3904c9c4bfe28b39b104bcb"},"schema_version":"1.0","source":{"id":"1804.03594","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.03594","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"arxiv_version","alias_value":"1804.03594v1","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.03594","created_at":"2026-05-18T00:18:47Z"},{"alias_kind":"pith_short_12","alias_value":"JPPN7POLI4QE","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JPPN7POLI4QEN7DX","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JPPN7POL","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:e4169fb1abedc3d83b06d744b595f68ff6fae806a63b4a3c5be04e931f5a4d79","target":"graph","created_at":"2026-05-18T00:18:47Z","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":"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","authors_text":"Adam Kasperski, Andr\\'e Chassein, Marc Goerigk, Pawe{\\l} Zieli\\'nski","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-10T15:41:29Z","title":"Approximating multiobjective combinatorial optimization problems with the OWA criterion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.03594","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:447feec9818568edd825738e794de0a48d078c600861508ff10e9e187d496b6d","target":"record","created_at":"2026-05-18T00:18:47Z","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":"6f650fd0304dbfcb332a2ef28ef592b155b996ffa3e67078f8961117e4361575","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-04-10T15:41:29Z","title_canon_sha256":"9d858215ae3d86fc8e165facddff369a71cc7475c3904c9c4bfe28b39b104bcb"},"schema_version":"1.0","source":{"id":"1804.03594","kind":"arxiv","version":1}},"canonical_sha256":"4bdedfbdcb472046fc77b4c64e3d8a5ee2ebc06315984e55bfb4c9bedd5cda4e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4bdedfbdcb472046fc77b4c64e3d8a5ee2ebc06315984e55bfb4c9bedd5cda4e","first_computed_at":"2026-05-18T00:18:47.601791Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:18:47.601791Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"UgNy3TQzCtq84ogUKkqyVGJL6r6FPQVHmgjkGQkVbyzDtEK0dASMq1jgbuHKiZqf02eN7gTaeJBMNyOPEITIBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:18:47.602510Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.03594","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:447feec9818568edd825738e794de0a48d078c600861508ff10e9e187d496b6d","sha256:e4169fb1abedc3d83b06d744b595f68ff6fae806a63b4a3c5be04e931f5a4d79"],"state_sha256":"bb03c13f2cd337ade33bcd7750497341181a75a9cbbe4d9e0520a8327539e35c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Alee6OfERu9aDw4rpE8JcTNpT6rjWiS8ntGcoTVMfIESmUvVhnnEnTglZAmOU3V18qxcCgEstlSv+cmS3qRICA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-31T07:34:29.239436Z","bundle_sha256":"1726051bd41d18749b1fff8948b0acdcb665ed404e7cee607609d0e3d768e6ce"}}