{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AOEMY2Y53U4Z7HZ663JXTLGUWA","short_pith_number":"pith:AOEMY2Y5","schema_version":"1.0","canonical_sha256":"0388cc6b1ddd399f9f3ef6d379acd4b0309815e5d32aa0a6ddf0c6683f16b0a2","source":{"kind":"arxiv","id":"1708.04903","version":1},"attestation_state":"computed","paper":{"title":"Online Primal-Dual Algorithms with Configuration Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Nguyen Kim Thang","submitted_at":"2017-08-16T14:13:06Z","abstract_excerpt":"Non-linear, especially convex, objective functions have been extensively studied in recent years in which approaches relies crucially on the convexity property of cost functions. In this paper, we present primal-dual approaches based on configuration linear programs to design competitive online algorithms for problems with arbitrarily-grown objective. This approach is particularly appropriate for non-linear (non-convex) objectives in online setting.\n  We first present a simple greedy algorithm for a general cost-minimization problem. The competitive ratio of the algorithm is characterized by t"},"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":"1708.04903","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T14:13:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"830edc02aed5646290287b4ff6c91ca1b12bb0cfb218087b2dba85df966035f5","abstract_canon_sha256":"f9ea3a20fdab4b1618691b742d7d580594b337a8c2dee62242d8cc63b309ea01"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:55.228002Z","signature_b64":"NYfXW/Pe3eeN9QHn2W4u3RALwY9AmLzzT+uFEWob2zb2vUzKYX9GXBwvunifqqnJc8LkdzY4i8F4wbRf341BAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0388cc6b1ddd399f9f3ef6d379acd4b0309815e5d32aa0a6ddf0c6683f16b0a2","last_reissued_at":"2026-05-18T00:37:55.227436Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:55.227436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Online Primal-Dual Algorithms with Configuration Linear Programs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Nguyen Kim Thang","submitted_at":"2017-08-16T14:13:06Z","abstract_excerpt":"Non-linear, especially convex, objective functions have been extensively studied in recent years in which approaches relies crucially on the convexity property of cost functions. In this paper, we present primal-dual approaches based on configuration linear programs to design competitive online algorithms for problems with arbitrarily-grown objective. This approach is particularly appropriate for non-linear (non-convex) objectives in online setting.\n  We first present a simple greedy algorithm for a general cost-minimization problem. The competitive ratio of the algorithm is characterized by t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04903","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":"1708.04903","created_at":"2026-05-18T00:37:55.227510+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.04903v1","created_at":"2026-05-18T00:37:55.227510+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04903","created_at":"2026-05-18T00:37:55.227510+00:00"},{"alias_kind":"pith_short_12","alias_value":"AOEMY2Y53U4Z","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AOEMY2Y53U4Z7HZ6","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AOEMY2Y5","created_at":"2026-05-18T12:31:05.417338+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/AOEMY2Y53U4Z7HZ663JXTLGUWA","json":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA.json","graph_json":"https://pith.science/api/pith-number/AOEMY2Y53U4Z7HZ663JXTLGUWA/graph.json","events_json":"https://pith.science/api/pith-number/AOEMY2Y53U4Z7HZ663JXTLGUWA/events.json","paper":"https://pith.science/paper/AOEMY2Y5"},"agent_actions":{"view_html":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA","download_json":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA.json","view_paper":"https://pith.science/paper/AOEMY2Y5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.04903&json=true","fetch_graph":"https://pith.science/api/pith-number/AOEMY2Y53U4Z7HZ663JXTLGUWA/graph.json","fetch_events":"https://pith.science/api/pith-number/AOEMY2Y53U4Z7HZ663JXTLGUWA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/action/storage_attestation","attest_author":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/action/author_attestation","sign_citation":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/action/citation_signature","submit_replication":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/action/replication_record"}},"created_at":"2026-05-18T00:37:55.227510+00:00","updated_at":"2026-05-18T00:37:55.227510+00:00"}