{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:467OPT7OEJP2QHCFVXC7ON54KN","short_pith_number":"pith:467OPT7O","canonical_record":{"source":{"id":"1901.04047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-01-13T19:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"7c8e17a21ca2a3b9db1ce1369da60fc338d7a7435c1850e863dd97f1f16a7115","abstract_canon_sha256":"3e39fc4f6fba821b717a035e9395c5a47966ec91ada8c0e302cc9e28eb58a28a"},"schema_version":"1.0"},"canonical_sha256":"e7bee7cfee225fa81c45adc5f737bc5366aa9ca28865977ba2db10add40b377b","source":{"kind":"arxiv","id":"1901.04047","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04047","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04047v2","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04047","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"pith_short_12","alias_value":"467OPT7OEJP2","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"pith_short_16","alias_value":"467OPT7OEJP2QHCF","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"pith_short_8","alias_value":"467OPT7O","created_at":"2026-07-05T00:45:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:467OPT7OEJP2QHCFVXC7ON54KN","target":"record","payload":{"canonical_record":{"source":{"id":"1901.04047","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-01-13T19:51:33Z","cross_cats_sorted":[],"title_canon_sha256":"7c8e17a21ca2a3b9db1ce1369da60fc338d7a7435c1850e863dd97f1f16a7115","abstract_canon_sha256":"3e39fc4f6fba821b717a035e9395c5a47966ec91ada8c0e302cc9e28eb58a28a"},"schema_version":"1.0"},"canonical_sha256":"e7bee7cfee225fa81c45adc5f737bc5366aa9ca28865977ba2db10add40b377b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:45:32.159235Z","signature_b64":"Q1MfpWVESMWv8VrM9wKtXqBQZcJVYsFwiuUqR9ZwQrdDx6QxK/JMAwVHvRK9I+iQFNLHJ0RiQ2ZVQ0pB0+ZVDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e7bee7cfee225fa81c45adc5f737bc5366aa9ca28865977ba2db10add40b377b","last_reissued_at":"2026-07-05T00:45:32.158850Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:45:32.158850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.04047","source_version":2,"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-05T00:45:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1cMYGFXI+rXctTyUijBoG68pUJ1oo/tx6qpPbGFf2SK8akjtd5SwRzFZCFRjsbmgY+YX8yIBPFjUEnjyNdkxBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:15:48.465148Z"},"content_sha256":"60cf9f4c8f465c16d635d9e982ce18b1f62047adc086dd6b9fef442c62c076ed","schema_version":"1.0","event_id":"sha256:60cf9f4c8f465c16d635d9e982ce18b1f62047adc086dd6b9fef442c62c076ed"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:467OPT7OEJP2QHCFVXC7ON54KN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Blind GB-PANDAS: A Blind Throughput-Optimal Load Balancing Algorithm for Affinity Scheduling","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.PF","authors_text":"Ali Yekkehkhany, Rakesh Nagi","submitted_at":"2019-01-13T19:51:33Z","abstract_excerpt":"Dynamic affinity load balancing of multi-type tasks on multi-skilled servers, when the service rate of each task type on each of the servers is known and can possibly be different from each other, is an open problem for over three decades. The goal is to do task assignment on servers in a real time manner so that the system becomes stable, which means that the queue lengths do not diverge to infinity in steady state (throughput optimality), and the mean task completion time is minimized (delay optimality). The fluid model planning, Max-Weight, and c-$\\mu$-rule algorithms have theoretical guara"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04047","kind":"arxiv","version":2},"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/1901.04047/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-05T00:45:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GOS/ZLQPYKXoA55gNKewfFjTaOEqvnCv1LkMwAGLFW/qZOHSobRh6+JfP4QkXVIVRaQENZ7rHB4ve84SAXDTAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T15:15:48.465650Z"},"content_sha256":"73ff7a334ddf1e966513d08009e9aeffbe14e138654cac5a78411ffb1f2fde24","schema_version":"1.0","event_id":"sha256:73ff7a334ddf1e966513d08009e9aeffbe14e138654cac5a78411ffb1f2fde24"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/467OPT7OEJP2QHCFVXC7ON54KN/bundle.json","state_url":"https://pith.science/pith/467OPT7OEJP2QHCFVXC7ON54KN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/467OPT7OEJP2QHCFVXC7ON54KN/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-08-12T15:15:48Z","links":{"resolver":"https://pith.science/pith/467OPT7OEJP2QHCFVXC7ON54KN","bundle":"https://pith.science/pith/467OPT7OEJP2QHCFVXC7ON54KN/bundle.json","state":"https://pith.science/pith/467OPT7OEJP2QHCFVXC7ON54KN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/467OPT7OEJP2QHCFVXC7ON54KN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:467OPT7OEJP2QHCFVXC7ON54KN","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":"3e39fc4f6fba821b717a035e9395c5a47966ec91ada8c0e302cc9e28eb58a28a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-01-13T19:51:33Z","title_canon_sha256":"7c8e17a21ca2a3b9db1ce1369da60fc338d7a7435c1850e863dd97f1f16a7115"},"schema_version":"1.0","source":{"id":"1901.04047","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.04047","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"arxiv_version","alias_value":"1901.04047v2","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.04047","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"pith_short_12","alias_value":"467OPT7OEJP2","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"pith_short_16","alias_value":"467OPT7OEJP2QHCF","created_at":"2026-07-05T00:45:32Z"},{"alias_kind":"pith_short_8","alias_value":"467OPT7O","created_at":"2026-07-05T00:45:32Z"}],"graph_snapshots":[{"event_id":"sha256:73ff7a334ddf1e966513d08009e9aeffbe14e138654cac5a78411ffb1f2fde24","target":"graph","created_at":"2026-07-05T00:45:32Z","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/1901.04047/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Dynamic affinity load balancing of multi-type tasks on multi-skilled servers, when the service rate of each task type on each of the servers is known and can possibly be different from each other, is an open problem for over three decades. The goal is to do task assignment on servers in a real time manner so that the system becomes stable, which means that the queue lengths do not diverge to infinity in steady state (throughput optimality), and the mean task completion time is minimized (delay optimality). The fluid model planning, Max-Weight, and c-$\\mu$-rule algorithms have theoretical guara","authors_text":"Ali Yekkehkhany, Rakesh Nagi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-01-13T19:51:33Z","title":"Blind GB-PANDAS: A Blind Throughput-Optimal Load Balancing Algorithm for Affinity Scheduling"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.04047","kind":"arxiv","version":2},"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:60cf9f4c8f465c16d635d9e982ce18b1f62047adc086dd6b9fef442c62c076ed","target":"record","created_at":"2026-07-05T00:45:32Z","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":"3e39fc4f6fba821b717a035e9395c5a47966ec91ada8c0e302cc9e28eb58a28a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.PF","submitted_at":"2019-01-13T19:51:33Z","title_canon_sha256":"7c8e17a21ca2a3b9db1ce1369da60fc338d7a7435c1850e863dd97f1f16a7115"},"schema_version":"1.0","source":{"id":"1901.04047","kind":"arxiv","version":2}},"canonical_sha256":"e7bee7cfee225fa81c45adc5f737bc5366aa9ca28865977ba2db10add40b377b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e7bee7cfee225fa81c45adc5f737bc5366aa9ca28865977ba2db10add40b377b","first_computed_at":"2026-07-05T00:45:32.158850Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T00:45:32.158850Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Q1MfpWVESMWv8VrM9wKtXqBQZcJVYsFwiuUqR9ZwQrdDx6QxK/JMAwVHvRK9I+iQFNLHJ0RiQ2ZVQ0pB0+ZVDQ==","signature_status":"signed_v1","signed_at":"2026-07-05T00:45:32.159235Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.04047","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:60cf9f4c8f465c16d635d9e982ce18b1f62047adc086dd6b9fef442c62c076ed","sha256:73ff7a334ddf1e966513d08009e9aeffbe14e138654cac5a78411ffb1f2fde24"],"state_sha256":"e4a8f9df726f34f1ae0b9bb3e37bbb37e61baa262750cfb42355ca4daa1ff275"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Kge2fzPEVomasTzfEFmrmrgbnagpCrD859+pxbr0ySGqeZpi27+p660EKgWYo37qTZhY+e59hWw+XHvP5QyyDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T15:15:48.470707Z","bundle_sha256":"0b86299be8995bbe915ac2fa4484591ddc24b124dda067415b0354f43c564143"}}