{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:MTNFUECC7VTHLMEZSSLEBOHKSU","short_pith_number":"pith:MTNFUECC","schema_version":"1.0","canonical_sha256":"64da5a1042fd6675b099949640b8ea95387c4dee9663eadf8de1f6bbea4ba170","source":{"kind":"arxiv","id":"2409.11346","version":1},"attestation_state":"computed","paper":{"title":"Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Christof Brandstetter, Markus Sinnl","submitted_at":"2024-09-17T16:51:13Z","abstract_excerpt":"We introduce the nested $p$-center problem, which is a multi-period variant of the well-known $p$-center problem. The use of the nesting concept allows to obtain solutions, which are consistent over the considered time horizon, i.e., facilities which are opened in a given time period stay open for subsequent time periods. This is important in real-life applications, as closing (and potential later re-opening) of facilities between time periods can be undesirable.\n  We consider two different versions of our problem, with the difference being the objective function. The first version considers t"},"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":"2409.11346","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2024-09-17T16:51:13Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"93436d889261da4a763f6937294a2c9a07bb76eecd98733aa88deb7c9e9f4361","abstract_canon_sha256":"01568fec0286ce99e45aa5a21fcc7af02f924260e9738adbd69fb663d2b2f21a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:08:16.734344Z","signature_b64":"hiXD8lEnaSb2ea69P1uNVcyfeL+ERc72QNcHSi8N5E78iD9o2x8ETaAGWEshV7Ua0KRK0vhdtALrkP08dHbQCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"64da5a1042fd6675b099949640b8ea95387c4dee9663eadf8de1f6bbea4ba170","last_reissued_at":"2026-07-05T09:08:16.733878Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:08:16.733878Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Mixed-integer linear programming approaches for nested $p$-center problems with absolute and relative regret objectives","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Christof Brandstetter, Markus Sinnl","submitted_at":"2024-09-17T16:51:13Z","abstract_excerpt":"We introduce the nested $p$-center problem, which is a multi-period variant of the well-known $p$-center problem. The use of the nesting concept allows to obtain solutions, which are consistent over the considered time horizon, i.e., facilities which are opened in a given time period stay open for subsequent time periods. This is important in real-life applications, as closing (and potential later re-opening) of facilities between time periods can be undesirable.\n  We consider two different versions of our problem, with the difference being the objective function. The first version considers t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2409.11346","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2409.11346/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2409.11346","created_at":"2026-07-05T09:08:16.733937+00:00"},{"alias_kind":"arxiv_version","alias_value":"2409.11346v1","created_at":"2026-07-05T09:08:16.733937+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2409.11346","created_at":"2026-07-05T09:08:16.733937+00:00"},{"alias_kind":"pith_short_12","alias_value":"MTNFUECC7VTH","created_at":"2026-07-05T09:08:16.733937+00:00"},{"alias_kind":"pith_short_16","alias_value":"MTNFUECC7VTHLMEZ","created_at":"2026-07-05T09:08:16.733937+00:00"},{"alias_kind":"pith_short_8","alias_value":"MTNFUECC","created_at":"2026-07-05T09:08:16.733937+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/MTNFUECC7VTHLMEZSSLEBOHKSU","json":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU.json","graph_json":"https://pith.science/api/pith-number/MTNFUECC7VTHLMEZSSLEBOHKSU/graph.json","events_json":"https://pith.science/api/pith-number/MTNFUECC7VTHLMEZSSLEBOHKSU/events.json","paper":"https://pith.science/paper/MTNFUECC"},"agent_actions":{"view_html":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU","download_json":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU.json","view_paper":"https://pith.science/paper/MTNFUECC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2409.11346&json=true","fetch_graph":"https://pith.science/api/pith-number/MTNFUECC7VTHLMEZSSLEBOHKSU/graph.json","fetch_events":"https://pith.science/api/pith-number/MTNFUECC7VTHLMEZSSLEBOHKSU/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU/action/storage_attestation","attest_author":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU/action/author_attestation","sign_citation":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU/action/citation_signature","submit_replication":"https://pith.science/pith/MTNFUECC7VTHLMEZSSLEBOHKSU/action/replication_record"}},"created_at":"2026-07-05T09:08:16.733937+00:00","updated_at":"2026-07-05T09:08:16.733937+00:00"}