{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:SB6K3RQDOS36DR6CTQTQMOHXU7","short_pith_number":"pith:SB6K3RQD","canonical_record":{"source":{"id":"1212.0421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-03T15:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"73246cd269fdaa344ca4244d22d402c2206139ea03b4e6fe78d7d40a0192aa59","abstract_canon_sha256":"1d425e8a2c30fc7299667fd7ed7f94482c5fabefa6845b6c8202aaa2b509e8a6"},"schema_version":"1.0"},"canonical_sha256":"907cadc60374b7e1c7c29c270638f7a7c57b19c4f16a371cb07eaa436038578c","source":{"kind":"arxiv","id":"1212.0421","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0421","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0421v1","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0421","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"SB6K3RQDOS36","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SB6K3RQDOS36DR6C","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SB6K3RQD","created_at":"2026-05-18T12:27:20Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:SB6K3RQDOS36DR6CTQTQMOHXU7","target":"record","payload":{"canonical_record":{"source":{"id":"1212.0421","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-03T15:52:18Z","cross_cats_sorted":[],"title_canon_sha256":"73246cd269fdaa344ca4244d22d402c2206139ea03b4e6fe78d7d40a0192aa59","abstract_canon_sha256":"1d425e8a2c30fc7299667fd7ed7f94482c5fabefa6845b6c8202aaa2b509e8a6"},"schema_version":"1.0"},"canonical_sha256":"907cadc60374b7e1c7c29c270638f7a7c57b19c4f16a371cb07eaa436038578c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:39:17.568984Z","signature_b64":"jM6bkojxVhyAniHADVKTxWQjhxko2Ityy0DTDC9tzkF4poRgafszjULYb88cgW/gjYs36VduPkwjiaBJO7teCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"907cadc60374b7e1c7c29c270638f7a7c57b19c4f16a371cb07eaa436038578c","last_reissued_at":"2026-05-18T03:39:17.568321Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:39:17.568321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.0421","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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K+ceAX6sPX5+pP3jWUPrJIHd2P2ICLN5qEc6qtt2vljSFWAl2zlQltkj7Tis8o5+vLVXxktC/VMdoH8BecT0BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:05:45.901669Z"},"content_sha256":"6cc0bd6c7117c06d77424eac61c49b9a349dece605430855b171477d0cd918f6","schema_version":"1.0","event_id":"sha256:6cc0bd6c7117c06d77424eac61c49b9a349dece605430855b171477d0cd918f6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:SB6K3RQDOS36DR6CTQTQMOHXU7","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Network delay-aware load balancing in selfish and cooperative distributed systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DC","authors_text":"Krzysztof Rzadca, Piotr Skowron","submitted_at":"2012-12-03T15:52:18Z","abstract_excerpt":"We consider a request processing system composed of organizations and their servers connected by the Internet.\n  The latency a user observes is a sum of communication delays and the time needed to handle the request on a server. The handling time depends on the server congestion, i.e. the total number of requests a server must handle. We analyze the problem of balancing the load in a network of servers in order to minimize the total observed latency. We consider both cooperative and selfish organizations (each organization aiming to minimize the latency of the locally-produced requests). The p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0421","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:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"g6YcLxwDGznrddRtVVINKSi7hEAwaYhqVYrKVXw6TpppS6LbmGZfUwHZiIQEYeYEkC1I193MCztBAWb7ub/uDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T02:05:45.902007Z"},"content_sha256":"cb2b255e617ad6e30634a5ece2c2b2d34ee8e88094c32c88c6cdf6b84bab9b2d","schema_version":"1.0","event_id":"sha256:cb2b255e617ad6e30634a5ece2c2b2d34ee8e88094c32c88c6cdf6b84bab9b2d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SB6K3RQDOS36DR6CTQTQMOHXU7/bundle.json","state_url":"https://pith.science/pith/SB6K3RQDOS36DR6CTQTQMOHXU7/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SB6K3RQDOS36DR6CTQTQMOHXU7/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-02T02:05:45Z","links":{"resolver":"https://pith.science/pith/SB6K3RQDOS36DR6CTQTQMOHXU7","bundle":"https://pith.science/pith/SB6K3RQDOS36DR6CTQTQMOHXU7/bundle.json","state":"https://pith.science/pith/SB6K3RQDOS36DR6CTQTQMOHXU7/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SB6K3RQDOS36DR6CTQTQMOHXU7/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:SB6K3RQDOS36DR6CTQTQMOHXU7","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":"1d425e8a2c30fc7299667fd7ed7f94482c5fabefa6845b6c8202aaa2b509e8a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-03T15:52:18Z","title_canon_sha256":"73246cd269fdaa344ca4244d22d402c2206139ea03b4e6fe78d7d40a0192aa59"},"schema_version":"1.0","source":{"id":"1212.0421","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.0421","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"arxiv_version","alias_value":"1212.0421v1","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.0421","created_at":"2026-05-18T03:39:17Z"},{"alias_kind":"pith_short_12","alias_value":"SB6K3RQDOS36","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_16","alias_value":"SB6K3RQDOS36DR6C","created_at":"2026-05-18T12:27:20Z"},{"alias_kind":"pith_short_8","alias_value":"SB6K3RQD","created_at":"2026-05-18T12:27:20Z"}],"graph_snapshots":[{"event_id":"sha256:cb2b255e617ad6e30634a5ece2c2b2d34ee8e88094c32c88c6cdf6b84bab9b2d","target":"graph","created_at":"2026-05-18T03:39:17Z","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 request processing system composed of organizations and their servers connected by the Internet.\n  The latency a user observes is a sum of communication delays and the time needed to handle the request on a server. The handling time depends on the server congestion, i.e. the total number of requests a server must handle. We analyze the problem of balancing the load in a network of servers in order to minimize the total observed latency. We consider both cooperative and selfish organizations (each organization aiming to minimize the latency of the locally-produced requests). The p","authors_text":"Krzysztof Rzadca, Piotr Skowron","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-03T15:52:18Z","title":"Network delay-aware load balancing in selfish and cooperative distributed systems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.0421","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:6cc0bd6c7117c06d77424eac61c49b9a349dece605430855b171477d0cd918f6","target":"record","created_at":"2026-05-18T03:39:17Z","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":"1d425e8a2c30fc7299667fd7ed7f94482c5fabefa6845b6c8202aaa2b509e8a6","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2012-12-03T15:52:18Z","title_canon_sha256":"73246cd269fdaa344ca4244d22d402c2206139ea03b4e6fe78d7d40a0192aa59"},"schema_version":"1.0","source":{"id":"1212.0421","kind":"arxiv","version":1}},"canonical_sha256":"907cadc60374b7e1c7c29c270638f7a7c57b19c4f16a371cb07eaa436038578c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"907cadc60374b7e1c7c29c270638f7a7c57b19c4f16a371cb07eaa436038578c","first_computed_at":"2026-05-18T03:39:17.568321Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:39:17.568321Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jM6bkojxVhyAniHADVKTxWQjhxko2Ityy0DTDC9tzkF4poRgafszjULYb88cgW/gjYs36VduPkwjiaBJO7teCg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:39:17.568984Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.0421","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6cc0bd6c7117c06d77424eac61c49b9a349dece605430855b171477d0cd918f6","sha256:cb2b255e617ad6e30634a5ece2c2b2d34ee8e88094c32c88c6cdf6b84bab9b2d"],"state_sha256":"f9dfbfb1d134c68eea40d106a57c33c3303ed90a7e44749575c898fa7a303e81"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1fDb7hiW5RFMdSkkxU+O5VbcsacUA1gTMG+Dp43RANrt4WdCSuskI/44+jhhYFQqfA1QeHHanLCl442101RkCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T02:05:45.903872Z","bundle_sha256":"fb99458d6b2dd5ee9edd1b3ff94754c16992c2c7f92d9c9b05b06086eed834a9"}}