{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2007:PFLFXC3ZOQBMG7D2ABAYTKBXIB","short_pith_number":"pith:PFLFXC3Z","schema_version":"1.0","canonical_sha256":"79565b8b797402c37c7a004189a83740526e7d81fb2bce945056fa0f3585f244","source":{"kind":"arxiv","id":"0705.0561","version":2},"attestation_state":"computed","paper":{"title":"Iterative Rounding for the Closest String Problem","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jing-Chao Chen","submitted_at":"2007-05-04T03:01:42Z","abstract_excerpt":"The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a given set of strings. This can be reduced to an integer program (IP). However, to date, there exists no known polynomial-time algorithm for IP. In 2004, Meneses et al. introduced a branch-and-bound (B & B) method for solving the IP problem. Their algorithm is not always efficient and has the exponential time complexity. In the paper, we attempt to solve efficiently the IP problem by a greedy iterative rounding technique. The proposed algorithm is polynomial time and muc"},"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":"0705.0561","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2007-05-04T03:01:42Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"4b809f61184ef80fcd5615c443a9318446bb7366c056f191393d863c6df1c4ff","abstract_canon_sha256":"6a638adb7994b65d1f1eafdb1e81b8001f14689d89582852afdcb1a22fbf2949"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:22:30.033842Z","signature_b64":"v2Zpex8TZxlfVo6y2+hCW4vOT7qHl1yxz1pl0gyj6Kyfgk4MyAILKiD+NZ6NYw1tHs4GLqDj5r6l/0zmF/EOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"79565b8b797402c37c7a004189a83740526e7d81fb2bce945056fa0f3585f244","last_reissued_at":"2026-05-18T04:22:30.033355Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:22:30.033355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Iterative Rounding for the Closest String Problem","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DS","authors_text":"Jing-Chao Chen","submitted_at":"2007-05-04T03:01:42Z","abstract_excerpt":"The closest string problem is an NP-hard problem, whose task is to find a string that minimizes maximum Hamming distance to a given set of strings. This can be reduced to an integer program (IP). However, to date, there exists no known polynomial-time algorithm for IP. In 2004, Meneses et al. introduced a branch-and-bound (B & B) method for solving the IP problem. Their algorithm is not always efficient and has the exponential time complexity. In the paper, we attempt to solve efficiently the IP problem by a greedy iterative rounding technique. The proposed algorithm is polynomial time and muc"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.0561","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":"0705.0561","created_at":"2026-05-18T04:22:30.033439+00:00"},{"alias_kind":"arxiv_version","alias_value":"0705.0561v2","created_at":"2026-05-18T04:22:30.033439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0561","created_at":"2026-05-18T04:22:30.033439+00:00"},{"alias_kind":"pith_short_12","alias_value":"PFLFXC3ZOQBM","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_16","alias_value":"PFLFXC3ZOQBMG7D2","created_at":"2026-05-18T12:25:55.427421+00:00"},{"alias_kind":"pith_short_8","alias_value":"PFLFXC3Z","created_at":"2026-05-18T12:25:55.427421+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/PFLFXC3ZOQBMG7D2ABAYTKBXIB","json":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB.json","graph_json":"https://pith.science/api/pith-number/PFLFXC3ZOQBMG7D2ABAYTKBXIB/graph.json","events_json":"https://pith.science/api/pith-number/PFLFXC3ZOQBMG7D2ABAYTKBXIB/events.json","paper":"https://pith.science/paper/PFLFXC3Z"},"agent_actions":{"view_html":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB","download_json":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB.json","view_paper":"https://pith.science/paper/PFLFXC3Z","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0705.0561&json=true","fetch_graph":"https://pith.science/api/pith-number/PFLFXC3ZOQBMG7D2ABAYTKBXIB/graph.json","fetch_events":"https://pith.science/api/pith-number/PFLFXC3ZOQBMG7D2ABAYTKBXIB/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/action/storage_attestation","attest_author":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/action/author_attestation","sign_citation":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/action/citation_signature","submit_replication":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/action/replication_record"}},"created_at":"2026-05-18T04:22:30.033439+00:00","updated_at":"2026-05-18T04:22:30.033439+00:00"}