{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:QPKEHCZU7BXT5SJOM2G7BUUIF6","short_pith_number":"pith:QPKEHCZU","canonical_record":{"source":{"id":"1810.08662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-19T19:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"94ca6fe05e815e5205c65e31cc47fd64f6f1fc44a36a796a5e54b725d544a5e0","abstract_canon_sha256":"7317d2df673147e4e8f625a6f3647bea26da08763ada11c36343f13cdbdf9e96"},"schema_version":"1.0"},"canonical_sha256":"83d4438b34f86f3ec92e668df0d2882f8ae27f3da92011477dd2ed1de427b836","source":{"kind":"arxiv","id":"1810.08662","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08662","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08662v2","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08662","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"pith_short_12","alias_value":"QPKEHCZU7BXT","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QPKEHCZU7BXT5SJO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QPKEHCZU","created_at":"2026-05-18T12:32:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:QPKEHCZU7BXT5SJOM2G7BUUIF6","target":"record","payload":{"canonical_record":{"source":{"id":"1810.08662","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-19T19:27:21Z","cross_cats_sorted":[],"title_canon_sha256":"94ca6fe05e815e5205c65e31cc47fd64f6f1fc44a36a796a5e54b725d544a5e0","abstract_canon_sha256":"7317d2df673147e4e8f625a6f3647bea26da08763ada11c36343f13cdbdf9e96"},"schema_version":"1.0"},"canonical_sha256":"83d4438b34f86f3ec92e668df0d2882f8ae27f3da92011477dd2ed1de427b836","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:50.691919Z","signature_b64":"79piwCFesTklvSz/AztfO7Gwe8qjpqAsjmmfb1M4LK5aMYACbvbFY3RGCHNYPnvkYxKDAk778f7v9EZPV0TuCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"83d4438b34f86f3ec92e668df0d2882f8ae27f3da92011477dd2ed1de427b836","last_reissued_at":"2026-05-17T23:49:50.691503Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:50.691503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.08662","source_version":2,"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-17T23:49:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xrWxxLYc9Xqgw0NYFiTcH7i8n7jcrmdasDcmZDlueu0HO+wew/6O2b/I3TJhlDcydwlg3f1WqjqYfjQ2peT1Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:50.387548Z"},"content_sha256":"9d3813fe6a9c1362d87bf0a167aac601410fd06d1901df5ba16907644666beb2","schema_version":"1.0","event_id":"sha256:9d3813fe6a9c1362d87bf0a167aac601410fd06d1901df5ba16907644666beb2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:QPKEHCZU7BXT5SJOM2G7BUUIF6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using tropical optimization techniques in bi-criteria decision problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Nikolai Krivulin","submitted_at":"2018-10-19T19:27:21Z","abstract_excerpt":"We consider decision problems of rating alternatives based on their pairwise comparisons according to two criteria. Given pairwise comparison matrices for each criterion, the problem is to find the overall scores of the alternatives. We offer a solution that involves the minimax approximation of the comparison matrices by a common consistent matrix of unit rank in terms of the Chebyshev metric in logarithmic scale. The approximation problem reduces to a bi-objective optimization problem to minimize the approximation errors simultaneously for both comparison matrices. We formulate the problem i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08662","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"},"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-17T23:49:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n2WxMvrjTvNFdm4NoGyxiqkMnmnbYEXASQ1jo1UXJ+YyaU7MD2+oqNikw/1Xl83JZuG/csu7/578nx3yfPleAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-03T21:53:50.387891Z"},"content_sha256":"0a5c955d1fd399797f3eb2fbb6eaac668360da54a845841adef215fe16831637","schema_version":"1.0","event_id":"sha256:0a5c955d1fd399797f3eb2fbb6eaac668360da54a845841adef215fe16831637"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QPKEHCZU7BXT5SJOM2G7BUUIF6/bundle.json","state_url":"https://pith.science/pith/QPKEHCZU7BXT5SJOM2G7BUUIF6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QPKEHCZU7BXT5SJOM2G7BUUIF6/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-07-03T21:53:50Z","links":{"resolver":"https://pith.science/pith/QPKEHCZU7BXT5SJOM2G7BUUIF6","bundle":"https://pith.science/pith/QPKEHCZU7BXT5SJOM2G7BUUIF6/bundle.json","state":"https://pith.science/pith/QPKEHCZU7BXT5SJOM2G7BUUIF6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QPKEHCZU7BXT5SJOM2G7BUUIF6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:QPKEHCZU7BXT5SJOM2G7BUUIF6","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":"7317d2df673147e4e8f625a6f3647bea26da08763ada11c36343f13cdbdf9e96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-19T19:27:21Z","title_canon_sha256":"94ca6fe05e815e5205c65e31cc47fd64f6f1fc44a36a796a5e54b725d544a5e0"},"schema_version":"1.0","source":{"id":"1810.08662","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.08662","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"arxiv_version","alias_value":"1810.08662v2","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.08662","created_at":"2026-05-17T23:49:50Z"},{"alias_kind":"pith_short_12","alias_value":"QPKEHCZU7BXT","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_16","alias_value":"QPKEHCZU7BXT5SJO","created_at":"2026-05-18T12:32:46Z"},{"alias_kind":"pith_short_8","alias_value":"QPKEHCZU","created_at":"2026-05-18T12:32:46Z"}],"graph_snapshots":[{"event_id":"sha256:0a5c955d1fd399797f3eb2fbb6eaac668360da54a845841adef215fe16831637","target":"graph","created_at":"2026-05-17T23:49:50Z","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":"We consider decision problems of rating alternatives based on their pairwise comparisons according to two criteria. Given pairwise comparison matrices for each criterion, the problem is to find the overall scores of the alternatives. We offer a solution that involves the minimax approximation of the comparison matrices by a common consistent matrix of unit rank in terms of the Chebyshev metric in logarithmic scale. The approximation problem reduces to a bi-objective optimization problem to minimize the approximation errors simultaneously for both comparison matrices. We formulate the problem i","authors_text":"Nikolai Krivulin","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-19T19:27:21Z","title":"Using tropical optimization techniques in bi-criteria decision problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.08662","kind":"arxiv","version":2},"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:9d3813fe6a9c1362d87bf0a167aac601410fd06d1901df5ba16907644666beb2","target":"record","created_at":"2026-05-17T23:49:50Z","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":"7317d2df673147e4e8f625a6f3647bea26da08763ada11c36343f13cdbdf9e96","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-19T19:27:21Z","title_canon_sha256":"94ca6fe05e815e5205c65e31cc47fd64f6f1fc44a36a796a5e54b725d544a5e0"},"schema_version":"1.0","source":{"id":"1810.08662","kind":"arxiv","version":2}},"canonical_sha256":"83d4438b34f86f3ec92e668df0d2882f8ae27f3da92011477dd2ed1de427b836","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"83d4438b34f86f3ec92e668df0d2882f8ae27f3da92011477dd2ed1de427b836","first_computed_at":"2026-05-17T23:49:50.691503Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:50.691503Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"79piwCFesTklvSz/AztfO7Gwe8qjpqAsjmmfb1M4LK5aMYACbvbFY3RGCHNYPnvkYxKDAk778f7v9EZPV0TuCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:50.691919Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.08662","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9d3813fe6a9c1362d87bf0a167aac601410fd06d1901df5ba16907644666beb2","sha256:0a5c955d1fd399797f3eb2fbb6eaac668360da54a845841adef215fe16831637"],"state_sha256":"6715abd21867ea73b1e0cff39eb3b68f4dd1ee944502a1a8090f2e908bf5b629"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"21sERJ6DfErCVO6W2qP6OCGJX8lJQy9+wofjnaKWrT6NQnoAq0ROUltnBoc/mTlXtedI/kgjORtKc/WwL6iTCQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-03T21:53:50.389758Z","bundle_sha256":"18a53ce4fd1c54d9ec5279c417e03028a1e487e3eb6f90584288d3adcc63be49"}}