{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:GPQBUMHRMIPFK554PJEBODZ7QI","short_pith_number":"pith:GPQBUMHR","schema_version":"1.0","canonical_sha256":"33e01a30f1621e5577bc7a48170f3f823d976783b4ac2b3a7e5bd02ec9484ceb","source":{"kind":"arxiv","id":"2211.12908","version":2},"attestation_state":"computed","paper":{"title":"Exact solution approaches for the discrete $\\alpha$-neighbor $p$-center problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Elisabeth Gaar, Markus Sinnl","submitted_at":"2022-11-23T12:21:57Z","abstract_excerpt":"The discrete $\\alpha$-neighbor $p$-center problem (d-$\\alpha$-$p$CP) is an emerging variant of the classical $p$-center problem which recently got attention in literature. In this problem, we are given a discrete set of points and we need to locate $p$ facilities on these points in such a way that the maximum distance between each point where no facility is located and its $\\alpha$-closest facility is minimized. The only existing algorithms in literature for solving the d-$\\alpha$-$p$CP are approximation algorithms and two recently proposed heuristics.\n  In this work, we present two integer 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":"2211.12908","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-23T12:21:57Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"27ed9c67ad08d24c01b1019152de7e9957e18fb12cd9ad1e6b44fddc7e0f77a6","abstract_canon_sha256":"ee127e3001c22122fc9d4126d16721c0cb908c5f2a647af79aa338c044d1a8f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:49.988652Z","signature_b64":"ojR9Ux+boNpsJ9lfATAQfHwqv4WxX1JYh2vQ5uEjPb+XDhI/EuhaiX5fZAGh6M9zw26BaEKSCFnPM0A3ZtTrDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"33e01a30f1621e5577bc7a48170f3f823d976783b4ac2b3a7e5bd02ec9484ceb","last_reissued_at":"2026-07-05T09:39:49.988200Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:49.988200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact solution approaches for the discrete $\\alpha$-neighbor $p$-center problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"math.OC","authors_text":"Elisabeth Gaar, Markus Sinnl","submitted_at":"2022-11-23T12:21:57Z","abstract_excerpt":"The discrete $\\alpha$-neighbor $p$-center problem (d-$\\alpha$-$p$CP) is an emerging variant of the classical $p$-center problem which recently got attention in literature. In this problem, we are given a discrete set of points and we need to locate $p$ facilities on these points in such a way that the maximum distance between each point where no facility is located and its $\\alpha$-closest facility is minimized. The only existing algorithms in literature for solving the d-$\\alpha$-$p$CP are approximation algorithms and two recently proposed heuristics.\n  In this work, we present two integer pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12908","kind":"arxiv","version":2},"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/2211.12908/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":"2211.12908","created_at":"2026-07-05T09:39:49.988248+00:00"},{"alias_kind":"arxiv_version","alias_value":"2211.12908v2","created_at":"2026-07-05T09:39:49.988248+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12908","created_at":"2026-07-05T09:39:49.988248+00:00"},{"alias_kind":"pith_short_12","alias_value":"GPQBUMHRMIPF","created_at":"2026-07-05T09:39:49.988248+00:00"},{"alias_kind":"pith_short_16","alias_value":"GPQBUMHRMIPFK554","created_at":"2026-07-05T09:39:49.988248+00:00"},{"alias_kind":"pith_short_8","alias_value":"GPQBUMHR","created_at":"2026-07-05T09:39:49.988248+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/GPQBUMHRMIPFK554PJEBODZ7QI","json":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI.json","graph_json":"https://pith.science/api/pith-number/GPQBUMHRMIPFK554PJEBODZ7QI/graph.json","events_json":"https://pith.science/api/pith-number/GPQBUMHRMIPFK554PJEBODZ7QI/events.json","paper":"https://pith.science/paper/GPQBUMHR"},"agent_actions":{"view_html":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI","download_json":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI.json","view_paper":"https://pith.science/paper/GPQBUMHR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2211.12908&json=true","fetch_graph":"https://pith.science/api/pith-number/GPQBUMHRMIPFK554PJEBODZ7QI/graph.json","fetch_events":"https://pith.science/api/pith-number/GPQBUMHRMIPFK554PJEBODZ7QI/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/action/storage_attestation","attest_author":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/action/author_attestation","sign_citation":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/action/citation_signature","submit_replication":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/action/replication_record"}},"created_at":"2026-07-05T09:39:49.988248+00:00","updated_at":"2026-07-05T09:39:49.988248+00:00"}