{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NHAR5ZLITTMU2LU2L4PEQLKXOH","short_pith_number":"pith:NHAR5ZLI","canonical_record":{"source":{"id":"1212.0875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"2b0fa703f8890acdcf185a139250cbffb86cc9abd868454f2e05eec1a4ecba7f","abstract_canon_sha256":"4d9190b48e869e284618d7a11f83e2d97138a7f243eb46b77ed76534c1e81e86"},"schema_version":"1.0"},"canonical_sha256":"69c11ee5689cd94d2e9a5f1e482d5771e467debf8396f467e6f24fcf44936d34","source":{"kind":"arxiv","id":"1212.0875","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0875","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0875v1","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0875","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"pith_short_12","alias_value":"NHAR5ZLITTMU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NHAR5ZLITTMU2LU2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NHAR5ZLI","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NHAR5ZLITTMU2LU2L4PEQLKXOH","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0875","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:17:24Z","cross_cats_sorted":[],"title_canon_sha256":"2b0fa703f8890acdcf185a139250cbffb86cc9abd868454f2e05eec1a4ecba7f","abstract_canon_sha256":"4d9190b48e869e284618d7a11f83e2d97138a7f243eb46b77ed76534c1e81e86"},"schema_version":"1.0"},"canonical_sha256":"69c11ee5689cd94d2e9a5f1e482d5771e467debf8396f467e6f24fcf44936d34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:14.210387Z","signature_b64":"9IhsTSlz+UHdlmFgfudib0/ihqZrfSUc4TowFV0aTxVBtSMgYTCtSeqFT7z0pNjvLC8CBNX1NuW9SgYolK1cDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"69c11ee5689cd94d2e9a5f1e482d5771e467debf8396f467e6f24fcf44936d34","last_reissued_at":"2026-05-18T03:39:14.209682Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:14.209682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0875","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-18T03:39:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wT4LF83lnWHtlHmIOQstkCW3W+OtTTkio/iiZmBX/fKiP+pI9ZUaDDNQmIAi+q0d2bNnB28pQ9yZjDj1GinVBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:55:49.295421Z"},"content_sha256":"513fef8699306ebb5d50af3ad8ed8a01ddd53f1433c8b8c5bc0df71a136034e9","schema_version":"1.0","event_id":"sha256:513fef8699306ebb5d50af3ad8ed8a01ddd53f1433c8b8c5bc0df71a136034e9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NHAR5ZLITTMU2LU2L4PEQLKXOH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A large-scale service system with packing constraints: Minimizing the number of occupied servers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Alexander L. Stolyar, Yuan Zhong","submitted_at":"2012-12-04T21:17:24Z","abstract_excerpt":"We consider a large-scale service system model motivated by the problem of efficient placement of virtual machines to physical host machines in a network cloud, so that the total number of occupied hosts is minimized. Customers of different types arrive to a system with an infinite number of servers. A server packing configuration is the vector $k = (k_i)$, where $k_i$ is the number of type-$i$ customers that the server \"contains\". Packing constraints are described by a fixed finite set of allowed configurations. Upon arrival, each customer is placed into a server immediately, subject to the p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0875","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-18T03:39:14Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"U5c8Znua+AsoAzl8m+IWWvWCY+opgXUAslP/Q2qEWV6HTtuBzWCx1aWrTZ0EZD2ipM9EhDFNyduKhPGlc2aRAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T12:55:49.296072Z"},"content_sha256":"43338aa8a48d49eb2a8c2b22d9e17ccd2ae46fe3d757a376bcce500ac562ba0c","schema_version":"1.0","event_id":"sha256:43338aa8a48d49eb2a8c2b22d9e17ccd2ae46fe3d757a376bcce500ac562ba0c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NHAR5ZLITTMU2LU2L4PEQLKXOH/bundle.json","state_url":"https://pith.science/pith/NHAR5ZLITTMU2LU2L4PEQLKXOH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NHAR5ZLITTMU2LU2L4PEQLKXOH/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-26T12:55:49Z","links":{"resolver":"https://pith.science/pith/NHAR5ZLITTMU2LU2L4PEQLKXOH","bundle":"https://pith.science/pith/NHAR5ZLITTMU2LU2L4PEQLKXOH/bundle.json","state":"https://pith.science/pith/NHAR5ZLITTMU2LU2L4PEQLKXOH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NHAR5ZLITTMU2LU2L4PEQLKXOH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NHAR5ZLITTMU2LU2L4PEQLKXOH","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":"4d9190b48e869e284618d7a11f83e2d97138a7f243eb46b77ed76534c1e81e86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:17:24Z","title_canon_sha256":"2b0fa703f8890acdcf185a139250cbffb86cc9abd868454f2e05eec1a4ecba7f"},"schema_version":"1.0","source":{"id":"1212.0875","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0875","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0875v1","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0875","created_at":"2026-05-18T03:39:14Z"},{"alias_kind":"pith_short_12","alias_value":"NHAR5ZLITTMU","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NHAR5ZLITTMU2LU2","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NHAR5ZLI","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:43338aa8a48d49eb2a8c2b22d9e17ccd2ae46fe3d757a376bcce500ac562ba0c","target":"graph","created_at":"2026-05-18T03:39:14Z","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 a large-scale service system model motivated by the problem of efficient placement of virtual machines to physical host machines in a network cloud, so that the total number of occupied hosts is minimized. Customers of different types arrive to a system with an infinite number of servers. A server packing configuration is the vector $k = (k_i)$, where $k_i$ is the number of type-$i$ customers that the server \"contains\". Packing constraints are described by a fixed finite set of allowed configurations. Upon arrival, each customer is placed into a server immediately, subject to the p","authors_text":"Alexander L. Stolyar, Yuan Zhong","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:17:24Z","title":"A large-scale service system with packing constraints: Minimizing the number of occupied servers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0875","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:513fef8699306ebb5d50af3ad8ed8a01ddd53f1433c8b8c5bc0df71a136034e9","target":"record","created_at":"2026-05-18T03:39:14Z","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":"4d9190b48e869e284618d7a11f83e2d97138a7f243eb46b77ed76534c1e81e86","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-12-04T21:17:24Z","title_canon_sha256":"2b0fa703f8890acdcf185a139250cbffb86cc9abd868454f2e05eec1a4ecba7f"},"schema_version":"1.0","source":{"id":"1212.0875","kind":"arxiv","version":1}},"canonical_sha256":"69c11ee5689cd94d2e9a5f1e482d5771e467debf8396f467e6f24fcf44936d34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"69c11ee5689cd94d2e9a5f1e482d5771e467debf8396f467e6f24fcf44936d34","first_computed_at":"2026-05-18T03:39:14.209682Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:14.209682Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"9IhsTSlz+UHdlmFgfudib0/ihqZrfSUc4TowFV0aTxVBtSMgYTCtSeqFT7z0pNjvLC8CBNX1NuW9SgYolK1cDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:14.210387Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0875","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:513fef8699306ebb5d50af3ad8ed8a01ddd53f1433c8b8c5bc0df71a136034e9","sha256:43338aa8a48d49eb2a8c2b22d9e17ccd2ae46fe3d757a376bcce500ac562ba0c"],"state_sha256":"c932aa9943f6ae528dde795bf2150f46cfc0b53dd04011c041932e4b66dc7f04"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M5zTnOe6+DG7cq65RmosxCcHSJ5tSzGg5jNw/4EAKrNS7cmvzV3imghbuJQzmrgp+i74OWcRreebfUvuW+DCBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T12:55:49.299424Z","bundle_sha256":"b23ac1c11b0bee3974f816e2024362b6fd91381e0dbac6563d00df2553dc887c"}}