{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2011:OTBGEQ4SNGJADGDJZMATPCQEYN","short_pith_number":"pith:OTBGEQ4S","schema_version":"1.0","canonical_sha256":"74c26243926992019869cb01378a04c363e81d8895be0ab15176a60ddec2c038","source":{"kind":"arxiv","id":"1109.5931","version":1},"attestation_state":"computed","paper":{"title":"Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Kirk Pruhs, Ravishankar Krishnaswamy","submitted_at":"2011-09-27T15:19:08Z","abstract_excerpt":"We reinterpret some online greedy algorithms for a class of nonlinear \"load-balancing\" problems as solving a mathematical program online. For example, we consider the problem of assigning jobs to (unrelated) machines to minimize the sum of the alpha^{th}-powers of the loads plus assignment costs (the online Generalized Assignment Problem); or choosing paths to connect terminal pairs to minimize the alpha^{th}-powers of the edge loads (online routing with speed-scalable routers). We give analyses of these online algorithms using the dual of the primal program as a lower bound for the optimal al"},"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":"1109.5931","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2011-09-27T15:19:08Z","cross_cats_sorted":[],"title_canon_sha256":"414876afddb7acf3260a88d60ccf6eac9bbcc3391e8b072b7f13a23e18be49cf","abstract_canon_sha256":"130286ce862687fbc18b06cf17e3b8552bf2c43cc0f2494aa5eda5aebd358886"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:12:10.988086Z","signature_b64":"9ocJIJiMy/kjQch660PenGLaqVfg9al+dTNeqnf2DeGBJkG5aaub/DUYaiekd6btS9nABVkW3YZFYlKK4GoSAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"74c26243926992019869cb01378a04c363e81d8895be0ab15176a60ddec2c038","last_reissued_at":"2026-05-18T04:12:10.987615Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:12:10.987615Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Primal-Dual For Non-linear Optimization with Applications to Speed Scaling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Anupam Gupta, Kirk Pruhs, Ravishankar Krishnaswamy","submitted_at":"2011-09-27T15:19:08Z","abstract_excerpt":"We reinterpret some online greedy algorithms for a class of nonlinear \"load-balancing\" problems as solving a mathematical program online. For example, we consider the problem of assigning jobs to (unrelated) machines to minimize the sum of the alpha^{th}-powers of the loads plus assignment costs (the online Generalized Assignment Problem); or choosing paths to connect terminal pairs to minimize the alpha^{th}-powers of the edge loads (online routing with speed-scalable routers). We give analyses of these online algorithms using the dual of the primal program as a lower bound for the optimal al"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1109.5931","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":"1109.5931","created_at":"2026-05-18T04:12:10.987680+00:00"},{"alias_kind":"arxiv_version","alias_value":"1109.5931v1","created_at":"2026-05-18T04:12:10.987680+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1109.5931","created_at":"2026-05-18T04:12:10.987680+00:00"},{"alias_kind":"pith_short_12","alias_value":"OTBGEQ4SNGJA","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_16","alias_value":"OTBGEQ4SNGJADGDJ","created_at":"2026-05-18T12:26:37.096874+00:00"},{"alias_kind":"pith_short_8","alias_value":"OTBGEQ4S","created_at":"2026-05-18T12:26:37.096874+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/OTBGEQ4SNGJADGDJZMATPCQEYN","json":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN.json","graph_json":"https://pith.science/api/pith-number/OTBGEQ4SNGJADGDJZMATPCQEYN/graph.json","events_json":"https://pith.science/api/pith-number/OTBGEQ4SNGJADGDJZMATPCQEYN/events.json","paper":"https://pith.science/paper/OTBGEQ4S"},"agent_actions":{"view_html":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN","download_json":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN.json","view_paper":"https://pith.science/paper/OTBGEQ4S","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1109.5931&json=true","fetch_graph":"https://pith.science/api/pith-number/OTBGEQ4SNGJADGDJZMATPCQEYN/graph.json","fetch_events":"https://pith.science/api/pith-number/OTBGEQ4SNGJADGDJZMATPCQEYN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN/action/storage_attestation","attest_author":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN/action/author_attestation","sign_citation":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN/action/citation_signature","submit_replication":"https://pith.science/pith/OTBGEQ4SNGJADGDJZMATPCQEYN/action/replication_record"}},"created_at":"2026-05-18T04:12:10.987680+00:00","updated_at":"2026-05-18T04:12:10.987680+00:00"}