{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:2TSZ3FSEOJ2VPWAEUUBXLZKMSG","short_pith_number":"pith:2TSZ3FSE","canonical_record":{"source":{"id":"1406.2107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-09T08:35:32Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"22009bd3abe17d579e6b33b0a9f7e524028542cffb969ddb4f1468e4bf6c12ca","abstract_canon_sha256":"b950d47cdc9598d35337695342e869c781886a930484339876e650e3631c0e15"},"schema_version":"1.0"},"canonical_sha256":"d4e59d9644727557d804a50375e54c91b4f6dcd6245285ecee5c213c2fe56d90","source":{"kind":"arxiv","id":"1406.2107","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2107","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2107v1","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2107","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"2TSZ3FSEOJ2V","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2TSZ3FSEOJ2VPWAE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2TSZ3FSE","created_at":"2026-05-18T12:28:11Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:2TSZ3FSEOJ2VPWAEUUBXLZKMSG","target":"record","payload":{"canonical_record":{"source":{"id":"1406.2107","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-09T08:35:32Z","cross_cats_sorted":["cs.CG"],"title_canon_sha256":"22009bd3abe17d579e6b33b0a9f7e524028542cffb969ddb4f1468e4bf6c12ca","abstract_canon_sha256":"b950d47cdc9598d35337695342e869c781886a930484339876e650e3631c0e15"},"schema_version":"1.0"},"canonical_sha256":"d4e59d9644727557d804a50375e54c91b4f6dcd6245285ecee5c213c2fe56d90","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:11.581415Z","signature_b64":"6pSQxFBz7hOFBIRA56cHv2WO2RjJmkPyulOevq3jinK1Wh0QW+IWose91vez9jRvmVhgHHmBBlXMiwYOpkBnBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4e59d9644727557d804a50375e54c91b4f6dcd6245285ecee5c213c2fe56d90","last_reissued_at":"2026-05-18T02:50:11.580798Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:11.580798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1406.2107","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-18T02:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vIQRLHiSlVyS7QOSvYb3TAPfmo4ae1go6RIqy/rEew8r7P22S2pFeQNuXBigJDrQQjn8oVrEAiJBiR3LiaqwCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:49.271746Z"},"content_sha256":"e09dc1eb1161517e870ec3215a1d3c3e669a049920054b085961593edf4b70ef","schema_version":"1.0","event_id":"sha256:e09dc1eb1161517e870ec3215a1d3c3e669a049920054b085961593edf4b70ef"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:2TSZ3FSEOJ2VPWAEUUBXLZKMSG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing Budget Allocation in Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CG"],"primary_cat":"cs.DS","authors_text":"Boaz Ben-Moshe, Eran Omri, Lee-Ad Gottlieb, Michael Elkin","submitted_at":"2014-06-09T08:35:32Z","abstract_excerpt":"In the classical facility location problem we consider a graph $G$ with fixed weights on the edges of $G$. The goal is then to find an optimal positioning for a set of facilities on the graph with respect to some objective function. We introduce a new framework for facility location problems, where the weights on the graph edges are not fixed, but rather should be assigned. The goal is to find a valid assignment for which the resulting weighted graph optimizes the facility location objective function. We present algorithms for finding the optimal {\\em budget allocation} for the center point pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2107","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-18T02:50:11Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"p2sqTv+d3AEukBsBt8HHbTF9IODdkN4eGPX7suPejynI6BjXQhT8nAy24jNbWoNOv/npt9a7IXVKk8VuKFptBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T15:47:49.272106Z"},"content_sha256":"2e0563052f3b8b4cece8854c639b66283c92a4caa3971565f7b68c86429537c4","schema_version":"1.0","event_id":"sha256:2e0563052f3b8b4cece8854c639b66283c92a4caa3971565f7b68c86429537c4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/bundle.json","state_url":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/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-05-27T15:47:49Z","links":{"resolver":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG","bundle":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/bundle.json","state":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:2TSZ3FSEOJ2VPWAEUUBXLZKMSG","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":"b950d47cdc9598d35337695342e869c781886a930484339876e650e3631c0e15","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-09T08:35:32Z","title_canon_sha256":"22009bd3abe17d579e6b33b0a9f7e524028542cffb969ddb4f1468e4bf6c12ca"},"schema_version":"1.0","source":{"id":"1406.2107","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1406.2107","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"arxiv_version","alias_value":"1406.2107v1","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2107","created_at":"2026-05-18T02:50:11Z"},{"alias_kind":"pith_short_12","alias_value":"2TSZ3FSEOJ2V","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_16","alias_value":"2TSZ3FSEOJ2VPWAE","created_at":"2026-05-18T12:28:11Z"},{"alias_kind":"pith_short_8","alias_value":"2TSZ3FSE","created_at":"2026-05-18T12:28:11Z"}],"graph_snapshots":[{"event_id":"sha256:2e0563052f3b8b4cece8854c639b66283c92a4caa3971565f7b68c86429537c4","target":"graph","created_at":"2026-05-18T02:50: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":"In the classical facility location problem we consider a graph $G$ with fixed weights on the edges of $G$. The goal is then to find an optimal positioning for a set of facilities on the graph with respect to some objective function. We introduce a new framework for facility location problems, where the weights on the graph edges are not fixed, but rather should be assigned. The goal is to find a valid assignment for which the resulting weighted graph optimizes the facility location objective function. We present algorithms for finding the optimal {\\em budget allocation} for the center point pr","authors_text":"Boaz Ben-Moshe, Eran Omri, Lee-Ad Gottlieb, Michael Elkin","cross_cats":["cs.CG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-09T08:35:32Z","title":"Optimizing Budget Allocation in Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1406.2107","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:e09dc1eb1161517e870ec3215a1d3c3e669a049920054b085961593edf4b70ef","target":"record","created_at":"2026-05-18T02:50: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":"b950d47cdc9598d35337695342e869c781886a930484339876e650e3631c0e15","cross_cats_sorted":["cs.CG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-06-09T08:35:32Z","title_canon_sha256":"22009bd3abe17d579e6b33b0a9f7e524028542cffb969ddb4f1468e4bf6c12ca"},"schema_version":"1.0","source":{"id":"1406.2107","kind":"arxiv","version":1}},"canonical_sha256":"d4e59d9644727557d804a50375e54c91b4f6dcd6245285ecee5c213c2fe56d90","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d4e59d9644727557d804a50375e54c91b4f6dcd6245285ecee5c213c2fe56d90","first_computed_at":"2026-05-18T02:50:11.580798Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:11.580798Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"6pSQxFBz7hOFBIRA56cHv2WO2RjJmkPyulOevq3jinK1Wh0QW+IWose91vez9jRvmVhgHHmBBlXMiwYOpkBnBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:11.581415Z","signed_message":"canonical_sha256_bytes"},"source_id":"1406.2107","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e09dc1eb1161517e870ec3215a1d3c3e669a049920054b085961593edf4b70ef","sha256:2e0563052f3b8b4cece8854c639b66283c92a4caa3971565f7b68c86429537c4"],"state_sha256":"8b478983c1ebbdcb5ee7ff8ed122366e4e8d2a78c97220929e4db81ec218b885"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dv+AYgVCMe6axEFnrHJgmapoYNXOFfMebh4bZgQ++jJtmVqOZpNRO8rVr5+rUyY1yR78uOFZ9m6aFZ6f+8eWAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T15:47:49.274244Z","bundle_sha256":"e7015145b9f8d96dfb5c60721837606d5401941b304f122c8e05dfdfaf9f1925"}}