{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:GLUHWCSV4U6UQVMXERL6EGFCFY","short_pith_number":"pith:GLUHWCSV","canonical_record":{"source":{"id":"1706.09997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-30T01:42:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e3fd58e4bc698c6bd98ad150e8b5e80a04c298e5221ceef83dac9f6338832528","abstract_canon_sha256":"153f8a41dbf05b4fdaa4ab46e614b323af3771569020849e5d5f4375d23dc4a0"},"schema_version":"1.0"},"canonical_sha256":"32e87b0a55e53d4855972457e218a22e0334728a88e6f0141fd8eb3875a8f4a8","source":{"kind":"arxiv","id":"1706.09997","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09997","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09997v1","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09997","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"GLUHWCSV4U6U","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLUHWCSV4U6UQVMX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLUHWCSV","created_at":"2026-05-18T12:31:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:GLUHWCSV4U6UQVMXERL6EGFCFY","target":"record","payload":{"canonical_record":{"source":{"id":"1706.09997","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-30T01:42:53Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"e3fd58e4bc698c6bd98ad150e8b5e80a04c298e5221ceef83dac9f6338832528","abstract_canon_sha256":"153f8a41dbf05b4fdaa4ab46e614b323af3771569020849e5d5f4375d23dc4a0"},"schema_version":"1.0"},"canonical_sha256":"32e87b0a55e53d4855972457e218a22e0334728a88e6f0141fd8eb3875a8f4a8","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:11.723475Z","signature_b64":"K5saz4OIZ5X6pv5/dG52XGE8x7HxHlpWtKHs9dkKaJRiZCE3KpRfFSqE8azXvT5DgH/i5GJgrtD8VWHOkTe6Dg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"32e87b0a55e53d4855972457e218a22e0334728a88e6f0141fd8eb3875a8f4a8","last_reissued_at":"2026-05-18T00:41:11.722998Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:11.722998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.09997","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-18T00:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fdQLNrH0bGRyhFk/ieI/55bf51/PN/ijW05dOcUbNh8UzNw1aUBuyIpuMNpPGp1xmqixIANMuSlRTyhGMYe7CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:29:19.822772Z"},"content_sha256":"5265614ef7364ee9e3100fab57d81dfb2ed8043dec75c69244cd8d4594b4142f","schema_version":"1.0","event_id":"sha256:5265614ef7364ee9e3100fab57d81dfb2ed8043dec75c69244cd8d4594b4142f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:GLUHWCSV4U6UQVMXERL6EGFCFY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Load Balancing via Randomized Local Search","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DC","authors_text":"Abbas Mehrabian, Christopher Liaw, Peter Kling, Petra Berenbrink","submitted_at":"2017-06-30T01:42:53Z","abstract_excerpt":"We consider the following balls-into-bins process with $n$ bins and $m$ balls: each ball is equipped with a mutually independent exponential clock of rate 1. Whenever a ball's clock rings, the ball samples a random bin and moves there if the number of balls in the sampled bin is smaller than in its current bin. This simple process models a typical load balancing problem where users (balls) seek a selfish improvement of their assignment to resources (bins). From a game theoretic perspective, this is a randomized approach to the well-known Koutsoupias-Papadimitriou model, while it is known as ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09997","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-18T00:41:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iug7WjFp7u2IH2IoR5ZRY7QiU22fO4C3mB6AA4WwnVHM5X0LL1mTM4jj1JE+VGOyKxwDVsNoPghpUl7ZZeONBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T02:29:19.823474Z"},"content_sha256":"269d14ec8198331203322ae6cbac8ee794a905b52864a74dcded71b6bcc9339e","schema_version":"1.0","event_id":"sha256:269d14ec8198331203322ae6cbac8ee794a905b52864a74dcded71b6bcc9339e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GLUHWCSV4U6UQVMXERL6EGFCFY/bundle.json","state_url":"https://pith.science/pith/GLUHWCSV4U6UQVMXERL6EGFCFY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GLUHWCSV4U6UQVMXERL6EGFCFY/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-08T02:29:19Z","links":{"resolver":"https://pith.science/pith/GLUHWCSV4U6UQVMXERL6EGFCFY","bundle":"https://pith.science/pith/GLUHWCSV4U6UQVMXERL6EGFCFY/bundle.json","state":"https://pith.science/pith/GLUHWCSV4U6UQVMXERL6EGFCFY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GLUHWCSV4U6UQVMXERL6EGFCFY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:GLUHWCSV4U6UQVMXERL6EGFCFY","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":"153f8a41dbf05b4fdaa4ab46e614b323af3771569020849e5d5f4375d23dc4a0","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-30T01:42:53Z","title_canon_sha256":"e3fd58e4bc698c6bd98ad150e8b5e80a04c298e5221ceef83dac9f6338832528"},"schema_version":"1.0","source":{"id":"1706.09997","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.09997","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"arxiv_version","alias_value":"1706.09997v1","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.09997","created_at":"2026-05-18T00:41:11Z"},{"alias_kind":"pith_short_12","alias_value":"GLUHWCSV4U6U","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_16","alias_value":"GLUHWCSV4U6UQVMX","created_at":"2026-05-18T12:31:18Z"},{"alias_kind":"pith_short_8","alias_value":"GLUHWCSV","created_at":"2026-05-18T12:31:18Z"}],"graph_snapshots":[{"event_id":"sha256:269d14ec8198331203322ae6cbac8ee794a905b52864a74dcded71b6bcc9339e","target":"graph","created_at":"2026-05-18T00:41:11Z","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 the following balls-into-bins process with $n$ bins and $m$ balls: each ball is equipped with a mutually independent exponential clock of rate 1. Whenever a ball's clock rings, the ball samples a random bin and moves there if the number of balls in the sampled bin is smaller than in its current bin. This simple process models a typical load balancing problem where users (balls) seek a selfish improvement of their assignment to resources (bins). From a game theoretic perspective, this is a randomized approach to the well-known Koutsoupias-Papadimitriou model, while it is known as ra","authors_text":"Abbas Mehrabian, Christopher Liaw, Peter Kling, Petra Berenbrink","cross_cats":["math.PR"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-30T01:42:53Z","title":"Tight Load Balancing via Randomized Local Search"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.09997","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:5265614ef7364ee9e3100fab57d81dfb2ed8043dec75c69244cd8d4594b4142f","target":"record","created_at":"2026-05-18T00:41:11Z","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":"153f8a41dbf05b4fdaa4ab46e614b323af3771569020849e5d5f4375d23dc4a0","cross_cats_sorted":["math.PR"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DC","submitted_at":"2017-06-30T01:42:53Z","title_canon_sha256":"e3fd58e4bc698c6bd98ad150e8b5e80a04c298e5221ceef83dac9f6338832528"},"schema_version":"1.0","source":{"id":"1706.09997","kind":"arxiv","version":1}},"canonical_sha256":"32e87b0a55e53d4855972457e218a22e0334728a88e6f0141fd8eb3875a8f4a8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"32e87b0a55e53d4855972457e218a22e0334728a88e6f0141fd8eb3875a8f4a8","first_computed_at":"2026-05-18T00:41:11.722998Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:11.722998Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"K5saz4OIZ5X6pv5/dG52XGE8x7HxHlpWtKHs9dkKaJRiZCE3KpRfFSqE8azXvT5DgH/i5GJgrtD8VWHOkTe6Dg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:11.723475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.09997","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:5265614ef7364ee9e3100fab57d81dfb2ed8043dec75c69244cd8d4594b4142f","sha256:269d14ec8198331203322ae6cbac8ee794a905b52864a74dcded71b6bcc9339e"],"state_sha256":"6c7fe3499c24e5e937137c785108f0aa67340f80964a814263b7c71c0df19606"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z2q6pag/rM8Ar4yFqTqDH2Tny4jIciyKj679v1KKcRpCR3XgE9PkiyZxG/DtFgkvZeQMR83+A0T4zyYhoegQDA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T02:29:19.827269Z","bundle_sha256":"eec77d6e4dee7a7036bdc309d2bcc42d70e12ab78927037829ef19e396184343"}}