{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:FE4UTAN4HMBTNPBMEP67ZNVITI","short_pith_number":"pith:FE4UTAN4","canonical_record":{"source":{"id":"1403.1896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-07T23:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"dda61f1d9db8592f9c158c5003ef55b5092f27525d82657796404a063e8bbb9c","abstract_canon_sha256":"f7b75948617ce11350a0afcee7900cdd8f4ce8fbeb09f724554a027b50247895"},"schema_version":"1.0"},"canonical_sha256":"29394981bc3b0336bc2c23fdfcb6a89a2e0c8cce96f6a5979f58f9847a675da1","source":{"kind":"arxiv","id":"1403.1896","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1896","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1896v1","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1896","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"FE4UTAN4HMBT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FE4UTAN4HMBTNPBM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FE4UTAN4","created_at":"2026-05-18T12:28:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:FE4UTAN4HMBTNPBMEP67ZNVITI","target":"record","payload":{"canonical_record":{"source":{"id":"1403.1896","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-07T23:17:15Z","cross_cats_sorted":[],"title_canon_sha256":"dda61f1d9db8592f9c158c5003ef55b5092f27525d82657796404a063e8bbb9c","abstract_canon_sha256":"f7b75948617ce11350a0afcee7900cdd8f4ce8fbeb09f724554a027b50247895"},"schema_version":"1.0"},"canonical_sha256":"29394981bc3b0336bc2c23fdfcb6a89a2e0c8cce96f6a5979f58f9847a675da1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:56:51.331281Z","signature_b64":"GLtkgXi8HeXvKszTmlu3H2sNZBx7+MIK9LCpjX1D9GJHbrlR30O+6+0h5p2KttuYFVvDrpgWcjpAYRJ9uo3mBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"29394981bc3b0336bc2c23fdfcb6a89a2e0c8cce96f6a5979f58f9847a675da1","last_reissued_at":"2026-05-18T02:56:51.330879Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:56:51.330879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1403.1896","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:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nvchS+7jdPkk45drh89oiA+HhQN0ckkbKgEPv3qmYByLLHOkSSs1XxUlDINTrFlCWvcqkVArJjczM7HW7y1CBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:43:52.888593Z"},"content_sha256":"52c72ffaebb0130ea659948074cc9c849375f405cce1e04d5a1f1d730eeb2eb9","schema_version":"1.0","event_id":"sha256:52c72ffaebb0130ea659948074cc9c849375f405cce1e04d5a1f1d730eeb2eb9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:FE4UTAN4HMBTNPBMEP67ZNVITI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Online Mechanism Design for Cloud Computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.GT","authors_text":"Bo Zheng, Pingzhong Tang, Tao Qin, Tie-Yan Liu, Weidong Ma","submitted_at":"2014-03-07T23:17:15Z","abstract_excerpt":"In this work, we study the problem of online mechanism design for resources allocation and pricing in cloud computing (RAPCC). We show that in general the allocation problems in RAPCC are NP-hard, and therefore we focus on designing dominant-strategy incentive compatible (DSIC) mechanisms with good competitive ratios compared to the offline optimal allocation (with the prior knowledge about the future jobs). We propose two kinds of DSIC online mechanisms. The first mechanism, which is based on a greedy allocation rule and leverages a priority function for allocation, is very fast and has a tig"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1896","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:56:51Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oEp2b1jVpx1KFoMF4ATeWVmuhTjp0FxyQF4qKvW2j2uI92ezRl7sh/yEB2qdA4EoOrKSlZfbqPW94dvgAduGCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-20T03:43:52.889253Z"},"content_sha256":"400b03c2597fce7a5e99b985cfdfdc5779733ece547bd791607c3d49fd28c084","schema_version":"1.0","event_id":"sha256:400b03c2597fce7a5e99b985cfdfdc5779733ece547bd791607c3d49fd28c084"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FE4UTAN4HMBTNPBMEP67ZNVITI/bundle.json","state_url":"https://pith.science/pith/FE4UTAN4HMBTNPBMEP67ZNVITI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FE4UTAN4HMBTNPBMEP67ZNVITI/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-05-20T03:43:52Z","links":{"resolver":"https://pith.science/pith/FE4UTAN4HMBTNPBMEP67ZNVITI","bundle":"https://pith.science/pith/FE4UTAN4HMBTNPBMEP67ZNVITI/bundle.json","state":"https://pith.science/pith/FE4UTAN4HMBTNPBMEP67ZNVITI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FE4UTAN4HMBTNPBMEP67ZNVITI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:FE4UTAN4HMBTNPBMEP67ZNVITI","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":"f7b75948617ce11350a0afcee7900cdd8f4ce8fbeb09f724554a027b50247895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-07T23:17:15Z","title_canon_sha256":"dda61f1d9db8592f9c158c5003ef55b5092f27525d82657796404a063e8bbb9c"},"schema_version":"1.0","source":{"id":"1403.1896","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1403.1896","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"arxiv_version","alias_value":"1403.1896v1","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1403.1896","created_at":"2026-05-18T02:56:51Z"},{"alias_kind":"pith_short_12","alias_value":"FE4UTAN4HMBT","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_16","alias_value":"FE4UTAN4HMBTNPBM","created_at":"2026-05-18T12:28:28Z"},{"alias_kind":"pith_short_8","alias_value":"FE4UTAN4","created_at":"2026-05-18T12:28:28Z"}],"graph_snapshots":[{"event_id":"sha256:400b03c2597fce7a5e99b985cfdfdc5779733ece547bd791607c3d49fd28c084","target":"graph","created_at":"2026-05-18T02:56:51Z","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 this work, we study the problem of online mechanism design for resources allocation and pricing in cloud computing (RAPCC). We show that in general the allocation problems in RAPCC are NP-hard, and therefore we focus on designing dominant-strategy incentive compatible (DSIC) mechanisms with good competitive ratios compared to the offline optimal allocation (with the prior knowledge about the future jobs). We propose two kinds of DSIC online mechanisms. The first mechanism, which is based on a greedy allocation rule and leverages a priority function for allocation, is very fast and has a tig","authors_text":"Bo Zheng, Pingzhong Tang, Tao Qin, Tie-Yan Liu, Weidong Ma","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-07T23:17:15Z","title":"Online Mechanism Design for Cloud Computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1403.1896","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:52c72ffaebb0130ea659948074cc9c849375f405cce1e04d5a1f1d730eeb2eb9","target":"record","created_at":"2026-05-18T02:56:51Z","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":"f7b75948617ce11350a0afcee7900cdd8f4ce8fbeb09f724554a027b50247895","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-03-07T23:17:15Z","title_canon_sha256":"dda61f1d9db8592f9c158c5003ef55b5092f27525d82657796404a063e8bbb9c"},"schema_version":"1.0","source":{"id":"1403.1896","kind":"arxiv","version":1}},"canonical_sha256":"29394981bc3b0336bc2c23fdfcb6a89a2e0c8cce96f6a5979f58f9847a675da1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"29394981bc3b0336bc2c23fdfcb6a89a2e0c8cce96f6a5979f58f9847a675da1","first_computed_at":"2026-05-18T02:56:51.330879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:56:51.330879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GLtkgXi8HeXvKszTmlu3H2sNZBx7+MIK9LCpjX1D9GJHbrlR30O+6+0h5p2KttuYFVvDrpgWcjpAYRJ9uo3mBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:56:51.331281Z","signed_message":"canonical_sha256_bytes"},"source_id":"1403.1896","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:52c72ffaebb0130ea659948074cc9c849375f405cce1e04d5a1f1d730eeb2eb9","sha256:400b03c2597fce7a5e99b985cfdfdc5779733ece547bd791607c3d49fd28c084"],"state_sha256":"8a314a0c27b5f07872996ae130144399cb318c666aebed14ab0f75cf5fe402b5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Rl1Ex7VOcfkGndE0cAXEAU6otOzdzT456qHv9xHBoC4u0QWRkECZRf3VQF0j78Jm1al1b+FSV+AwH3i+fg0JCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-20T03:43:52.894403Z","bundle_sha256":"27caa6affee6c11d76405b66fe28221b97bb27b44a793c1393a260b26f4ed7e9"}}