{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:EAT3535YNZFFYF3J6V43KAY7CR","short_pith_number":"pith:EAT3535Y","canonical_record":{"source":{"id":"1702.01979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-07T12:26:09Z","cross_cats_sorted":[],"title_canon_sha256":"3c509ffd04dd348344feffcccae83f577d48af1f6b744d4b12e7f5af747158f6","abstract_canon_sha256":"39deaf81c15c0b1156b84f9a881b20dd38e9786fefee62a7e991bee341dbe288"},"schema_version":"1.0"},"canonical_sha256":"2027beefb86e4a5c1769f579b5031f145607c1107ea009c152d757addcfaf35a","source":{"kind":"arxiv","id":"1702.01979","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01979","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01979v2","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01979","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"EAT3535YNZFF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EAT3535YNZFFYF3J","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EAT3535Y","created_at":"2026-05-18T12:31:12Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:EAT3535YNZFFYF3J6V43KAY7CR","target":"record","payload":{"canonical_record":{"source":{"id":"1702.01979","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-07T12:26:09Z","cross_cats_sorted":[],"title_canon_sha256":"3c509ffd04dd348344feffcccae83f577d48af1f6b744d4b12e7f5af747158f6","abstract_canon_sha256":"39deaf81c15c0b1156b84f9a881b20dd38e9786fefee62a7e991bee341dbe288"},"schema_version":"1.0"},"canonical_sha256":"2027beefb86e4a5c1769f579b5031f145607c1107ea009c152d757addcfaf35a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:15.777947Z","signature_b64":"xP8TWh4qfFzuiZKQxM2SbZ6YpyhzCfvrp7+eQDYNk5Ka3XjKK6MDhSbXd5BAozGucpzd5qpv8gdiBV4gSf9rCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2027beefb86e4a5c1769f579b5031f145607c1107ea009c152d757addcfaf35a","last_reissued_at":"2026-05-17T23:45:15.777388Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:15.777388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1702.01979","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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EjbGPDfdvtGq2D+HgriIq93aKrOoCsGcpT54jRi7XJS/lpdz3TA+xYBJKLDSh5+JHyf/FNbcnzg7rnnY3exkBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:04:05.063458Z"},"content_sha256":"aaec50bb621a6af16ecf83443b9c9eaaf109fe976b2e9699bddc7c51e315b63f","schema_version":"1.0","event_id":"sha256:aaec50bb621a6af16ecf83443b9c9eaaf109fe976b2e9699bddc7c51e315b63f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:EAT3535YNZFFYF3J6V43KAY7CR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A novel data envelopment analysis ranking based on a robust approach","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Milan Hlad\\'ik","submitted_at":"2017-02-07T12:26:09Z","abstract_excerpt":"We propose a novel DEA ranking based on a robust optimization viewpoint: the higher ranking for those DMU's that remain efficient even for larger variations of data and vice versa. This ranking can be computed by solving generalized linear fractional programming problems, but we also present a tight linear programming approximation that preserves the order of rankings. We show some remarkable properties of our approach: It preserves the order of rankings compared to the classical approach. It is naturally normalized, so it can be used as universal ranking of DMU's of unrelated models. It gives"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01979","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:45:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"soTcWqzwNbD5c8+HGRWxnebyUfrEjPTikiWvegsvNMfIUaFZs8rxMGCTmesN+nzhzHnqq5/Lkj9XdgiFZphZBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T05:04:05.064055Z"},"content_sha256":"05eab85b1915dd5fb9e1b85d44df0af6e2f26b0eaedf3269322d240108710a68","schema_version":"1.0","event_id":"sha256:05eab85b1915dd5fb9e1b85d44df0af6e2f26b0eaedf3269322d240108710a68"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EAT3535YNZFFYF3J6V43KAY7CR/bundle.json","state_url":"https://pith.science/pith/EAT3535YNZFFYF3J6V43KAY7CR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EAT3535YNZFFYF3J6V43KAY7CR/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-07T05:04:05Z","links":{"resolver":"https://pith.science/pith/EAT3535YNZFFYF3J6V43KAY7CR","bundle":"https://pith.science/pith/EAT3535YNZFFYF3J6V43KAY7CR/bundle.json","state":"https://pith.science/pith/EAT3535YNZFFYF3J6V43KAY7CR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EAT3535YNZFFYF3J6V43KAY7CR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:EAT3535YNZFFYF3J6V43KAY7CR","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":"39deaf81c15c0b1156b84f9a881b20dd38e9786fefee62a7e991bee341dbe288","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-07T12:26:09Z","title_canon_sha256":"3c509ffd04dd348344feffcccae83f577d48af1f6b744d4b12e7f5af747158f6"},"schema_version":"1.0","source":{"id":"1702.01979","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1702.01979","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"arxiv_version","alias_value":"1702.01979v2","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.01979","created_at":"2026-05-17T23:45:15Z"},{"alias_kind":"pith_short_12","alias_value":"EAT3535YNZFF","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_16","alias_value":"EAT3535YNZFFYF3J","created_at":"2026-05-18T12:31:12Z"},{"alias_kind":"pith_short_8","alias_value":"EAT3535Y","created_at":"2026-05-18T12:31:12Z"}],"graph_snapshots":[{"event_id":"sha256:05eab85b1915dd5fb9e1b85d44df0af6e2f26b0eaedf3269322d240108710a68","target":"graph","created_at":"2026-05-17T23:45:15Z","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 propose a novel DEA ranking based on a robust optimization viewpoint: the higher ranking for those DMU's that remain efficient even for larger variations of data and vice versa. This ranking can be computed by solving generalized linear fractional programming problems, but we also present a tight linear programming approximation that preserves the order of rankings. We show some remarkable properties of our approach: It preserves the order of rankings compared to the classical approach. It is naturally normalized, so it can be used as universal ranking of DMU's of unrelated models. It gives","authors_text":"Milan Hlad\\'ik","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-07T12:26:09Z","title":"A novel data envelopment analysis ranking based on a robust approach"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.01979","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:aaec50bb621a6af16ecf83443b9c9eaaf109fe976b2e9699bddc7c51e315b63f","target":"record","created_at":"2026-05-17T23:45:15Z","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":"39deaf81c15c0b1156b84f9a881b20dd38e9786fefee62a7e991bee341dbe288","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-02-07T12:26:09Z","title_canon_sha256":"3c509ffd04dd348344feffcccae83f577d48af1f6b744d4b12e7f5af747158f6"},"schema_version":"1.0","source":{"id":"1702.01979","kind":"arxiv","version":2}},"canonical_sha256":"2027beefb86e4a5c1769f579b5031f145607c1107ea009c152d757addcfaf35a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2027beefb86e4a5c1769f579b5031f145607c1107ea009c152d757addcfaf35a","first_computed_at":"2026-05-17T23:45:15.777388Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:15.777388Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xP8TWh4qfFzuiZKQxM2SbZ6YpyhzCfvrp7+eQDYNk5Ka3XjKK6MDhSbXd5BAozGucpzd5qpv8gdiBV4gSf9rCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:15.777947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1702.01979","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:aaec50bb621a6af16ecf83443b9c9eaaf109fe976b2e9699bddc7c51e315b63f","sha256:05eab85b1915dd5fb9e1b85d44df0af6e2f26b0eaedf3269322d240108710a68"],"state_sha256":"54434f94f85dfebc68eff24b423501fb3dbf292b0f40ea0773bbe698e5efd295"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kodyw/E0yIHBAKA3TztBVIY8lGWHgV4eyWFUpyJHj1TlR1zPo2UjzcAif9LZb+Dp9EyDTOIL3lcBfJhw8wp9Cw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T05:04:05.069151Z","bundle_sha256":"b7fdc1c39d98f88418078999d3b38f4b0c0bd139aa1940f83f9760dec9a526e3"}}