{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:AOEMY2Y53U4Z7HZ663JXTLGUWA","short_pith_number":"pith:AOEMY2Y5","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"},"canonical_sha256":"0388cc6b1ddd399f9f3ef6d379acd4b0309815e5d32aa0a6ddf0c6683f16b0a2","source":{"kind":"arxiv","id":"1708.04903","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04903","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04903v1","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04903","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"AOEMY2Y53U4Z","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AOEMY2Y53U4Z7HZ6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AOEMY2Y5","created_at":"2026-05-18T12:31:05Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:AOEMY2Y53U4Z7HZ663JXTLGUWA","target":"record","payload":{"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"},"canonical_sha256":"0388cc6b1ddd399f9f3ef6d379acd4b0309815e5d32aa0a6ddf0c6683f16b0a2","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"},"source_kind":"arxiv","source_id":"1708.04903","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:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OpoBFaWS+Cyot+rkXk+qmGJguwPQE6GKdGOuraQ5x0V0bAO04+duloAbYfwJIV/nB61jCPkN1CR67hNLSHJnBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:19:55.599023Z"},"content_sha256":"c30a15bb0f2be96b548bece3ed6fdc03015c03b9f62e421022e64f4e31027a70","schema_version":"1.0","event_id":"sha256:c30a15bb0f2be96b548bece3ed6fdc03015c03b9f62e421022e64f4e31027a70"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:AOEMY2Y53U4Z7HZ663JXTLGUWA","target":"graph","payload":{"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"},"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:37:55Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BCzriI4f7G56oskizSgGlWYsSkVLpwaLo3QbgCy9PxYuZoIZg3PKDJtTjp2sVjJ1730lEcNcd4oopH9YKv3iCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T23:19:55.599383Z"},"content_sha256":"098bd89595a28444e0616921e30877a3f733f7f1e6730fbf123aeff224499c0f","schema_version":"1.0","event_id":"sha256:098bd89595a28444e0616921e30877a3f733f7f1e6730fbf123aeff224499c0f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/bundle.json","state_url":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/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-08T23:19:55Z","links":{"resolver":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA","bundle":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/bundle.json","state":"https://pith.science/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/AOEMY2Y53U4Z7HZ663JXTLGUWA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:AOEMY2Y53U4Z7HZ663JXTLGUWA","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":"f9ea3a20fdab4b1618691b742d7d580594b337a8c2dee62242d8cc63b309ea01","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T14:13:06Z","title_canon_sha256":"830edc02aed5646290287b4ff6c91ca1b12bb0cfb218087b2dba85df966035f5"},"schema_version":"1.0","source":{"id":"1708.04903","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04903","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04903v1","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04903","created_at":"2026-05-18T00:37:55Z"},{"alias_kind":"pith_short_12","alias_value":"AOEMY2Y53U4Z","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_16","alias_value":"AOEMY2Y53U4Z7HZ6","created_at":"2026-05-18T12:31:05Z"},{"alias_kind":"pith_short_8","alias_value":"AOEMY2Y5","created_at":"2026-05-18T12:31:05Z"}],"graph_snapshots":[{"event_id":"sha256:098bd89595a28444e0616921e30877a3f733f7f1e6730fbf123aeff224499c0f","target":"graph","created_at":"2026-05-18T00:37:55Z","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":"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","authors_text":"Nguyen Kim Thang","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T14:13:06Z","title":"Online Primal-Dual Algorithms with Configuration Linear Programs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04903","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:c30a15bb0f2be96b548bece3ed6fdc03015c03b9f62e421022e64f4e31027a70","target":"record","created_at":"2026-05-18T00:37:55Z","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":"f9ea3a20fdab4b1618691b742d7d580594b337a8c2dee62242d8cc63b309ea01","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-08-16T14:13:06Z","title_canon_sha256":"830edc02aed5646290287b4ff6c91ca1b12bb0cfb218087b2dba85df966035f5"},"schema_version":"1.0","source":{"id":"1708.04903","kind":"arxiv","version":1}},"canonical_sha256":"0388cc6b1ddd399f9f3ef6d379acd4b0309815e5d32aa0a6ddf0c6683f16b0a2","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"0388cc6b1ddd399f9f3ef6d379acd4b0309815e5d32aa0a6ddf0c6683f16b0a2","first_computed_at":"2026-05-18T00:37:55.227436Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:55.227436Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"NYfXW/Pe3eeN9QHn2W4u3RALwY9AmLzzT+uFEWob2zb2vUzKYX9GXBwvunifqqnJc8LkdzY4i8F4wbRf341BAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:55.228002Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04903","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c30a15bb0f2be96b548bece3ed6fdc03015c03b9f62e421022e64f4e31027a70","sha256:098bd89595a28444e0616921e30877a3f733f7f1e6730fbf123aeff224499c0f"],"state_sha256":"23566b768731e7c1234f735c36a89ed7b9873f705ae657f1e4bd0c1fdcd9cf47"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"WoIfhMohvnDg7OLoXURSliBp70PdqshYsv4zSQobGq/WsVxkw8BlQgIaKNCA7YG3mWokl51KkKRb+7bVa2uGAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T23:19:55.601242Z","bundle_sha256":"fdda6b4afda2f41873d5a35e0394c4d7f8029989b910a8f84ccbc621196ec9ee"}}