{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DPMAEZXETNBJXAEKB2RUYUZEVS","short_pith_number":"pith:DPMAEZXE","schema_version":"1.0","canonical_sha256":"1bd80266e49b429b808a0ea34c5324ac9934b9bca120cce6d559c97b97e6b67a","source":{"kind":"arxiv","id":"1305.5339","version":2},"attestation_state":"computed","paper":{"title":"Combinatorial optimization problems with uncertain costs and the OWA criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Pawel Zielinski","submitted_at":"2013-05-23T07:32:09Z","abstract_excerpt":"In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing $K$ distinct cost scenarios. The Ordered Weighted Averaging (OWA for short) aggregation operator is applied to choose a solution. The well-known criteria such as: the maximum, minimum, average, Hurwicz and median are special cases of OWA. By using OWA, the traditional min-max approach to combinatorial optimization problems with uncertain costs, often regarded as too conservative, can be generalized. The computational complex"},"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":"1305.5339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-05-23T07:32:09Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"e6581269bc889f81a01ee0bda972ef485009597a12f6490e093d05d545fd69fe","abstract_canon_sha256":"f50850c0b5ab1ebdc84a399c60fa9df6a2785046864daa373f790e20d836d203"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:43.023048Z","signature_b64":"BZHzKqQHiKQZi0HDFY+T+t4FlIhx9nzktjVYGoUzIv/4fu0EwAhNaq6dk9zvto7JKqarRUuM4a1AKmuTgdETBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bd80266e49b429b808a0ea34c5324ac9934b9bca120cce6d559c97b97e6b67a","last_reissued_at":"2026-05-18T02:37:43.022646Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:43.022646Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Combinatorial optimization problems with uncertain costs and the OWA criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Pawel Zielinski","submitted_at":"2013-05-23T07:32:09Z","abstract_excerpt":"In this paper a class of combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing $K$ distinct cost scenarios. The Ordered Weighted Averaging (OWA for short) aggregation operator is applied to choose a solution. The well-known criteria such as: the maximum, minimum, average, Hurwicz and median are special cases of OWA. By using OWA, the traditional min-max approach to combinatorial optimization problems with uncertain costs, often regarded as too conservative, can be generalized. The computational complex"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1305.5339","kind":"arxiv","version":2},"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":"1305.5339","created_at":"2026-05-18T02:37:43.022708+00:00"},{"alias_kind":"arxiv_version","alias_value":"1305.5339v2","created_at":"2026-05-18T02:37:43.022708+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1305.5339","created_at":"2026-05-18T02:37:43.022708+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPMAEZXETNBJ","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPMAEZXETNBJXAEK","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPMAEZXE","created_at":"2026-05-18T12:27:43.054852+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/DPMAEZXETNBJXAEKB2RUYUZEVS","json":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS.json","graph_json":"https://pith.science/api/pith-number/DPMAEZXETNBJXAEKB2RUYUZEVS/graph.json","events_json":"https://pith.science/api/pith-number/DPMAEZXETNBJXAEKB2RUYUZEVS/events.json","paper":"https://pith.science/paper/DPMAEZXE"},"agent_actions":{"view_html":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS","download_json":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS.json","view_paper":"https://pith.science/paper/DPMAEZXE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1305.5339&json=true","fetch_graph":"https://pith.science/api/pith-number/DPMAEZXETNBJXAEKB2RUYUZEVS/graph.json","fetch_events":"https://pith.science/api/pith-number/DPMAEZXETNBJXAEKB2RUYUZEVS/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS/action/storage_attestation","attest_author":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS/action/author_attestation","sign_citation":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS/action/citation_signature","submit_replication":"https://pith.science/pith/DPMAEZXETNBJXAEKB2RUYUZEVS/action/replication_record"}},"created_at":"2026-05-18T02:37:43.022708+00:00","updated_at":"2026-05-18T02:37:43.022708+00:00"}