{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LIFMV5KYREQTMIIS6EYPELUUI5","short_pith_number":"pith:LIFMV5KY","schema_version":"1.0","canonical_sha256":"5a0acaf5588921362112f130f22e94474fb4616eeb7583f3425f3abab393ecc6","source":{"kind":"arxiv","id":"1811.05022","version":1},"attestation_state":"computed","paper":{"title":"Approximation Algorithms for Minimum Norm and Ordered Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","submitted_at":"2018-11-12T22:10:29Z","abstract_excerpt":"$ $In many optimization problems, a feasible solution induces a multi-dimensional cost vector. For example, in load-balancing a schedule induces a load vector across the machines. In $k$-clustering, opening $k$ facilities induces an assignment cost vector across the clients. In this paper we consider the following minimum norm optimization problem : Given an arbitrary monotone, symmetric norm, find a solution which minimizes the norm of the induced cost-vector. This generalizes many fundamental NP-hard problems.\n  We give a general framework to tackle the minimum norm problem, and illustrate i"},"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":"1811.05022","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T22:10:29Z","cross_cats_sorted":[],"title_canon_sha256":"eb3bf2cdd48b86801bdb206cd9ba56038c6563dee082d3c116bbd83dc96119c8","abstract_canon_sha256":"c694f9a5868a283f9177d535d33e1d29ce3ff9887c13db9b1b3d1a0db8e3bc4a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:01:01.428356Z","signature_b64":"CbbfJxZFf0zEEAaWB8uDPyZUfxU3o/thafJKGEHCZKzsNVHbZ64DBKNWY3l7PbLZjC1Xx2+t6UTzHuHpjIksBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a0acaf5588921362112f130f22e94474fb4616eeb7583f3425f3abab393ecc6","last_reissued_at":"2026-05-18T00:01:01.427918Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:01:01.427918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Approximation Algorithms for Minimum Norm and Ordered Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","submitted_at":"2018-11-12T22:10:29Z","abstract_excerpt":"$ $In many optimization problems, a feasible solution induces a multi-dimensional cost vector. For example, in load-balancing a schedule induces a load vector across the machines. In $k$-clustering, opening $k$ facilities induces an assignment cost vector across the clients. In this paper we consider the following minimum norm optimization problem : Given an arbitrary monotone, symmetric norm, find a solution which minimizes the norm of the induced cost-vector. This generalizes many fundamental NP-hard problems.\n  We give a general framework to tackle the minimum norm problem, and illustrate i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05022","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":"1811.05022","created_at":"2026-05-18T00:01:01.427975+00:00"},{"alias_kind":"arxiv_version","alias_value":"1811.05022v1","created_at":"2026-05-18T00:01:01.427975+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05022","created_at":"2026-05-18T00:01:01.427975+00:00"},{"alias_kind":"pith_short_12","alias_value":"LIFMV5KYREQT","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LIFMV5KYREQTMIIS","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LIFMV5KY","created_at":"2026-05-18T12:32:37.024351+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/LIFMV5KYREQTMIIS6EYPELUUI5","json":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5.json","graph_json":"https://pith.science/api/pith-number/LIFMV5KYREQTMIIS6EYPELUUI5/graph.json","events_json":"https://pith.science/api/pith-number/LIFMV5KYREQTMIIS6EYPELUUI5/events.json","paper":"https://pith.science/paper/LIFMV5KY"},"agent_actions":{"view_html":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5","download_json":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5.json","view_paper":"https://pith.science/paper/LIFMV5KY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1811.05022&json=true","fetch_graph":"https://pith.science/api/pith-number/LIFMV5KYREQTMIIS6EYPELUUI5/graph.json","fetch_events":"https://pith.science/api/pith-number/LIFMV5KYREQTMIIS6EYPELUUI5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/action/storage_attestation","attest_author":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/action/author_attestation","sign_citation":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/action/citation_signature","submit_replication":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/action/replication_record"}},"created_at":"2026-05-18T00:01:01.427975+00:00","updated_at":"2026-05-18T00:01:01.427975+00:00"}