{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YBPIXZEQ3OWWTCVTM2EAKKHUOL","short_pith_number":"pith:YBPIXZEQ","schema_version":"1.0","canonical_sha256":"c05e8be490dbad698ab366880528f472ef9668e50fb81ee2257c9ce71c05c7be","source":{"kind":"arxiv","id":"1402.4183","version":1},"attestation_state":"computed","paper":{"title":"An Improved Algorithm for Fixed-Hub Single Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Dongdong Ge, Jiawei Zhang, Lai Wei, Zizhuo Wang","submitted_at":"2014-02-17T23:42:50Z","abstract_excerpt":"This paper discusses the fixed-hub single allocation problem (FHSAP). In this problem, a network consists of hub nodes and terminal nodes. Hubs are fixed and fully connected; each terminal node is connected to a single hub which routes all its traffic. The goal is to minimize the cost of routing the traffic in the network. In this paper, we propose a linear programming (LP)-based rounding algorithm. The algorithm is based on two ideas. First, we modify the LP relaxation formulation introduced in Ernst and Krishnamoorthy (1996, 1999) by incorporating a set of validity constraints. Then, after o"},"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":"1402.4183","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T23:42:50Z","cross_cats_sorted":["cs.CC","math.OC"],"title_canon_sha256":"04bb25a504efba0ad3f283b5a949fc5bc4d52aa2e2fa44cbf3d9a6387fa9393c","abstract_canon_sha256":"7e4f0a6caf277b2dc85467d4a8f90917a71cad189abc7904ddfafd1d8a23ec95"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:58:44.613465Z","signature_b64":"wfXIdJlhbbL18kgRVguthBNmA6UxnNIz2ZR2FdUQp0fBrveDmw4o9lZgdskJUCUGSmog1Ob5fkHf45JOuCHRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c05e8be490dbad698ab366880528f472ef9668e50fb81ee2257c9ce71c05c7be","last_reissued_at":"2026-05-18T02:58:44.612663Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:58:44.612663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Algorithm for Fixed-Hub Single Allocation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC","math.OC"],"primary_cat":"cs.DS","authors_text":"Dongdong Ge, Jiawei Zhang, Lai Wei, Zizhuo Wang","submitted_at":"2014-02-17T23:42:50Z","abstract_excerpt":"This paper discusses the fixed-hub single allocation problem (FHSAP). In this problem, a network consists of hub nodes and terminal nodes. Hubs are fixed and fully connected; each terminal node is connected to a single hub which routes all its traffic. The goal is to minimize the cost of routing the traffic in the network. In this paper, we propose a linear programming (LP)-based rounding algorithm. The algorithm is based on two ideas. First, we modify the LP relaxation formulation introduced in Ernst and Krishnamoorthy (1996, 1999) by incorporating a set of validity constraints. Then, after o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4183","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":"1402.4183","created_at":"2026-05-18T02:58:44.612806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1402.4183v1","created_at":"2026-05-18T02:58:44.612806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4183","created_at":"2026-05-18T02:58:44.612806+00:00"},{"alias_kind":"pith_short_12","alias_value":"YBPIXZEQ3OWW","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YBPIXZEQ3OWWTCVT","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YBPIXZEQ","created_at":"2026-05-18T12:28:57.508820+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/YBPIXZEQ3OWWTCVTM2EAKKHUOL","json":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL.json","graph_json":"https://pith.science/api/pith-number/YBPIXZEQ3OWWTCVTM2EAKKHUOL/graph.json","events_json":"https://pith.science/api/pith-number/YBPIXZEQ3OWWTCVTM2EAKKHUOL/events.json","paper":"https://pith.science/paper/YBPIXZEQ"},"agent_actions":{"view_html":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL","download_json":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL.json","view_paper":"https://pith.science/paper/YBPIXZEQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1402.4183&json=true","fetch_graph":"https://pith.science/api/pith-number/YBPIXZEQ3OWWTCVTM2EAKKHUOL/graph.json","fetch_events":"https://pith.science/api/pith-number/YBPIXZEQ3OWWTCVTM2EAKKHUOL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/action/storage_attestation","attest_author":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/action/author_attestation","sign_citation":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/action/citation_signature","submit_replication":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/action/replication_record"}},"created_at":"2026-05-18T02:58:44.612806+00:00","updated_at":"2026-05-18T02:58:44.612806+00:00"}