{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:RCCJE2MS7DAHVZCBCHZOYZOUCV","short_pith_number":"pith:RCCJE2MS","canonical_record":{"source":{"id":"2108.07045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-16T12:30:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e8ef7f9ae42047c5be3445838422a4ccf489789b6d9316f42512dbd0c5d1e372","abstract_canon_sha256":"076002c52aa30c79d832ef14c795f775819a58369a4bcd5e95b382308c02410a"},"schema_version":"1.0"},"canonical_sha256":"8884926992f8c07ae44111f2ec65d415592c99d6a1ff98638a7bc38beab4e88e","source":{"kind":"arxiv","id":"2108.07045","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.07045","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"arxiv_version","alias_value":"2108.07045v2","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.07045","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"pith_short_12","alias_value":"RCCJE2MS7DAH","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"pith_short_16","alias_value":"RCCJE2MS7DAHVZCB","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"pith_short_8","alias_value":"RCCJE2MS","created_at":"2026-07-05T04:04:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:RCCJE2MS7DAHVZCBCHZOYZOUCV","target":"record","payload":{"canonical_record":{"source":{"id":"2108.07045","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-16T12:30:07Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e8ef7f9ae42047c5be3445838422a4ccf489789b6d9316f42512dbd0c5d1e372","abstract_canon_sha256":"076002c52aa30c79d832ef14c795f775819a58369a4bcd5e95b382308c02410a"},"schema_version":"1.0"},"canonical_sha256":"8884926992f8c07ae44111f2ec65d415592c99d6a1ff98638a7bc38beab4e88e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:04:40.881426Z","signature_b64":"u6HQYOPHXgllFTCi5XKKp//2orvyiHDU+TZbNu9amlEDlka3Kz5eOEbqXrFsdvvmuHbdmTxxDyzOkO/mpvzbAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8884926992f8c07ae44111f2ec65d415592c99d6a1ff98638a7bc38beab4e88e","last_reissued_at":"2026-07-05T04:04:40.880970Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:04:40.880970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2108.07045","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-05T04:04:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Y5O+pkKqR8SKXv2o+jZWrE1k2sHJCTVcOiMdxgyzBef7e/eEjTUO4dgV3JfDZeiYA0r4WpRMRhtNdajpujs1Dg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T06:09:06.241159Z"},"content_sha256":"a82525b0bb60eb296c5a53f62efbd27b9bca6ccfd606e42b34d2f966fe5ada5e","schema_version":"1.0","event_id":"sha256:a82525b0bb60eb296c5a53f62efbd27b9bca6ccfd606e42b34d2f966fe5ada5e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:RCCJE2MS7DAHVZCBCHZOYZOUCV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A scaleable projection-based branch-and-cut algorithm for the $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":"2021-08-16T12:30:07Z","abstract_excerpt":"The $p$-center problem (pCP) is a fundamental problem in location science, where we are given customer demand points and possible facility locations, and we want to choose $p$ of these locations to open a facility such that the maximum distance of any customer demand point to its closest open facility is minimized. State-of-the-art solution approaches of pCP use its connection to the set cover problem to solve pCP in an iterative fashion by repeatedly solving set cover problems. The classical textbook integer programming (IP) formulation of pCP is usually dismissed due to its size and bad line"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.07045","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/2108.07045/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-05T04:04:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IBOwFXShr5hBnom+xqV63S3iOhVD6ZFxNn9v2nprjPzx/o8bGmQHdUNYuk2SivAErz2yk0XUV2eKwIep+mJxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-21T06:09:06.241712Z"},"content_sha256":"4513cb8dae623a686149b79190540aac880eba1c8fa09b2e3c48a478abe1ae3e","schema_version":"1.0","event_id":"sha256:4513cb8dae623a686149b79190540aac880eba1c8fa09b2e3c48a478abe1ae3e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RCCJE2MS7DAHVZCBCHZOYZOUCV/bundle.json","state_url":"https://pith.science/pith/RCCJE2MS7DAHVZCBCHZOYZOUCV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RCCJE2MS7DAHVZCBCHZOYZOUCV/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-21T06:09:06Z","links":{"resolver":"https://pith.science/pith/RCCJE2MS7DAHVZCBCHZOYZOUCV","bundle":"https://pith.science/pith/RCCJE2MS7DAHVZCBCHZOYZOUCV/bundle.json","state":"https://pith.science/pith/RCCJE2MS7DAHVZCBCHZOYZOUCV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RCCJE2MS7DAHVZCBCHZOYZOUCV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:RCCJE2MS7DAHVZCBCHZOYZOUCV","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":"076002c52aa30c79d832ef14c795f775819a58369a4bcd5e95b382308c02410a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-16T12:30:07Z","title_canon_sha256":"e8ef7f9ae42047c5be3445838422a4ccf489789b6d9316f42512dbd0c5d1e372"},"schema_version":"1.0","source":{"id":"2108.07045","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2108.07045","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"arxiv_version","alias_value":"2108.07045v2","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2108.07045","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"pith_short_12","alias_value":"RCCJE2MS7DAH","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"pith_short_16","alias_value":"RCCJE2MS7DAHVZCB","created_at":"2026-07-05T04:04:40Z"},{"alias_kind":"pith_short_8","alias_value":"RCCJE2MS","created_at":"2026-07-05T04:04:40Z"}],"graph_snapshots":[{"event_id":"sha256:4513cb8dae623a686149b79190540aac880eba1c8fa09b2e3c48a478abe1ae3e","target":"graph","created_at":"2026-07-05T04:04:40Z","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/2108.07045/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The $p$-center problem (pCP) is a fundamental problem in location science, where we are given customer demand points and possible facility locations, and we want to choose $p$ of these locations to open a facility such that the maximum distance of any customer demand point to its closest open facility is minimized. State-of-the-art solution approaches of pCP use its connection to the set cover problem to solve pCP in an iterative fashion by repeatedly solving set cover problems. The classical textbook integer programming (IP) formulation of pCP is usually dismissed due to its size and bad line","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":"2021-08-16T12:30:07Z","title":"A scaleable projection-based branch-and-cut algorithm for the $p$-center problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2108.07045","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:a82525b0bb60eb296c5a53f62efbd27b9bca6ccfd606e42b34d2f966fe5ada5e","target":"record","created_at":"2026-07-05T04:04:40Z","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":"076002c52aa30c79d832ef14c795f775819a58369a4bcd5e95b382308c02410a","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2021-08-16T12:30:07Z","title_canon_sha256":"e8ef7f9ae42047c5be3445838422a4ccf489789b6d9316f42512dbd0c5d1e372"},"schema_version":"1.0","source":{"id":"2108.07045","kind":"arxiv","version":2}},"canonical_sha256":"8884926992f8c07ae44111f2ec65d415592c99d6a1ff98638a7bc38beab4e88e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8884926992f8c07ae44111f2ec65d415592c99d6a1ff98638a7bc38beab4e88e","first_computed_at":"2026-07-05T04:04:40.880970Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T04:04:40.880970Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"u6HQYOPHXgllFTCi5XKKp//2orvyiHDU+TZbNu9amlEDlka3Kz5eOEbqXrFsdvvmuHbdmTxxDyzOkO/mpvzbAA==","signature_status":"signed_v1","signed_at":"2026-07-05T04:04:40.881426Z","signed_message":"canonical_sha256_bytes"},"source_id":"2108.07045","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a82525b0bb60eb296c5a53f62efbd27b9bca6ccfd606e42b34d2f966fe5ada5e","sha256:4513cb8dae623a686149b79190540aac880eba1c8fa09b2e3c48a478abe1ae3e"],"state_sha256":"e927ace77f635150aa4a5454a3b5ba634d3eb43a1c9145a268f29c9d6ac80aa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sT5XIHx69uaYvG9B57AtU6GCHn9w7S3Wiw3jkhiWvJMgwVIGfZjQkKBBvcz4aU24n/PEDrXulHIdu1GX/MU7DA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-21T06:09:06.246630Z","bundle_sha256":"c99bb9f7eeb5cb7b60260f78fbf2604ff4e911d748c40923ac967e1929aef8aa"}}