{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:GPQBUMHRMIPFK554PJEBODZ7QI","short_pith_number":"pith:GPQBUMHR","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"},"canonical_sha256":"33e01a30f1621e5577bc7a48170f3f823d976783b4ac2b3a7e5bd02ec9484ceb","source":{"kind":"arxiv","id":"2211.12908","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.12908","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"2211.12908v2","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12908","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"GPQBUMHRMIPF","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"pith_short_16","alias_value":"GPQBUMHRMIPFK554","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"pith_short_8","alias_value":"GPQBUMHR","created_at":"2026-07-05T09:39:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:GPQBUMHRMIPFK554PJEBODZ7QI","target":"record","payload":{"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"},"canonical_sha256":"33e01a30f1621e5577bc7a48170f3f823d976783b4ac2b3a7e5bd02ec9484ceb","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"},"source_kind":"arxiv","source_id":"2211.12908","source_version":2,"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-07-05T09:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Vi0fC966CzS4yj/Qj0JKj/cLyCyZq8ryL93Pz4HlaWnULXjktljbHYLu8l9qaQlauD+zuDliWF5hY91D+4tSCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:52:56.217732Z"},"content_sha256":"11c4b72d3f8f26f2e892db7eb0fc2246221dd6677e36c7d3ca325866296a0203","schema_version":"1.0","event_id":"sha256:11c4b72d3f8f26f2e892db7eb0fc2246221dd6677e36c7d3ca325866296a0203"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:GPQBUMHRMIPFK554PJEBODZ7QI","target":"graph","payload":{"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"},"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-07-05T09:39:49Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NDe/qQs5NUXDi/d1Y6yxy/diHKav4wVnQvUkbzC44QTE0alQOred2A03gMWMAtoVy3b1mEXSEV5daIiwHl87AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-20T23:52:56.218220Z"},"content_sha256":"211ee0501e721bf33ffb66bb904f263a8da97bcf36c15a775886998cb2daf12b","schema_version":"1.0","event_id":"sha256:211ee0501e721bf33ffb66bb904f263a8da97bcf36c15a775886998cb2daf12b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/bundle.json","state_url":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GPQBUMHRMIPFK554PJEBODZ7QI/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-08-20T23:52:56Z","links":{"resolver":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI","bundle":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/bundle.json","state":"https://pith.science/pith/GPQBUMHRMIPFK554PJEBODZ7QI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GPQBUMHRMIPFK554PJEBODZ7QI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:GPQBUMHRMIPFK554PJEBODZ7QI","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":"ee127e3001c22122fc9d4126d16721c0cb908c5f2a647af79aa338c044d1a8f8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-23T12:21:57Z","title_canon_sha256":"27ed9c67ad08d24c01b1019152de7e9957e18fb12cd9ad1e6b44fddc7e0f77a6"},"schema_version":"1.0","source":{"id":"2211.12908","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2211.12908","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"arxiv_version","alias_value":"2211.12908v2","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2211.12908","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"pith_short_12","alias_value":"GPQBUMHRMIPF","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"pith_short_16","alias_value":"GPQBUMHRMIPFK554","created_at":"2026-07-05T09:39:49Z"},{"alias_kind":"pith_short_8","alias_value":"GPQBUMHR","created_at":"2026-07-05T09:39:49Z"}],"graph_snapshots":[{"event_id":"sha256:211ee0501e721bf33ffb66bb904f263a8da97bcf36c15a775886998cb2daf12b","target":"graph","created_at":"2026-07-05T09:39:49Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2211.12908/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Elisabeth Gaar, Markus Sinnl","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-23T12:21:57Z","title":"Exact solution approaches for the discrete $\\alpha$-neighbor $p$-center problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2211.12908","kind":"arxiv","version":2},"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:11c4b72d3f8f26f2e892db7eb0fc2246221dd6677e36c7d3ca325866296a0203","target":"record","created_at":"2026-07-05T09:39:49Z","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":"ee127e3001c22122fc9d4126d16721c0cb908c5f2a647af79aa338c044d1a8f8","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2022-11-23T12:21:57Z","title_canon_sha256":"27ed9c67ad08d24c01b1019152de7e9957e18fb12cd9ad1e6b44fddc7e0f77a6"},"schema_version":"1.0","source":{"id":"2211.12908","kind":"arxiv","version":2}},"canonical_sha256":"33e01a30f1621e5577bc7a48170f3f823d976783b4ac2b3a7e5bd02ec9484ceb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"33e01a30f1621e5577bc7a48170f3f823d976783b4ac2b3a7e5bd02ec9484ceb","first_computed_at":"2026-07-05T09:39:49.988200Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:49.988200Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ojR9Ux+boNpsJ9lfATAQfHwqv4WxX1JYh2vQ5uEjPb+XDhI/EuhaiX5fZAGh6M9zw26BaEKSCFnPM0A3ZtTrDw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:49.988652Z","signed_message":"canonical_sha256_bytes"},"source_id":"2211.12908","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:11c4b72d3f8f26f2e892db7eb0fc2246221dd6677e36c7d3ca325866296a0203","sha256:211ee0501e721bf33ffb66bb904f263a8da97bcf36c15a775886998cb2daf12b"],"state_sha256":"5681c149e9f1cd4b59127ed526b9fd3a1a269a34f393b0e458af22265637e1ac"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/HVSWUpfVM+hI3aiTIhM6phGr9daU0W6al4ErN9xeTs3YPyIuB0Vs1QQnsaoW7Nu7vFyqOUrIHpwfwNLZhGyBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-20T23:52:56.221696Z","bundle_sha256":"9030fc912463a518463dcaa76c8e009f4b6ffea89ee505d08108d4da7cbc0849"}}