{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:EL4PBTI4CDSM3PR2OR6ASQ2OYY","short_pith_number":"pith:EL4PBTI4","canonical_record":{"source":{"id":"1903.09843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-23T16:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"9cf13dfaeb2faabde3ac50903c86e4a2139c3e4b1b34833fb983492238be52fa","abstract_canon_sha256":"2fcdfb1ddaade3ed1ab6098397ec9ae03af004306b7075bf03bda774bd7cac5d"},"schema_version":"1.0"},"canonical_sha256":"22f8f0cd1c10e4cdbe3a747c09434ec607e24be4fd8086833e3e4f04d861e2c8","source":{"kind":"arxiv","id":"1903.09843","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09843","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09843v1","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09843","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"EL4PBTI4CDSM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EL4PBTI4CDSM3PR2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EL4PBTI4","created_at":"2026-05-18T12:33:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:EL4PBTI4CDSM3PR2OR6ASQ2OYY","target":"record","payload":{"canonical_record":{"source":{"id":"1903.09843","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-23T16:31:23Z","cross_cats_sorted":[],"title_canon_sha256":"9cf13dfaeb2faabde3ac50903c86e4a2139c3e4b1b34833fb983492238be52fa","abstract_canon_sha256":"2fcdfb1ddaade3ed1ab6098397ec9ae03af004306b7075bf03bda774bd7cac5d"},"schema_version":"1.0"},"canonical_sha256":"22f8f0cd1c10e4cdbe3a747c09434ec607e24be4fd8086833e3e4f04d861e2c8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:50:35.346085Z","signature_b64":"AmKl409ySjQe+/9hQwjxVmjVf5EAitXBJ0d/WsmsvwK2qcBnW/dOE7CDFAs5soTfXxj3wOC9jguHqvvlE9hwAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"22f8f0cd1c10e4cdbe3a747c09434ec607e24be4fd8086833e3e4f04d861e2c8","last_reissued_at":"2026-05-17T23:50:35.345453Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:50:35.345453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1903.09843","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-17T23:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U8kjRr/mQ0TzfybXC7TWWudg4dNpGMsj3CgSKQQlajU33G4BPNcJdCFnfl7HkDtLrb+D0SZeuS5YLydpTzHrBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:26:30.505307Z"},"content_sha256":"cfb8b3e04205f77f5244a6dbd3267ed6159342052e78e6e83ab908ca777010a7","schema_version":"1.0","event_id":"sha256:cfb8b3e04205f77f5244a6dbd3267ed6159342052e78e6e83ab908ca777010a7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:EL4PBTI4CDSM3PR2OR6ASQ2OYY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mechanism Design for Maximum Vectors","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Eric Angel, Evripidis Bampis","submitted_at":"2019-03-23T16:31:23Z","abstract_excerpt":"We consider the Maximum Vectors problem in a strategic setting. In the classical setting this problem consists, given a set of $k$-dimensional vectors, in computing the set of all nondominated vectors. Recall that a vector $v=(v^1, v^2, \\ldots, v^k)$ is said to be nondominated if there does not exist another vector $v_*=(v_*^1, v_*^2, \\ldots, v_*^k)$ such that $v^l \\leq v_*^{l}$ for $1\\leq l\\leq k$, with at least one strict inequality among the $k$ inequalities. This problem is strongly related to other known problems such as the Pareto curve computation in multiobjective optimization. In a st"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09843","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-17T23:50:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6M586VmcfZ6VNhHLQ+3TMqol1Ks0N6k1oZnxXb12ZRk6+E7n2APiAWhn45CbCB4rOpR236xmWx0dDqAjLKuzBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T02:26:30.505697Z"},"content_sha256":"4b72ce48233f61716f830ceb78fd5ceb318b25c56afc75f2dbaa7d7622c72b8c","schema_version":"1.0","event_id":"sha256:4b72ce48233f61716f830ceb78fd5ceb318b25c56afc75f2dbaa7d7622c72b8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/bundle.json","state_url":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/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-04T02:26:30Z","links":{"resolver":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY","bundle":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/bundle.json","state":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:EL4PBTI4CDSM3PR2OR6ASQ2OYY","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":"2fcdfb1ddaade3ed1ab6098397ec9ae03af004306b7075bf03bda774bd7cac5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-23T16:31:23Z","title_canon_sha256":"9cf13dfaeb2faabde3ac50903c86e4a2139c3e4b1b34833fb983492238be52fa"},"schema_version":"1.0","source":{"id":"1903.09843","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1903.09843","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"arxiv_version","alias_value":"1903.09843v1","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09843","created_at":"2026-05-17T23:50:35Z"},{"alias_kind":"pith_short_12","alias_value":"EL4PBTI4CDSM","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_16","alias_value":"EL4PBTI4CDSM3PR2","created_at":"2026-05-18T12:33:15Z"},{"alias_kind":"pith_short_8","alias_value":"EL4PBTI4","created_at":"2026-05-18T12:33:15Z"}],"graph_snapshots":[{"event_id":"sha256:4b72ce48233f61716f830ceb78fd5ceb318b25c56afc75f2dbaa7d7622c72b8c","target":"graph","created_at":"2026-05-17T23:50:35Z","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 the Maximum Vectors problem in a strategic setting. In the classical setting this problem consists, given a set of $k$-dimensional vectors, in computing the set of all nondominated vectors. Recall that a vector $v=(v^1, v^2, \\ldots, v^k)$ is said to be nondominated if there does not exist another vector $v_*=(v_*^1, v_*^2, \\ldots, v_*^k)$ such that $v^l \\leq v_*^{l}$ for $1\\leq l\\leq k$, with at least one strict inequality among the $k$ inequalities. This problem is strongly related to other known problems such as the Pareto curve computation in multiobjective optimization. In a st","authors_text":"Eric Angel, Evripidis Bampis","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-23T16:31:23Z","title":"Mechanism Design for Maximum Vectors"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.09843","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:cfb8b3e04205f77f5244a6dbd3267ed6159342052e78e6e83ab908ca777010a7","target":"record","created_at":"2026-05-17T23:50:35Z","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":"2fcdfb1ddaade3ed1ab6098397ec9ae03af004306b7075bf03bda774bd7cac5d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2019-03-23T16:31:23Z","title_canon_sha256":"9cf13dfaeb2faabde3ac50903c86e4a2139c3e4b1b34833fb983492238be52fa"},"schema_version":"1.0","source":{"id":"1903.09843","kind":"arxiv","version":1}},"canonical_sha256":"22f8f0cd1c10e4cdbe3a747c09434ec607e24be4fd8086833e3e4f04d861e2c8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"22f8f0cd1c10e4cdbe3a747c09434ec607e24be4fd8086833e3e4f04d861e2c8","first_computed_at":"2026-05-17T23:50:35.345453Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:50:35.345453Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AmKl409ySjQe+/9hQwjxVmjVf5EAitXBJ0d/WsmsvwK2qcBnW/dOE7CDFAs5soTfXxj3wOC9jguHqvvlE9hwAQ==","signature_status":"signed_v1","signed_at":"2026-05-17T23:50:35.346085Z","signed_message":"canonical_sha256_bytes"},"source_id":"1903.09843","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cfb8b3e04205f77f5244a6dbd3267ed6159342052e78e6e83ab908ca777010a7","sha256:4b72ce48233f61716f830ceb78fd5ceb318b25c56afc75f2dbaa7d7622c72b8c"],"state_sha256":"ab11fd20babf996b6b2d136a2de338b9e4272fc4ca86b9f097c1acbd4d3c2b52"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UBhMmIT+BC53JA5uQm91rUQt5tqWHgtPjmoiTiNi5YrqKR8m9KyKWANBU/+db/NXQRylPwPxH6sZziFU61zICQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T02:26:30.508733Z","bundle_sha256":"bf4838365df9da1b9053d6d2cc7101c42e43d699e7cef5a38716152171f2db50"}}