{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:LHMLB2LHWBNCYVMFJNRSASU3YC","short_pith_number":"pith:LHMLB2LH","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"},"canonical_sha256":"59d8b0e967b05a2c55854b63204a9bc0b91e75bb269168ef1968a2e40c12b88f","source":{"kind":"arxiv","id":"1307.4521","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4521","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4521v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4521","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"LHMLB2LHWBNC","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LHMLB2LHWBNCYVMF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LHMLB2LH","created_at":"2026-05-18T12:27:51Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:LHMLB2LHWBNCYVMFJNRSASU3YC","target":"record","payload":{"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"},"canonical_sha256":"59d8b0e967b05a2c55854b63204a9bc0b91e75bb269168ef1968a2e40c12b88f","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"},"source_kind":"arxiv","source_id":"1307.4521","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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8hAqdpeemW6Yt/Y5VmR1U5CoEWDT3pBpxGAZEEwN2eEecbDX844EwyIJ88gysBwK/cS2kNJVtQqxI2SWoEazBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:57:17.968261Z"},"content_sha256":"af5cb98c42bea014269155fa9cfa6b56b6efbd5e4e13fc6f2149747f9ac8b723","schema_version":"1.0","event_id":"sha256:af5cb98c42bea014269155fa9cfa6b56b6efbd5e4e13fc6f2149747f9ac8b723"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:LHMLB2LHWBNCYVMFJNRSASU3YC","target":"graph","payload":{"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"},"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-18T03:18:07Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Np4LaraLl0KrlVMvCeS8XbpyPUDpewtZpAc9QrxxGI0lE+9PAQiT2k+3AP7p+2F9gudXtTxYlPygGHC7+XeYDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T20:57:17.968634Z"},"content_sha256":"be093e1ef339adafcef0e079ebb266b152622500ce2bbb10a30bdd32d08b0133","schema_version":"1.0","event_id":"sha256:be093e1ef339adafcef0e079ebb266b152622500ce2bbb10a30bdd32d08b0133"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/bundle.json","state_url":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/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-06-03T20:57:17Z","links":{"resolver":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC","bundle":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/bundle.json","state":"https://pith.science/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LHMLB2LHWBNCYVMFJNRSASU3YC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:LHMLB2LHWBNCYVMFJNRSASU3YC","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":"d33d78df244316eb58feced2c256997f054c839c0bb0247508610b1fb51347ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-17T07:22:42Z","title_canon_sha256":"e924818e7c0a9ca2b1d8ad73d2c5358bec9736c39ff2b5cadbcc20de076c6490"},"schema_version":"1.0","source":{"id":"1307.4521","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4521","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4521v1","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4521","created_at":"2026-05-18T03:18:07Z"},{"alias_kind":"pith_short_12","alias_value":"LHMLB2LHWBNC","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_16","alias_value":"LHMLB2LHWBNCYVMF","created_at":"2026-05-18T12:27:51Z"},{"alias_kind":"pith_short_8","alias_value":"LHMLB2LH","created_at":"2026-05-18T12:27:51Z"}],"graph_snapshots":[{"event_id":"sha256:be093e1ef339adafcef0e079ebb266b152622500ce2bbb10a30bdd32d08b0133","target":"graph","created_at":"2026-05-18T03:18:07Z","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":"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","authors_text":"Adam Kasperski, Pawel Zielinski","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-17T07:22:42Z","title":"Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4521","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:af5cb98c42bea014269155fa9cfa6b56b6efbd5e4e13fc6f2149747f9ac8b723","target":"record","created_at":"2026-05-18T03:18:07Z","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":"d33d78df244316eb58feced2c256997f054c839c0bb0247508610b1fb51347ee","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-07-17T07:22:42Z","title_canon_sha256":"e924818e7c0a9ca2b1d8ad73d2c5358bec9736c39ff2b5cadbcc20de076c6490"},"schema_version":"1.0","source":{"id":"1307.4521","kind":"arxiv","version":1}},"canonical_sha256":"59d8b0e967b05a2c55854b63204a9bc0b91e75bb269168ef1968a2e40c12b88f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"59d8b0e967b05a2c55854b63204a9bc0b91e75bb269168ef1968a2e40c12b88f","first_computed_at":"2026-05-18T03:18:07.609806Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:18:07.609806Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p4dwaGOjTjPg4dSarv8nmnXLfn2oK5jSezgpZgsrvhjxjTsvPtVbcG0TLchlUz9o8nMVFl1QcZVWhhYL0WkfAg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:18:07.610705Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4521","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:af5cb98c42bea014269155fa9cfa6b56b6efbd5e4e13fc6f2149747f9ac8b723","sha256:be093e1ef339adafcef0e079ebb266b152622500ce2bbb10a30bdd32d08b0133"],"state_sha256":"aa363ccd1ace30e061962bc35acf5934f621a24ff8503150ae110741e1bbbcc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibXGYYeySPw+KGdps0eHD+HH/bdpvX6qg1Ln82MxfrcsW1vSA5tN/T/QJKfUewCYAOrlmBmzypP+WUC0fzM8BQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T20:57:17.970742Z","bundle_sha256":"da45e85d39be43f19472c2d5b450369d810947617815dbf0ce27ee9d88fd968d"}}