{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:JIRM4VWKASAIXZRFZUOYJZBRVH","short_pith_number":"pith:JIRM4VWK","canonical_record":{"source":{"id":"1802.05252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T18:21:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"778a4abb53e75044825072c1d058a57f0ad592c399aad91c5958b85f5cb1cd6e","abstract_canon_sha256":"ea08f564d9e72981752556d3bdec56a6e6781facdbbea0b8a874de37b353cb3c"},"schema_version":"1.0"},"canonical_sha256":"4a22ce56ca04808be625cd1d84e431a9e29beca0e56d1f42423c50a98de36a00","source":{"kind":"arxiv","id":"1802.05252","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05252","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05252v1","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05252","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"JIRM4VWKASAI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JIRM4VWKASAIXZRF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JIRM4VWK","created_at":"2026-05-18T12:32:31Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:JIRM4VWKASAIXZRFZUOYJZBRVH","target":"record","payload":{"canonical_record":{"source":{"id":"1802.05252","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T18:21:53Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"778a4abb53e75044825072c1d058a57f0ad592c399aad91c5958b85f5cb1cd6e","abstract_canon_sha256":"ea08f564d9e72981752556d3bdec56a6e6781facdbbea0b8a874de37b353cb3c"},"schema_version":"1.0"},"canonical_sha256":"4a22ce56ca04808be625cd1d84e431a9e29beca0e56d1f42423c50a98de36a00","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:23:19.861364Z","signature_b64":"P0nVnrfg76o9uzztUyYWcneBVujEbsYlSXCHowfezqOhyW5CuLKOqbftSZrlrLePmlS3TRcQMYVV1+H/hDFPDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a22ce56ca04808be625cd1d84e431a9e29beca0e56d1f42423c50a98de36a00","last_reissued_at":"2026-05-18T00:23:19.860632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:23:19.860632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.05252","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:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1deXY+/eWms09qQijsWOctX0XaPlgv571/rZ34bYTmcFOLBs3i8bMjGoBxMUtS+B1tNgog+s8s+/XOH6RSYPDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:32:35.609111Z"},"content_sha256":"4e729efd5bdcf48a3e0da1ae4b47def90844d0d1b751218c0ed6740cfd16c73a","schema_version":"1.0","event_id":"sha256:4e729efd5bdcf48a3e0da1ae4b47def90844d0d1b751218c0ed6740cfd16c73a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:JIRM4VWKASAIXZRFZUOYJZBRVH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Upgrading nodes in tree-shaped hub location","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Alfredo Mar\\'in, V\\'ictor Blanco","submitted_at":"2018-02-14T18:21:53Z","abstract_excerpt":"In this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented by Contreras et. al (2010), and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for the first time by Krumke (1999). In addition to locate the hubs, to determine the tree that connects the hubs and to allocate non-hub nodes to hubs, a decision has to be made about which of the hubs will be upgraded, taking into account that the total number of upgraded nodes is given. We present two different Mixed Integer Linear Programming formulations fo"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05252","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:23:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"44+/AAI3xHvDufVGVZOQhc9urls6QSYJQshk0Q+bQ2GstdylWC5I4X/ry/mYvddHfapyG95GSy7OwY5uIfQdDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T06:32:35.609477Z"},"content_sha256":"134008399b3caeb4acf8e5af7894cacd359e24aa72affc6829ab63ca64fc05e2","schema_version":"1.0","event_id":"sha256:134008399b3caeb4acf8e5af7894cacd359e24aa72affc6829ab63ca64fc05e2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JIRM4VWKASAIXZRFZUOYJZBRVH/bundle.json","state_url":"https://pith.science/pith/JIRM4VWKASAIXZRFZUOYJZBRVH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JIRM4VWKASAIXZRFZUOYJZBRVH/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-03T06:32:35Z","links":{"resolver":"https://pith.science/pith/JIRM4VWKASAIXZRFZUOYJZBRVH","bundle":"https://pith.science/pith/JIRM4VWKASAIXZRFZUOYJZBRVH/bundle.json","state":"https://pith.science/pith/JIRM4VWKASAIXZRFZUOYJZBRVH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JIRM4VWKASAIXZRFZUOYJZBRVH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:JIRM4VWKASAIXZRFZUOYJZBRVH","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":"ea08f564d9e72981752556d3bdec56a6e6781facdbbea0b8a874de37b353cb3c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T18:21:53Z","title_canon_sha256":"778a4abb53e75044825072c1d058a57f0ad592c399aad91c5958b85f5cb1cd6e"},"schema_version":"1.0","source":{"id":"1802.05252","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.05252","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"arxiv_version","alias_value":"1802.05252v1","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.05252","created_at":"2026-05-18T00:23:19Z"},{"alias_kind":"pith_short_12","alias_value":"JIRM4VWKASAI","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_16","alias_value":"JIRM4VWKASAIXZRF","created_at":"2026-05-18T12:32:31Z"},{"alias_kind":"pith_short_8","alias_value":"JIRM4VWK","created_at":"2026-05-18T12:32:31Z"}],"graph_snapshots":[{"event_id":"sha256:134008399b3caeb4acf8e5af7894cacd359e24aa72affc6829ab63ca64fc05e2","target":"graph","created_at":"2026-05-18T00:23:19Z","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 this paper, we introduce the Tree of Hubs Location Problem with Upgrading, a mixture of the Tree of Hubs Location Problem, presented by Contreras et. al (2010), and the Minimum Cost Spanning Tree Problem with Upgraded nodes, studied for the first time by Krumke (1999). In addition to locate the hubs, to determine the tree that connects the hubs and to allocate non-hub nodes to hubs, a decision has to be made about which of the hubs will be upgraded, taking into account that the total number of upgraded nodes is given. We present two different Mixed Integer Linear Programming formulations fo","authors_text":"Alfredo Mar\\'in, V\\'ictor Blanco","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T18:21:53Z","title":"Upgrading nodes in tree-shaped hub location"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.05252","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:4e729efd5bdcf48a3e0da1ae4b47def90844d0d1b751218c0ed6740cfd16c73a","target":"record","created_at":"2026-05-18T00:23:19Z","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":"ea08f564d9e72981752556d3bdec56a6e6781facdbbea0b8a874de37b353cb3c","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-14T18:21:53Z","title_canon_sha256":"778a4abb53e75044825072c1d058a57f0ad592c399aad91c5958b85f5cb1cd6e"},"schema_version":"1.0","source":{"id":"1802.05252","kind":"arxiv","version":1}},"canonical_sha256":"4a22ce56ca04808be625cd1d84e431a9e29beca0e56d1f42423c50a98de36a00","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"4a22ce56ca04808be625cd1d84e431a9e29beca0e56d1f42423c50a98de36a00","first_computed_at":"2026-05-18T00:23:19.860632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:23:19.860632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"P0nVnrfg76o9uzztUyYWcneBVujEbsYlSXCHowfezqOhyW5CuLKOqbftSZrlrLePmlS3TRcQMYVV1+H/hDFPDw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:23:19.861364Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.05252","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4e729efd5bdcf48a3e0da1ae4b47def90844d0d1b751218c0ed6740cfd16c73a","sha256:134008399b3caeb4acf8e5af7894cacd359e24aa72affc6829ab63ca64fc05e2"],"state_sha256":"832c30119054586d85dc197dc7e85633902e1973087aa66d04203603dab45358"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jUIAyTc6cF2bZu059on8HtVi5m9FWhkNbEmb9xthgolVKz+DUc2hU08YB3jvXr2PlPm8fW44cbproesHEQO9CQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T06:32:35.611405Z","bundle_sha256":"11166954802ed952b362fb9c4a538db3d9d1c416f733dcfd3474e3595993b551"}}