{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:4GWAUZ2F44F2D6CSSVZUTRV6ZD","short_pith_number":"pith:4GWAUZ2F","canonical_record":{"source":{"id":"1507.01101","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-04T12:29:20Z","cross_cats_sorted":[],"title_canon_sha256":"0639fb86c96bd426e8876057f466741a62c7bb35da0ccce04e36c48ecd0be888","abstract_canon_sha256":"4ddb90a4050ebb281148af9f86a038a045039a16c6666f3aa5e8e49de47b7163"},"schema_version":"1.0"},"canonical_sha256":"e1ac0a6745e70ba1f852957349c6bec8fe2342b14b563e7024948484b94d291d","source":{"kind":"arxiv","id":"1507.01101","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01101","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01101v4","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01101","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"4GWAUZ2F44F2","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"pith_short_16","alias_value":"4GWAUZ2F44F2D6CS","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"pith_short_8","alias_value":"4GWAUZ2F","created_at":"2026-07-05T02:47:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:4GWAUZ2F44F2D6CSSVZUTRV6ZD","target":"record","payload":{"canonical_record":{"source":{"id":"1507.01101","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-04T12:29:20Z","cross_cats_sorted":[],"title_canon_sha256":"0639fb86c96bd426e8876057f466741a62c7bb35da0ccce04e36c48ecd0be888","abstract_canon_sha256":"4ddb90a4050ebb281148af9f86a038a045039a16c6666f3aa5e8e49de47b7163"},"schema_version":"1.0"},"canonical_sha256":"e1ac0a6745e70ba1f852957349c6bec8fe2342b14b563e7024948484b94d291d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:47:37.028797Z","signature_b64":"1g/hh76YklaKIsg4PgPOUuJ+MVwS51BikBWDvnZg1yCduxyU5rVluWAmFoq0WHHidU9Pgmjx/Lnu+/2nlxibAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e1ac0a6745e70ba1f852957349c6bec8fe2342b14b563e7024948484b94d291d","last_reissued_at":"2026-07-05T02:47:37.028144Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:47:37.028144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1507.01101","source_version":4,"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-07-05T02:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D9zqsJchhAZ3qxz0jYCcH4MCD5xT4m7nH1H+9vBhXDcg3LrFruYudKCYC7PFAZiBM0OBexZ2+aJYWqZVwnJVDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:22:54.243419Z"},"content_sha256":"8acbf186f242a99ac569126b27db88314b7e8dc89feaf82897e1c496996df333","schema_version":"1.0","event_id":"sha256:8acbf186f242a99ac569126b27db88314b7e8dc89feaf82897e1c496996df333"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:4GWAUZ2F44F2D6CSSVZUTRV6ZD","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Utility Optimal Thread Assignment and Resource Allocation in Multi-Server Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Fang Liu, Joey Tianyi Zhou, Pan Lai, Rui Fan, Wei Zhang, Xiao Zhang","submitted_at":"2015-07-04T12:29:20Z","abstract_excerpt":"Achieving high performance in many multi-server systems requires finding a good assignment of worker threads to servers and also effectively allocating each server's resources to its assigned threads. The assignment and allocation components of this problem have been studied extensively but largely separately in the literature. In this paper, we introduce the assign and allocate (AA) problem, which seeks to simultaneously find an assignment and allocation that maximizes the total utility of the threads. Assigning and allocating the threads together can result in substantially better overall ut"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01101","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1507.01101/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T02:47:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qhO55oHnqg13QEgks4P8+T3P6z9eFng5wrOpk+MjZx9SUDNRza5q2z/AgkCmiCyF6ubvHgSf/2IwmOWpiG06BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-07T13:22:54.243828Z"},"content_sha256":"e25e2f76ecd1ed8c7e3f8f6cdd2af283b5e809c75d3db8f44187f4387673f401","schema_version":"1.0","event_id":"sha256:e25e2f76ecd1ed8c7e3f8f6cdd2af283b5e809c75d3db8f44187f4387673f401"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4GWAUZ2F44F2D6CSSVZUTRV6ZD/bundle.json","state_url":"https://pith.science/pith/4GWAUZ2F44F2D6CSSVZUTRV6ZD/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4GWAUZ2F44F2D6CSSVZUTRV6ZD/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-07-07T13:22:54Z","links":{"resolver":"https://pith.science/pith/4GWAUZ2F44F2D6CSSVZUTRV6ZD","bundle":"https://pith.science/pith/4GWAUZ2F44F2D6CSSVZUTRV6ZD/bundle.json","state":"https://pith.science/pith/4GWAUZ2F44F2D6CSSVZUTRV6ZD/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4GWAUZ2F44F2D6CSSVZUTRV6ZD/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:4GWAUZ2F44F2D6CSSVZUTRV6ZD","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":"4ddb90a4050ebb281148af9f86a038a045039a16c6666f3aa5e8e49de47b7163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-04T12:29:20Z","title_canon_sha256":"0639fb86c96bd426e8876057f466741a62c7bb35da0ccce04e36c48ecd0be888"},"schema_version":"1.0","source":{"id":"1507.01101","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1507.01101","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"arxiv_version","alias_value":"1507.01101v4","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1507.01101","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"pith_short_12","alias_value":"4GWAUZ2F44F2","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"pith_short_16","alias_value":"4GWAUZ2F44F2D6CS","created_at":"2026-07-05T02:47:37Z"},{"alias_kind":"pith_short_8","alias_value":"4GWAUZ2F","created_at":"2026-07-05T02:47:37Z"}],"graph_snapshots":[{"event_id":"sha256:e25e2f76ecd1ed8c7e3f8f6cdd2af283b5e809c75d3db8f44187f4387673f401","target":"graph","created_at":"2026-07-05T02:47:37Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/1507.01101/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Achieving high performance in many multi-server systems requires finding a good assignment of worker threads to servers and also effectively allocating each server's resources to its assigned threads. The assignment and allocation components of this problem have been studied extensively but largely separately in the literature. In this paper, we introduce the assign and allocate (AA) problem, which seeks to simultaneously find an assignment and allocation that maximizes the total utility of the threads. Assigning and allocating the threads together can result in substantially better overall ut","authors_text":"Fang Liu, Joey Tianyi Zhou, Pan Lai, Rui Fan, Wei Zhang, Xiao Zhang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-04T12:29:20Z","title":"Utility Optimal Thread Assignment and Resource Allocation in Multi-Server Systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1507.01101","kind":"arxiv","version":4},"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:8acbf186f242a99ac569126b27db88314b7e8dc89feaf82897e1c496996df333","target":"record","created_at":"2026-07-05T02:47:37Z","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":"4ddb90a4050ebb281148af9f86a038a045039a16c6666f3aa5e8e49de47b7163","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2015-07-04T12:29:20Z","title_canon_sha256":"0639fb86c96bd426e8876057f466741a62c7bb35da0ccce04e36c48ecd0be888"},"schema_version":"1.0","source":{"id":"1507.01101","kind":"arxiv","version":4}},"canonical_sha256":"e1ac0a6745e70ba1f852957349c6bec8fe2342b14b563e7024948484b94d291d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e1ac0a6745e70ba1f852957349c6bec8fe2342b14b563e7024948484b94d291d","first_computed_at":"2026-07-05T02:47:37.028144Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:47:37.028144Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1g/hh76YklaKIsg4PgPOUuJ+MVwS51BikBWDvnZg1yCduxyU5rVluWAmFoq0WHHidU9Pgmjx/Lnu+/2nlxibAw==","signature_status":"signed_v1","signed_at":"2026-07-05T02:47:37.028797Z","signed_message":"canonical_sha256_bytes"},"source_id":"1507.01101","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8acbf186f242a99ac569126b27db88314b7e8dc89feaf82897e1c496996df333","sha256:e25e2f76ecd1ed8c7e3f8f6cdd2af283b5e809c75d3db8f44187f4387673f401"],"state_sha256":"f7040bfa62e3be65b5acb26324edbd76e1a6f4fb1629ee1ee98aac893e20a811"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"9xJeQnGl+8Z/C/YEDWl7yTQWxwAmgpLG+FAru4gJ8eAN2vp55vlRtvOaq6SvhtEUiuUczg3nfjS/yyD6kk/vBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-07T13:22:54.245937Z","bundle_sha256":"674df8f971149475808448f622359e11bbaa7b69ec709138b08706c0f0cffe94"}}