{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:2TSZ3FSEOJ2VPWAEUUBXLZKMSG","short_pith_number":"pith:2TSZ3FSE","schema_version":"1.0","canonical_sha256":"d4e59d9644727557d804a50375e54c91b4f6dcd6245285ecee5c213c2fe56d90","source":{"kind":"arxiv","id":"1406.2107","version":1},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1406.2107","created_at":"2026-05-18T02:50:11.580892+00:00"},{"alias_kind":"arxiv_version","alias_value":"1406.2107v1","created_at":"2026-05-18T02:50:11.580892+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1406.2107","created_at":"2026-05-18T02:50:11.580892+00:00"},{"alias_kind":"pith_short_12","alias_value":"2TSZ3FSEOJ2V","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_16","alias_value":"2TSZ3FSEOJ2VPWAE","created_at":"2026-05-18T12:28:11.866339+00:00"},{"alias_kind":"pith_short_8","alias_value":"2TSZ3FSE","created_at":"2026-05-18T12:28:11.866339+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG","json":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG.json","graph_json":"https://pith.science/api/pith-number/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/graph.json","events_json":"https://pith.science/api/pith-number/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/events.json","paper":"https://pith.science/paper/2TSZ3FSE"},"agent_actions":{"view_html":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG","download_json":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG.json","view_paper":"https://pith.science/paper/2TSZ3FSE","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1406.2107&json=true","fetch_graph":"https://pith.science/api/pith-number/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/graph.json","fetch_events":"https://pith.science/api/pith-number/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/action/storage_attestation","attest_author":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/action/author_attestation","sign_citation":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/action/citation_signature","submit_replication":"https://pith.science/pith/2TSZ3FSEOJ2VPWAEUUBXLZKMSG/action/replication_record"}},"created_at":"2026-05-18T02:50:11.580892+00:00","updated_at":"2026-05-18T02:50:11.580892+00:00"}