{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:DJVPHSM3KEUJMTDJJKU4SCBHHF","short_pith_number":"pith:DJVPHSM3","canonical_record":{"source":{"id":"1706.01347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-05T14:26:01Z","cross_cats_sorted":[],"title_canon_sha256":"e1c131d1d9ec633490ba52cddf361dbd8ffae6478cf43d9738c8c0e00e146228","abstract_canon_sha256":"cf2c90a75af07cad0a6340f72241bc6db532298c80586747f7118aecae37cc88"},"schema_version":"1.0"},"canonical_sha256":"1a6af3c99b5128964c694aa9c90827396065a3cd8fda1c4bf08af0d4f71d3445","source":{"kind":"arxiv","id":"1706.01347","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01347","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01347v1","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01347","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"DJVPHSM3KEUJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJVPHSM3KEUJMTDJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJVPHSM3","created_at":"2026-05-18T12:31:10Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:DJVPHSM3KEUJMTDJJKU4SCBHHF","target":"record","payload":{"canonical_record":{"source":{"id":"1706.01347","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-05T14:26:01Z","cross_cats_sorted":[],"title_canon_sha256":"e1c131d1d9ec633490ba52cddf361dbd8ffae6478cf43d9738c8c0e00e146228","abstract_canon_sha256":"cf2c90a75af07cad0a6340f72241bc6db532298c80586747f7118aecae37cc88"},"schema_version":"1.0"},"canonical_sha256":"1a6af3c99b5128964c694aa9c90827396065a3cd8fda1c4bf08af0d4f71d3445","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:43:03.795120Z","signature_b64":"+eS9YMgy3/tZ8FURDoV1dUjDxu9Asq727BPexBlzitVxgShPa2/bFS6j71OAzKU8zJTJs5Q2WKaaDq/p4wKwCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a6af3c99b5128964c694aa9c90827396065a3cd8fda1c4bf08af0d4f71d3445","last_reissued_at":"2026-05-18T00:43:03.794613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:43:03.794613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.01347","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:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bdxtAzYQ1WzwfjfmKjng7v4hITlYLYfsPi/l8VM+9PoySUELpe3DrXu+LMBI9fTJyu5a31jPP16NSOA/ZtUCBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:41.573344Z"},"content_sha256":"b6f20b6bea808eda52fb9eb93af88970c7fb481e29c21b038289733923a8286e","schema_version":"1.0","event_id":"sha256:b6f20b6bea808eda52fb9eb93af88970c7fb481e29c21b038289733923a8286e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:DJVPHSM3KEUJMTDJJKU4SCBHHF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Balanced Facilities on Random Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Nimrod Talmon, Roee David","submitted_at":"2017-06-05T14:26:01Z","abstract_excerpt":"Given a graph G with n vertices and k players, each of which is placing a facility on one of the vertices of G, we define the score of the i'th player to be the number of vertices for which, among all players, the facility placed by the i'th player is the closest. A placement is balanced if all players get roughly the same score. A graph is balanced if all placements on it are balanced. Viewing balancedness as a desired property in various scenarios, in this paper we study balancedness properties of graphs, concentrating on random graphs and on expanders. We show that, while both random graphs"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01347","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:43:03Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hnZANw7I1d+qy7CbZGW1EqX1e1hpEt+vZNX5P3hwJHm0KpBmBJyeK7Lif4P2vsCiAAwTQ6gVARPJGOYHD4IHDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T04:42:41.573763Z"},"content_sha256":"eae400f8991b0e92a4cfaa46df9aa8075fcc91cc14d854ff428e2152b20cbb88","schema_version":"1.0","event_id":"sha256:eae400f8991b0e92a4cfaa46df9aa8075fcc91cc14d854ff428e2152b20cbb88"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DJVPHSM3KEUJMTDJJKU4SCBHHF/bundle.json","state_url":"https://pith.science/pith/DJVPHSM3KEUJMTDJJKU4SCBHHF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DJVPHSM3KEUJMTDJJKU4SCBHHF/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-02T04:42:41Z","links":{"resolver":"https://pith.science/pith/DJVPHSM3KEUJMTDJJKU4SCBHHF","bundle":"https://pith.science/pith/DJVPHSM3KEUJMTDJJKU4SCBHHF/bundle.json","state":"https://pith.science/pith/DJVPHSM3KEUJMTDJJKU4SCBHHF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DJVPHSM3KEUJMTDJJKU4SCBHHF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:DJVPHSM3KEUJMTDJJKU4SCBHHF","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":"cf2c90a75af07cad0a6340f72241bc6db532298c80586747f7118aecae37cc88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-05T14:26:01Z","title_canon_sha256":"e1c131d1d9ec633490ba52cddf361dbd8ffae6478cf43d9738c8c0e00e146228"},"schema_version":"1.0","source":{"id":"1706.01347","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.01347","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"arxiv_version","alias_value":"1706.01347v1","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.01347","created_at":"2026-05-18T00:43:03Z"},{"alias_kind":"pith_short_12","alias_value":"DJVPHSM3KEUJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_16","alias_value":"DJVPHSM3KEUJMTDJ","created_at":"2026-05-18T12:31:10Z"},{"alias_kind":"pith_short_8","alias_value":"DJVPHSM3","created_at":"2026-05-18T12:31:10Z"}],"graph_snapshots":[{"event_id":"sha256:eae400f8991b0e92a4cfaa46df9aa8075fcc91cc14d854ff428e2152b20cbb88","target":"graph","created_at":"2026-05-18T00:43:03Z","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":"Given a graph G with n vertices and k players, each of which is placing a facility on one of the vertices of G, we define the score of the i'th player to be the number of vertices for which, among all players, the facility placed by the i'th player is the closest. A placement is balanced if all players get roughly the same score. A graph is balanced if all placements on it are balanced. Viewing balancedness as a desired property in various scenarios, in this paper we study balancedness properties of graphs, concentrating on random graphs and on expanders. We show that, while both random graphs","authors_text":"Nimrod Talmon, Roee David","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-05T14:26:01Z","title":"Balanced Facilities on Random Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.01347","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:b6f20b6bea808eda52fb9eb93af88970c7fb481e29c21b038289733923a8286e","target":"record","created_at":"2026-05-18T00:43:03Z","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":"cf2c90a75af07cad0a6340f72241bc6db532298c80586747f7118aecae37cc88","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-06-05T14:26:01Z","title_canon_sha256":"e1c131d1d9ec633490ba52cddf361dbd8ffae6478cf43d9738c8c0e00e146228"},"schema_version":"1.0","source":{"id":"1706.01347","kind":"arxiv","version":1}},"canonical_sha256":"1a6af3c99b5128964c694aa9c90827396065a3cd8fda1c4bf08af0d4f71d3445","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1a6af3c99b5128964c694aa9c90827396065a3cd8fda1c4bf08af0d4f71d3445","first_computed_at":"2026-05-18T00:43:03.794613Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:43:03.794613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+eS9YMgy3/tZ8FURDoV1dUjDxu9Asq727BPexBlzitVxgShPa2/bFS6j71OAzKU8zJTJs5Q2WKaaDq/p4wKwCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:43:03.795120Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.01347","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6f20b6bea808eda52fb9eb93af88970c7fb481e29c21b038289733923a8286e","sha256:eae400f8991b0e92a4cfaa46df9aa8075fcc91cc14d854ff428e2152b20cbb88"],"state_sha256":"baa6a9d761e1fa9c7b6c87b0af69195852a5fff4e2454a37b256a9b6e159baf1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzGVP2wGymqUI6DYTOELEOG6MTD7enY3ozRLDWbwXgMHPk4S3ItnJ4Qeo02xI9eI/D5Vk4kdxet8UnPWFUViCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T04:42:41.576245Z","bundle_sha256":"76ad247de28bbd709aeabfe2a6ce6a49bfed2bbb5068530731c55c635c8b8f66"}}