{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:HTPEODRIOWRYRVX2GJXP4A63EZ","short_pith_number":"pith:HTPEODRI","schema_version":"1.0","canonical_sha256":"3cde470e2875a388d6fa326efe03db264d8e6163ea8b0db8ad2e4935db36b07c","source":{"kind":"arxiv","id":"1301.0745","version":2},"attestation_state":"computed","paper":{"title":"Matroid and Knapsack Center Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Danny Z. Chen, Haitao Wang, Hongyu Liang, Jian Li","submitted_at":"2013-01-04T15:17:06Z","abstract_excerpt":"In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important generalizations of $k$-center, the matroid center problem and the knapsack center problem. Both problems are motivated by recent content distribution network applications. Our contributions can be summarized as follows:\n  1. We consider the matroid center problem in which the centers are required to form an independent set of a given matroid. We show this prob"},"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":"1301.0745","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-01-04T15:17:06Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"e0b08f05b19c7842b5550407cd0697db37e0c68696a9e138e7f8f84279c0a11a","abstract_canon_sha256":"1bcc2c67486295f2969b8c75a72d49a57ac7d9edf70abb77065c192a1c90a6ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:36:26.495962Z","signature_b64":"gjnjwL7U0KJzZxAWTfP69qo8iA2RQBnXS0udVPqr0ZiEtZCGIMu1LlGKqTCRfSYbk7GKR/o4LHvF+uBUeuXuBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3cde470e2875a388d6fa326efe03db264d8e6163ea8b0db8ad2e4935db36b07c","last_reissued_at":"2026-05-18T03:36:26.495087Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:36:26.495087Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Matroid and Knapsack Center Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Danny Z. Chen, Haitao Wang, Hongyu Liang, Jian Li","submitted_at":"2013-01-04T15:17:06Z","abstract_excerpt":"In the classic $k$-center problem, we are given a metric graph, and the objective is to open $k$ nodes as centers such that the maximum distance from any vertex to its closest center is minimized. In this paper, we consider two important generalizations of $k$-center, the matroid center problem and the knapsack center problem. Both problems are motivated by recent content distribution network applications. Our contributions can be summarized as follows:\n  1. We consider the matroid center problem in which the centers are required to form an independent set of a given matroid. We show this prob"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1301.0745","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":""},"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":"1301.0745","created_at":"2026-05-18T03:36:26.495238+00:00"},{"alias_kind":"arxiv_version","alias_value":"1301.0745v2","created_at":"2026-05-18T03:36:26.495238+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1301.0745","created_at":"2026-05-18T03:36:26.495238+00:00"},{"alias_kind":"pith_short_12","alias_value":"HTPEODRIOWRY","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_16","alias_value":"HTPEODRIOWRYRVX2","created_at":"2026-05-18T12:27:46.883200+00:00"},{"alias_kind":"pith_short_8","alias_value":"HTPEODRI","created_at":"2026-05-18T12:27:46.883200+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/HTPEODRIOWRYRVX2GJXP4A63EZ","json":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ.json","graph_json":"https://pith.science/api/pith-number/HTPEODRIOWRYRVX2GJXP4A63EZ/graph.json","events_json":"https://pith.science/api/pith-number/HTPEODRIOWRYRVX2GJXP4A63EZ/events.json","paper":"https://pith.science/paper/HTPEODRI"},"agent_actions":{"view_html":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ","download_json":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ.json","view_paper":"https://pith.science/paper/HTPEODRI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1301.0745&json=true","fetch_graph":"https://pith.science/api/pith-number/HTPEODRIOWRYRVX2GJXP4A63EZ/graph.json","fetch_events":"https://pith.science/api/pith-number/HTPEODRIOWRYRVX2GJXP4A63EZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ/action/storage_attestation","attest_author":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ/action/author_attestation","sign_citation":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ/action/citation_signature","submit_replication":"https://pith.science/pith/HTPEODRIOWRYRVX2GJXP4A63EZ/action/replication_record"}},"created_at":"2026-05-18T03:36:26.495238+00:00","updated_at":"2026-05-18T03:36:26.495238+00:00"}