{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:YBPIXZEQ3OWWTCVTM2EAKKHUOL","short_pith_number":"pith:YBPIXZEQ","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"},"canonical_sha256":"c05e8be490dbad698ab366880528f472ef9668e50fb81ee2257c9ce71c05c7be","source":{"kind":"arxiv","id":"1402.4183","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4183","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4183v1","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4183","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"YBPIXZEQ3OWW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YBPIXZEQ3OWWTCVT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YBPIXZEQ","created_at":"2026-05-18T12:28:57Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:YBPIXZEQ3OWWTCVTM2EAKKHUOL","target":"record","payload":{"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"},"canonical_sha256":"c05e8be490dbad698ab366880528f472ef9668e50fb81ee2257c9ce71c05c7be","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"},"source_kind":"arxiv","source_id":"1402.4183","source_version":1,"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-05-18T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"s4zeJm9le+UhaMF7tdwhHwvvbZjS6MTe4tWH6Ew2QRtleMgVcKjPWadlhqLnY+DvIAiZtt02pJ2rb9nb4YjVDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:26:53.902687Z"},"content_sha256":"e665dc28bc01b68357e1986ad71e3a2299af23783df12e95c468e11caf4b8db3","schema_version":"1.0","event_id":"sha256:e665dc28bc01b68357e1986ad71e3a2299af23783df12e95c468e11caf4b8db3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:YBPIXZEQ3OWWTCVTM2EAKKHUOL","target":"graph","payload":{"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"},"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-05-18T02:58:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GIm6EjBo13/nwWqpbfNYKS877P1qp3UZWvLdZDOOqUYhunBZGZopeMR7jc5COHuWRbHCaDa2dzyRXomiDoR1Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T06:26:53.903040Z"},"content_sha256":"17feebcab4a78f78127ae8edccdc25490b1dc60e7f57a5e97b9a22f04c245192","schema_version":"1.0","event_id":"sha256:17feebcab4a78f78127ae8edccdc25490b1dc60e7f57a5e97b9a22f04c245192"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/bundle.json","state_url":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/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-05-28T06:26:53Z","links":{"resolver":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL","bundle":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/bundle.json","state":"https://pith.science/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/YBPIXZEQ3OWWTCVTM2EAKKHUOL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:YBPIXZEQ3OWWTCVTM2EAKKHUOL","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":"7e4f0a6caf277b2dc85467d4a8f90917a71cad189abc7904ddfafd1d8a23ec95","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T23:42:50Z","title_canon_sha256":"04bb25a504efba0ad3f283b5a949fc5bc4d52aa2e2fa44cbf3d9a6387fa9393c"},"schema_version":"1.0","source":{"id":"1402.4183","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1402.4183","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"arxiv_version","alias_value":"1402.4183v1","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1402.4183","created_at":"2026-05-18T02:58:44Z"},{"alias_kind":"pith_short_12","alias_value":"YBPIXZEQ3OWW","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_16","alias_value":"YBPIXZEQ3OWWTCVT","created_at":"2026-05-18T12:28:57Z"},{"alias_kind":"pith_short_8","alias_value":"YBPIXZEQ","created_at":"2026-05-18T12:28:57Z"}],"graph_snapshots":[{"event_id":"sha256:17feebcab4a78f78127ae8edccdc25490b1dc60e7f57a5e97b9a22f04c245192","target":"graph","created_at":"2026-05-18T02:58:44Z","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"},"paper":{"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","authors_text":"Dongdong Ge, Jiawei Zhang, Lai Wei, Zizhuo Wang","cross_cats":["cs.CC","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T23:42:50Z","title":"An Improved Algorithm for Fixed-Hub Single Allocation Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1402.4183","kind":"arxiv","version":1},"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:e665dc28bc01b68357e1986ad71e3a2299af23783df12e95c468e11caf4b8db3","target":"record","created_at":"2026-05-18T02:58:44Z","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":"7e4f0a6caf277b2dc85467d4a8f90917a71cad189abc7904ddfafd1d8a23ec95","cross_cats_sorted":["cs.CC","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-02-17T23:42:50Z","title_canon_sha256":"04bb25a504efba0ad3f283b5a949fc5bc4d52aa2e2fa44cbf3d9a6387fa9393c"},"schema_version":"1.0","source":{"id":"1402.4183","kind":"arxiv","version":1}},"canonical_sha256":"c05e8be490dbad698ab366880528f472ef9668e50fb81ee2257c9ce71c05c7be","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c05e8be490dbad698ab366880528f472ef9668e50fb81ee2257c9ce71c05c7be","first_computed_at":"2026-05-18T02:58:44.612663Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:58:44.612663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"wfXIdJlhbbL18kgRVguthBNmA6UxnNIz2ZR2FdUQp0fBrveDmw4o9lZgdskJUCUGSmog1Ob5fkHf45JOuCHRAg==","signature_status":"signed_v1","signed_at":"2026-05-18T02:58:44.613465Z","signed_message":"canonical_sha256_bytes"},"source_id":"1402.4183","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e665dc28bc01b68357e1986ad71e3a2299af23783df12e95c468e11caf4b8db3","sha256:17feebcab4a78f78127ae8edccdc25490b1dc60e7f57a5e97b9a22f04c245192"],"state_sha256":"32ca7c71abc59048c4e7107d96856321d8d57c332446ab62c1d775433dd92bc3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kDaBU3PhiKKLR0fXfB716F89e20YcKGrd/viek45YE7Zj5acN19IFFls0tOodwg++/4dUualFykiNtIK7v5NBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T06:26:53.905089Z","bundle_sha256":"e4ad3287241b565d5dd572554a6ab3067f92e5cebb13f4e6d2a4b0b93eb71b7f"}}