{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LIFMV5KYREQTMIIS6EYPELUUI5","short_pith_number":"pith:LIFMV5KY","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"},"canonical_sha256":"5a0acaf5588921362112f130f22e94474fb4616eeb7583f3425f3abab393ecc6","source":{"kind":"arxiv","id":"1811.05022","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05022","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05022v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05022","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"LIFMV5KYREQT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIFMV5KYREQTMIIS","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIFMV5KY","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LIFMV5KYREQTMIIS6EYPELUUI5","target":"record","payload":{"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"},"canonical_sha256":"5a0acaf5588921362112f130f22e94474fb4616eeb7583f3425f3abab393ecc6","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"},"source_kind":"arxiv","source_id":"1811.05022","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-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QxmC2We7LBPfCarC8bG7Ki65QEVut5Rt6b3kjflUpJ0I8HT1cjG4zuJV/RoTS/LK62G1Abjx4KvquEM6Cm7lDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:02.767705Z"},"content_sha256":"28101868bbe969b6faac29a9ca59237f63ea7944021ffd7d145f4df4d4d3a3ad","schema_version":"1.0","event_id":"sha256:28101868bbe969b6faac29a9ca59237f63ea7944021ffd7d145f4df4d4d3a3ad"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LIFMV5KYREQTMIIS6EYPELUUI5","target":"graph","payload":{"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"},"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-18T00:01:01Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g2UcM1VRkIWlo9USvzYM3twxBGhOg+qPJ7JNGivTeN8anopZEpuTaHaXBn1iLPkxOMfuELWmn4phBndZM3j/Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T15:55:02.768045Z"},"content_sha256":"ef6dc6d6932c584e63935c235c9db28118c1245eb80285be01166de08594ef06","schema_version":"1.0","event_id":"sha256:ef6dc6d6932c584e63935c235c9db28118c1245eb80285be01166de08594ef06"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/bundle.json","state_url":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LIFMV5KYREQTMIIS6EYPELUUI5/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-01T15:55:02Z","links":{"resolver":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5","bundle":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/bundle.json","state":"https://pith.science/pith/LIFMV5KYREQTMIIS6EYPELUUI5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LIFMV5KYREQTMIIS6EYPELUUI5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LIFMV5KYREQTMIIS6EYPELUUI5","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":"c694f9a5868a283f9177d535d33e1d29ce3ff9887c13db9b1b3d1a0db8e3bc4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T22:10:29Z","title_canon_sha256":"eb3bf2cdd48b86801bdb206cd9ba56038c6563dee082d3c116bbd83dc96119c8"},"schema_version":"1.0","source":{"id":"1811.05022","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.05022","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"arxiv_version","alias_value":"1811.05022v1","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.05022","created_at":"2026-05-18T00:01:01Z"},{"alias_kind":"pith_short_12","alias_value":"LIFMV5KYREQT","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LIFMV5KYREQTMIIS","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LIFMV5KY","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:ef6dc6d6932c584e63935c235c9db28118c1245eb80285be01166de08594ef06","target":"graph","created_at":"2026-05-18T00:01:01Z","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":"$ $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","authors_text":"Chaitanya Swamy, Deeparnab Chakrabarty","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T22:10:29Z","title":"Approximation Algorithms for Minimum Norm and Ordered Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.05022","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:28101868bbe969b6faac29a9ca59237f63ea7944021ffd7d145f4df4d4d3a3ad","target":"record","created_at":"2026-05-18T00:01:01Z","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":"c694f9a5868a283f9177d535d33e1d29ce3ff9887c13db9b1b3d1a0db8e3bc4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2018-11-12T22:10:29Z","title_canon_sha256":"eb3bf2cdd48b86801bdb206cd9ba56038c6563dee082d3c116bbd83dc96119c8"},"schema_version":"1.0","source":{"id":"1811.05022","kind":"arxiv","version":1}},"canonical_sha256":"5a0acaf5588921362112f130f22e94474fb4616eeb7583f3425f3abab393ecc6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a0acaf5588921362112f130f22e94474fb4616eeb7583f3425f3abab393ecc6","first_computed_at":"2026-05-18T00:01:01.427918Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:01:01.427918Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CbbfJxZFf0zEEAaWB8uDPyZUfxU3o/thafJKGEHCZKzsNVHbZ64DBKNWY3l7PbLZjC1Xx2+t6UTzHuHpjIksBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:01:01.428356Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.05022","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:28101868bbe969b6faac29a9ca59237f63ea7944021ffd7d145f4df4d4d3a3ad","sha256:ef6dc6d6932c584e63935c235c9db28118c1245eb80285be01166de08594ef06"],"state_sha256":"be46fa0a27887d6599bec65eac31e536904c2509f441c15b2f5662ff7265a70c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"v5RACvR92DMeEZNA3k0Y96kjW4dGaQQ7iRpfiY7HDhCJLRHMWcMo2CNl0WhCA7/qNSpQ6pnAdcbCLAeqAIyACQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T15:55:02.769912Z","bundle_sha256":"2e84bf1a09ad4e6b2e78ec8940c723c5ba4471f589dabbd68994d1a33073eacc"}}