{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EL4PBTI4CDSM3PR2OR6ASQ2OYY","short_pith_number":"pith:EL4PBTI4","schema_version":"1.0","canonical_sha256":"22f8f0cd1c10e4cdbe3a747c09434ec607e24be4fd8086833e3e4f04d861e2c8","source":{"kind":"arxiv","id":"1903.09843","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1903.09843","created_at":"2026-05-17T23:50:35.345533+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.09843v1","created_at":"2026-05-17T23:50:35.345533+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.09843","created_at":"2026-05-17T23:50:35.345533+00:00"},{"alias_kind":"pith_short_12","alias_value":"EL4PBTI4CDSM","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EL4PBTI4CDSM3PR2","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EL4PBTI4","created_at":"2026-05-18T12:33:15.570797+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/EL4PBTI4CDSM3PR2OR6ASQ2OYY","json":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY.json","graph_json":"https://pith.science/api/pith-number/EL4PBTI4CDSM3PR2OR6ASQ2OYY/graph.json","events_json":"https://pith.science/api/pith-number/EL4PBTI4CDSM3PR2OR6ASQ2OYY/events.json","paper":"https://pith.science/paper/EL4PBTI4"},"agent_actions":{"view_html":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY","download_json":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY.json","view_paper":"https://pith.science/paper/EL4PBTI4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.09843&json=true","fetch_graph":"https://pith.science/api/pith-number/EL4PBTI4CDSM3PR2OR6ASQ2OYY/graph.json","fetch_events":"https://pith.science/api/pith-number/EL4PBTI4CDSM3PR2OR6ASQ2OYY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/action/storage_attestation","attest_author":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/action/author_attestation","sign_citation":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/action/citation_signature","submit_replication":"https://pith.science/pith/EL4PBTI4CDSM3PR2OR6ASQ2OYY/action/replication_record"}},"created_at":"2026-05-17T23:50:35.345533+00:00","updated_at":"2026-05-17T23:50:35.345533+00:00"}