{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:NE2CVGKSYZOXMRJABPSDXVDW35","short_pith_number":"pith:NE2CVGKS","canonical_record":{"source":{"id":"1408.0965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-05T13:37:57Z","cross_cats_sorted":[],"title_canon_sha256":"8aa1946fd0de2b828cf6a2bc8ff25b567515b61281b67562d3b9cb5cc61ebee8","abstract_canon_sha256":"73979f2eb746d9df101d03d3fb4359bc67828ddeb94d63f77b11079a2becac43"},"schema_version":"1.0"},"canonical_sha256":"69342a9952c65d7645200be43bd476df74091bf78d77e7b579736b5617af530a","source":{"kind":"arxiv","id":"1408.0965","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0965","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0965v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0965","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"NE2CVGKSYZOX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NE2CVGKSYZOXMRJA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NE2CVGKS","created_at":"2026-05-18T12:28:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:NE2CVGKSYZOXMRJABPSDXVDW35","target":"record","payload":{"canonical_record":{"source":{"id":"1408.0965","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-05T13:37:57Z","cross_cats_sorted":[],"title_canon_sha256":"8aa1946fd0de2b828cf6a2bc8ff25b567515b61281b67562d3b9cb5cc61ebee8","abstract_canon_sha256":"73979f2eb746d9df101d03d3fb4359bc67828ddeb94d63f77b11079a2becac43"},"schema_version":"1.0"},"canonical_sha256":"69342a9952c65d7645200be43bd476df74091bf78d77e7b579736b5617af530a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:45:50.089216Z","signature_b64":"h6mXOvMOvV7fiOYATzTkzqUq1h6Y1Cjaypal46BBXE1EELi1RxUI4WHQIX4/hNYHrAQdXiD5iNhH9U0ech2bDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69342a9952c65d7645200be43bd476df74091bf78d77e7b579736b5617af530a","last_reissued_at":"2026-05-18T02:45:50.088702Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:45:50.088702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1408.0965","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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wJqVYcxTtDHYsxy4RjxibTaRBYkTqaaaOMxwOshoSd2sGadn6DlsfaqO920jK4aqb5R9ZmjUyFV9+C/w9asRBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:24:12.833560Z"},"content_sha256":"8c28a824635a3ad07a61ab8e957d7f72620feadd09388c8ba914122353403326","schema_version":"1.0","event_id":"sha256:8c28a824635a3ad07a61ab8e957d7f72620feadd09388c8ba914122353403326"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:NE2CVGKSYZOXMRJABPSDXVDW35","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Lagrangian Duality based Algorithms in Online Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nguyen Kim Thang","submitted_at":"2014-08-05T13:37:57Z","abstract_excerpt":"We consider Lagrangian duality based approaches to design and analyze algorithms for online energy-efficient scheduling. First, we present a primal-dual framework. Our approach makes use of the Lagrangian weak duality and convexity to derive dual programs for problems which could be formulated as convex assignment problems. The duals have intuitive structures as the ones in linear programming. The constraints of the duals explicitly indicate the online decisions and naturally lead to competitive algorithms. Second, we use a dual-fitting approach, which also based on the weak duality, to study "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0965","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-18T02:45:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Gx+XF8ASD6SnJew8eAfKs+4MFHtU1N5vQnh8oHIgqyQxuMUrzj31AGlMpfGtIj+/VHQi44Xk9qNpeGkBXJnADQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T19:24:12.834241Z"},"content_sha256":"814f232dd3305ef5fd477c27b533b394bcb9b79a97fe2f31c50cb479203997d5","schema_version":"1.0","event_id":"sha256:814f232dd3305ef5fd477c27b533b394bcb9b79a97fe2f31c50cb479203997d5"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NE2CVGKSYZOXMRJABPSDXVDW35/bundle.json","state_url":"https://pith.science/pith/NE2CVGKSYZOXMRJABPSDXVDW35/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NE2CVGKSYZOXMRJABPSDXVDW35/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-08T19:24:12Z","links":{"resolver":"https://pith.science/pith/NE2CVGKSYZOXMRJABPSDXVDW35","bundle":"https://pith.science/pith/NE2CVGKSYZOXMRJABPSDXVDW35/bundle.json","state":"https://pith.science/pith/NE2CVGKSYZOXMRJABPSDXVDW35/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NE2CVGKSYZOXMRJABPSDXVDW35/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:NE2CVGKSYZOXMRJABPSDXVDW35","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":"73979f2eb746d9df101d03d3fb4359bc67828ddeb94d63f77b11079a2becac43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-05T13:37:57Z","title_canon_sha256":"8aa1946fd0de2b828cf6a2bc8ff25b567515b61281b67562d3b9cb5cc61ebee8"},"schema_version":"1.0","source":{"id":"1408.0965","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1408.0965","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"arxiv_version","alias_value":"1408.0965v1","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1408.0965","created_at":"2026-05-18T02:45:50Z"},{"alias_kind":"pith_short_12","alias_value":"NE2CVGKSYZOX","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_16","alias_value":"NE2CVGKSYZOXMRJA","created_at":"2026-05-18T12:28:41Z"},{"alias_kind":"pith_short_8","alias_value":"NE2CVGKS","created_at":"2026-05-18T12:28:41Z"}],"graph_snapshots":[{"event_id":"sha256:814f232dd3305ef5fd477c27b533b394bcb9b79a97fe2f31c50cb479203997d5","target":"graph","created_at":"2026-05-18T02:45:50Z","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":"We consider Lagrangian duality based approaches to design and analyze algorithms for online energy-efficient scheduling. First, we present a primal-dual framework. Our approach makes use of the Lagrangian weak duality and convexity to derive dual programs for problems which could be formulated as convex assignment problems. The duals have intuitive structures as the ones in linear programming. The constraints of the duals explicitly indicate the online decisions and naturally lead to competitive algorithms. Second, we use a dual-fitting approach, which also based on the weak duality, to study ","authors_text":"Nguyen Kim Thang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-05T13:37:57Z","title":"Lagrangian Duality based Algorithms in Online Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1408.0965","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:8c28a824635a3ad07a61ab8e957d7f72620feadd09388c8ba914122353403326","target":"record","created_at":"2026-05-18T02:45:50Z","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":"73979f2eb746d9df101d03d3fb4359bc67828ddeb94d63f77b11079a2becac43","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-08-05T13:37:57Z","title_canon_sha256":"8aa1946fd0de2b828cf6a2bc8ff25b567515b61281b67562d3b9cb5cc61ebee8"},"schema_version":"1.0","source":{"id":"1408.0965","kind":"arxiv","version":1}},"canonical_sha256":"69342a9952c65d7645200be43bd476df74091bf78d77e7b579736b5617af530a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69342a9952c65d7645200be43bd476df74091bf78d77e7b579736b5617af530a","first_computed_at":"2026-05-18T02:45:50.088702Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:45:50.088702Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"h6mXOvMOvV7fiOYATzTkzqUq1h6Y1Cjaypal46BBXE1EELi1RxUI4WHQIX4/hNYHrAQdXiD5iNhH9U0ech2bDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:45:50.089216Z","signed_message":"canonical_sha256_bytes"},"source_id":"1408.0965","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8c28a824635a3ad07a61ab8e957d7f72620feadd09388c8ba914122353403326","sha256:814f232dd3305ef5fd477c27b533b394bcb9b79a97fe2f31c50cb479203997d5"],"state_sha256":"23a944569682ce2136ffc6e1ddd951196ca8b00ce93277cd25acee73765d6e59"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"txWXyZ+1b1GuY85LEbwHhVvPta1Q/GzvLVJqm6a87GezM9gOobiMwn1ivjQlwyad/0j6g66gPWjTcvUSMaJKBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T19:24:12.838614Z","bundle_sha256":"f33eda7694a55274c6fa6ccda69c90c59b3edcbd4cc37cec5682052e548ffc4f"}}