{"artifact":{"id":"art-hist-phase33-subset-sum-near-optimal-preprint","dedupe_key":"06081d3991e1617397d50266b10278b21ee9bd357a8a08d1678287eb20164db9","canonical_url":"https://arxiv.org/abs/2610.12953","evidence_locator":"","artifact_type":"original_publication","title":"Chen Mao and Zhang submit near-optimal subset-sum and integer-programming preprint","summary":"","creator_entities":[],"released_at":"2026-10-09T00:00:00.000Z","content_hash":null,"metadata":[],"created_at":"2026-10-19T06:04:16.013Z","updated_at":"2026-10-19T06:04:16.013Z"},"sources":[{"id":"src-hist-phase33-subset-sum-near-optimal-preprint","dedupe_key":"16982d7d2ca48dd1acc89bb72350801b20af4abba668cfda9d8b91f85cc77855","name":"","publisher":"Lin Chen Yuchen Mao and Guochuan Zhang / arXiv","url":"https://arxiv.org/abs/2610.12953","evidence_locator":"","source_type":"original_author_preprint","primary_or_secondary":"","retrieved_at":"2026-10-18T11:41:00.000Z","published_at":"2026-10-09T00:00:00.000Z","author":null,"metadata":[],"created_at":"2026-10-19T06:04:16.009Z","updated_at":"2026-10-19T06:04:16.009Z"}]}