{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:GAZBVB4X6NYV6S4FHUBSPO4N5H","short_pith_number":"pith:GAZBVB4X","schema_version":"1.0","canonical_sha256":"30321a8797f3715f4b853d0327bb8de9eafe4c9ec6623edcdbff29af3b10262d","source":{"kind":"arxiv","id":"1903.11980","version":1},"attestation_state":"computed","paper":{"title":"Probabilistic Analysis of Facility Location on Random Shortest Path Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, Stefan Klootwijk","submitted_at":"2019-03-28T14:01:44Z","abstract_excerpt":"The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much better than worst-case analysis suggests. Therefore, probabilistic analysis is a widely used tool to analyze such algorithms. Most research on probabilistic analysis of NP-hard optimization problems involving metric spaces, such as the facility location problem, has been focused on Euclidean instances, and also instances with independent (random) edge lengths, which are non-metric, have been researched. We would like 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":"1903.11980","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-03-28T14:01:44Z","cross_cats_sorted":["math.PR"],"title_canon_sha256":"c99da04d7945ffc00e7e24635e72136c21e343aa9e5a5afa0869571f348298ca","abstract_canon_sha256":"3e02b409bbea0d4f45c4929d9c554e16ede21ed66010ca249de8c858135e7cd5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:58.481046Z","signature_b64":"cFEgabp5n/7cayUFTmZvVh/sX7KCweYkAWH4MC2hDXKwtSfbGE4fcnmr4Ig5CBbDkwohKCZKexFd36srL+9FCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"30321a8797f3715f4b853d0327bb8de9eafe4c9ec6623edcdbff29af3b10262d","last_reissued_at":"2026-05-17T23:49:58.480365Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:58.480365Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Probabilistic Analysis of Facility Location on Random Shortest Path Metrics","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.PR"],"primary_cat":"cs.DS","authors_text":"Bodo Manthey, Stefan Klootwijk","submitted_at":"2019-03-28T14:01:44Z","abstract_excerpt":"The facility location problem is an NP-hard optimization problem. Therefore, approximation algorithms are often used to solve large instances. Such algorithms often perform much better than worst-case analysis suggests. Therefore, probabilistic analysis is a widely used tool to analyze such algorithms. Most research on probabilistic analysis of NP-hard optimization problems involving metric spaces, such as the facility location problem, has been focused on Euclidean instances, and also instances with independent (random) edge lengths, which are non-metric, have been researched. We would like t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1903.11980","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":""},"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":"1903.11980","created_at":"2026-05-17T23:49:58.480458+00:00"},{"alias_kind":"arxiv_version","alias_value":"1903.11980v1","created_at":"2026-05-17T23:49:58.480458+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1903.11980","created_at":"2026-05-17T23:49:58.480458+00:00"},{"alias_kind":"pith_short_12","alias_value":"GAZBVB4X6NYV","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_16","alias_value":"GAZBVB4X6NYV6S4F","created_at":"2026-05-18T12:33:18.533446+00:00"},{"alias_kind":"pith_short_8","alias_value":"GAZBVB4X","created_at":"2026-05-18T12:33:18.533446+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/GAZBVB4X6NYV6S4FHUBSPO4N5H","json":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H.json","graph_json":"https://pith.science/api/pith-number/GAZBVB4X6NYV6S4FHUBSPO4N5H/graph.json","events_json":"https://pith.science/api/pith-number/GAZBVB4X6NYV6S4FHUBSPO4N5H/events.json","paper":"https://pith.science/paper/GAZBVB4X"},"agent_actions":{"view_html":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H","download_json":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H.json","view_paper":"https://pith.science/paper/GAZBVB4X","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1903.11980&json=true","fetch_graph":"https://pith.science/api/pith-number/GAZBVB4X6NYV6S4FHUBSPO4N5H/graph.json","fetch_events":"https://pith.science/api/pith-number/GAZBVB4X6NYV6S4FHUBSPO4N5H/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H/action/storage_attestation","attest_author":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H/action/author_attestation","sign_citation":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H/action/citation_signature","submit_replication":"https://pith.science/pith/GAZBVB4X6NYV6S4FHUBSPO4N5H/action/replication_record"}},"created_at":"2026-05-17T23:49:58.480458+00:00","updated_at":"2026-05-17T23:49:58.480458+00:00"}