{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:LHMLB2LHWBNCYVMFJNRSASU3YC","short_pith_number":"pith:LHMLB2LH","schema_version":"1.0","canonical_sha256":"59d8b0e967b05a2c55854b63204a9bc0b91e75bb269168ef1968a2e40c12b88f","source":{"kind":"arxiv","id":"1307.4521","version":1},"attestation_state":"computed","paper":{"title":"Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Pawel Zielinski","submitted_at":"2013-07-17T07:22:42Z","abstract_excerpt":"In this paper a class of bottleneck combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing a finite number of cost vectors, called scenarios. In order to choose a solution the Ordered Weighted Averaging aggregation operator (shortly OWA) is applied. The OWA operator generalizes traditional criteria in decision making under uncertainty such as the maximum, minimum, average, median, or Hurwicz criterion. New complexity and approximation results in this area are provided. These results are general and rema"},"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":"1307.4521","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-17T07:22:42Z","cross_cats_sorted":[],"title_canon_sha256":"e924818e7c0a9ca2b1d8ad73d2c5358bec9736c39ff2b5cadbcc20de076c6490","abstract_canon_sha256":"d33d78df244316eb58feced2c256997f054c839c0bb0247508610b1fb51347ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:18:07.610705Z","signature_b64":"p4dwaGOjTjPg4dSarv8nmnXLfn2oK5jSezgpZgsrvhjxjTsvPtVbcG0TLchlUz9o8nMVFl1QcZVWhhYL0WkfAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"59d8b0e967b05a2c55854b63204a9bc0b91e75bb269168ef1968a2e40c12b88f","last_reissued_at":"2026-05-18T03:18:07.609806Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:18:07.609806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Adam Kasperski, Pawel Zielinski","submitted_at":"2013-07-17T07:22:42Z","abstract_excerpt":"In this paper a class of bottleneck combinatorial optimization problems with uncertain costs is discussed. The uncertainty is modeled by specifying a discrete scenario set containing a finite number of cost vectors, called scenarios. In order to choose a solution the Ordered Weighted Averaging aggregation operator (shortly OWA) is applied. The OWA operator generalizes traditional criteria in decision making under uncertainty such as the maximum, minimum, average, median, or Hurwicz criterion. New complexity and approximation results in this area are provided. These results are general and rema"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4521","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":"1307.4521","created_at":"2026-05-18T03:18:07.609967+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4521v1","created_at":"2026-05-18T03:18:07.609967+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4521","created_at":"2026-05-18T03:18:07.609967+00:00"},{"alias_kind":"pith_short_12","alias_value":"LHMLB2LHWBNC","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_16","alias_value":"LHMLB2LHWBNCYVMF","created_at":"2026-05-18T12:27:51.066281+00:00"},{"alias_kind":"pith_short_8","alias_value":"LHMLB2LH","created_at":"2026-05-18T12:27:51.066281+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/LHMLB2LHWBNCYVMFJNRSASU3YC","json":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC.json","graph_json":"https://pith.science/api/pith-number/LHMLB2LHWBNCYVMFJNRSASU3YC/graph.json","events_json":"https://pith.science/api/pith-number/LHMLB2LHWBNCYVMFJNRSASU3YC/events.json","paper":"https://pith.science/paper/LHMLB2LH"},"agent_actions":{"view_html":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC","download_json":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC.json","view_paper":"https://pith.science/paper/LHMLB2LH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4521&json=true","fetch_graph":"https://pith.science/api/pith-number/LHMLB2LHWBNCYVMFJNRSASU3YC/graph.json","fetch_events":"https://pith.science/api/pith-number/LHMLB2LHWBNCYVMFJNRSASU3YC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/action/storage_attestation","attest_author":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/action/author_attestation","sign_citation":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/action/citation_signature","submit_replication":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/action/replication_record"}},"created_at":"2026-05-18T03:18:07.609967+00:00","updated_at":"2026-05-18T03:18:07.609967+00:00"}