{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:PFLFXC3ZOQBMG7D2ABAYTKBXIB","short_pith_number":"pith:PFLFXC3Z","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"},"canonical_sha256":"79565b8b797402c37c7a004189a83740526e7d81fb2bce945056fa0f3585f244","source":{"kind":"arxiv","id":"0705.0561","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.0561","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"0705.0561v2","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0561","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"PFLFXC3ZOQBM","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"PFLFXC3ZOQBMG7D2","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"PFLFXC3Z","created_at":"2026-05-18T12:25:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:PFLFXC3ZOQBMG7D2ABAYTKBXIB","target":"record","payload":{"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"},"canonical_sha256":"79565b8b797402c37c7a004189a83740526e7d81fb2bce945056fa0f3585f244","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"},"source_kind":"arxiv","source_id":"0705.0561","source_version":2,"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-18T04:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"usr+hR0uVmGO0Gg/Ct42TiLwgSJWoiPVMrwgIQeJm8Rg57Tnd/1PJs6efcJ2WgdgRwXAHBFUdQIDbuY/SXwWBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:06:16.633249Z"},"content_sha256":"c8a815788cb6e64b5abcd1ae34c653c8843860082c1cd1c6240290813dc9d801","schema_version":"1.0","event_id":"sha256:c8a815788cb6e64b5abcd1ae34c653c8843860082c1cd1c6240290813dc9d801"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:PFLFXC3ZOQBMG7D2ABAYTKBXIB","target":"graph","payload":{"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"},"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-18T04:22:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u/cDw7tDgk08DlZeUy1CaO58+t/tKCZwkFXgipBpaLUzZdy4RwBWlQWYrQHIEjlvB4OcwoJ9Lb+rPi4zFCqBBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T19:06:16.633919Z"},"content_sha256":"16e72a4680fdc864755dca584a08734f6cc062e4c8afac94a59f207e1ed5db8c","schema_version":"1.0","event_id":"sha256:16e72a4680fdc864755dca584a08734f6cc062e4c8afac94a59f207e1ed5db8c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/bundle.json","state_url":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/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-23T19:06:16Z","links":{"resolver":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB","bundle":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/bundle.json","state":"https://pith.science/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PFLFXC3ZOQBMG7D2ABAYTKBXIB/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:PFLFXC3ZOQBMG7D2ABAYTKBXIB","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":"6a638adb7994b65d1f1eafdb1e81b8001f14689d89582852afdcb1a22fbf2949","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2007-05-04T03:01:42Z","title_canon_sha256":"4b809f61184ef80fcd5615c443a9318446bb7366c056f191393d863c6df1c4ff"},"schema_version":"1.0","source":{"id":"0705.0561","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0705.0561","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"arxiv_version","alias_value":"0705.0561v2","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0705.0561","created_at":"2026-05-18T04:22:30Z"},{"alias_kind":"pith_short_12","alias_value":"PFLFXC3ZOQBM","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_16","alias_value":"PFLFXC3ZOQBMG7D2","created_at":"2026-05-18T12:25:55Z"},{"alias_kind":"pith_short_8","alias_value":"PFLFXC3Z","created_at":"2026-05-18T12:25:55Z"}],"graph_snapshots":[{"event_id":"sha256:16e72a4680fdc864755dca584a08734f6cc062e4c8afac94a59f207e1ed5db8c","target":"graph","created_at":"2026-05-18T04:22:30Z","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":"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","authors_text":"Jing-Chao Chen","cross_cats":["cs.CC"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2007-05-04T03:01:42Z","title":"Iterative Rounding for the Closest String Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0705.0561","kind":"arxiv","version":2},"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:c8a815788cb6e64b5abcd1ae34c653c8843860082c1cd1c6240290813dc9d801","target":"record","created_at":"2026-05-18T04:22:30Z","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":"6a638adb7994b65d1f1eafdb1e81b8001f14689d89582852afdcb1a22fbf2949","cross_cats_sorted":["cs.CC"],"license":"http://creativecommons.org/licenses/by-nc-sa/3.0/","primary_cat":"cs.DS","submitted_at":"2007-05-04T03:01:42Z","title_canon_sha256":"4b809f61184ef80fcd5615c443a9318446bb7366c056f191393d863c6df1c4ff"},"schema_version":"1.0","source":{"id":"0705.0561","kind":"arxiv","version":2}},"canonical_sha256":"79565b8b797402c37c7a004189a83740526e7d81fb2bce945056fa0f3585f244","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"79565b8b797402c37c7a004189a83740526e7d81fb2bce945056fa0f3585f244","first_computed_at":"2026-05-18T04:22:30.033355Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:22:30.033355Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"v2Zpex8TZxlfVo6y2+hCW4vOT7qHl1yxz1pl0gyj6Kyfgk4MyAILKiD+NZ6NYw1tHs4GLqDj5r6l/0zmF/EOCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:22:30.033842Z","signed_message":"canonical_sha256_bytes"},"source_id":"0705.0561","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c8a815788cb6e64b5abcd1ae34c653c8843860082c1cd1c6240290813dc9d801","sha256:16e72a4680fdc864755dca584a08734f6cc062e4c8afac94a59f207e1ed5db8c"],"state_sha256":"7c6cd53eeba70bcdf74c8a0f6023dc90c139b310316ed0831d119131ee57970f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iA/q+VjlYdItpP2Yr4ghQr3A62Vv+ID4aMyOxBdOrCrZPFoCPu2+4naG0WnW0lf2QQ0FDg1SxVY73O3CJBOvDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T19:06:16.637472Z","bundle_sha256":"4ab98fdd502a0ea22c5bec69843b1e020a0214693959480fdb9aec02b808583c"}}