{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:UOLR7OWDOLN6DEIILJFG544ORR","short_pith_number":"pith:UOLR7OWD","schema_version":"1.0","canonical_sha256":"a3971fbac372dbe191085a4a6ef38e8c6daf97b286756c028fdd5815012d2dca","source":{"kind":"arxiv","id":"1909.04910","version":1},"attestation_state":"computed","paper":{"title":"An exact solution framework for the multiple gradual cover location problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Eduardo \\'Alvarez-Miranda, Markus Sinnl","submitted_at":"2019-09-11T08:30:43Z","abstract_excerpt":"Facility and covering location models are key elements in many decision aid tools in logistics, supply chain design, telecommunications, public infrastructure planning, and many other industrial and public sectors. In many applications, it is likely that customers are not dichotomously covered by facilities, but gradually covered according to, e.g., the distance to the open facilities. Moreover, customers are not served by a single facility, but by a collection of them, which jointly serve them. In this paper we study the recently introduced multiple gradual cover location problem (MGCLP). The"},"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":"1909.04910","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2019-09-11T08:30:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1b4ae3d46ff5843a7ecbe2377c3e5db1bdfb4a69da0f5374611d0d6c41fa143a","abstract_canon_sha256":"994ed1c8f7bc2ae40eb3977df747aa4cc0761c8590a0f1283832be2a639c37a6"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:04:01.484570Z","signature_b64":"zUyk3g0dSCEWrr6eMBrZLBZSe04GrHo+Lo+EgLkdd4K1jXPigZ93WFVZL4A9VglA+RBd0dDOyTK7VARITx3FCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a3971fbac372dbe191085a4a6ef38e8c6daf97b286756c028fdd5815012d2dca","last_reissued_at":"2026-07-05T00:04:01.484115Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:04:01.484115Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An exact solution framework for the multiple gradual cover location problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Eduardo \\'Alvarez-Miranda, Markus Sinnl","submitted_at":"2019-09-11T08:30:43Z","abstract_excerpt":"Facility and covering location models are key elements in many decision aid tools in logistics, supply chain design, telecommunications, public infrastructure planning, and many other industrial and public sectors. In many applications, it is likely that customers are not dichotomously covered by facilities, but gradually covered according to, e.g., the distance to the open facilities. Moreover, customers are not served by a single facility, but by a collection of them, which jointly serve them. In this paper we study the recently introduced multiple gradual cover location problem (MGCLP). The"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.04910","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/1909.04910/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":"1909.04910","created_at":"2026-07-05T00:04:01.484180+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.04910v1","created_at":"2026-07-05T00:04:01.484180+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.04910","created_at":"2026-07-05T00:04:01.484180+00:00"},{"alias_kind":"pith_short_12","alias_value":"UOLR7OWDOLN6","created_at":"2026-07-05T00:04:01.484180+00:00"},{"alias_kind":"pith_short_16","alias_value":"UOLR7OWDOLN6DEII","created_at":"2026-07-05T00:04:01.484180+00:00"},{"alias_kind":"pith_short_8","alias_value":"UOLR7OWD","created_at":"2026-07-05T00:04:01.484180+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/UOLR7OWDOLN6DEIILJFG544ORR","json":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR.json","graph_json":"https://pith.science/api/pith-number/UOLR7OWDOLN6DEIILJFG544ORR/graph.json","events_json":"https://pith.science/api/pith-number/UOLR7OWDOLN6DEIILJFG544ORR/events.json","paper":"https://pith.science/paper/UOLR7OWD"},"agent_actions":{"view_html":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR","download_json":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR.json","view_paper":"https://pith.science/paper/UOLR7OWD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.04910&json=true","fetch_graph":"https://pith.science/api/pith-number/UOLR7OWDOLN6DEIILJFG544ORR/graph.json","fetch_events":"https://pith.science/api/pith-number/UOLR7OWDOLN6DEIILJFG544ORR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR/action/storage_attestation","attest_author":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR/action/author_attestation","sign_citation":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR/action/citation_signature","submit_replication":"https://pith.science/pith/UOLR7OWDOLN6DEIILJFG544ORR/action/replication_record"}},"created_at":"2026-07-05T00:04:01.484180+00:00","updated_at":"2026-07-05T00:04:01.484180+00:00"}