{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:GMF3ZSFT33HJCRHBH6X7SUWKLK","short_pith_number":"pith:GMF3ZSFT","schema_version":"1.0","canonical_sha256":"330bbcc8b3dece9144e13faff952ca5a9d6d4d8a2ca9302f176823ead632e68e","source":{"kind":"arxiv","id":"1605.01031","version":2},"attestation_state":"computed","paper":{"title":"Equivalence of L0 and L1 Minimizations in Sudoku Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ailong Cai, Bin Yan, Linyuan Wang, Wenkun Zhang","submitted_at":"2016-05-02T10:46:03Z","abstract_excerpt":"Sudoku puzzles can be formulated and solved as a sparse linear system of equations. This problem is a very useful example for the Compressive Sensing (CS) theoretical study. In this study, the equivalence of Sudoku puzzles L0 and L1 minimizations is analyzed. In particular, 17-clue (smallest number of clues) uniquely completable puzzles with sparse optimization algorithms are studied and divided into two types, namely, type-I and -II puzzles. The solution of L1 minimization for the type-I puzzles is unique, and the sparse optimization algorithms can solve all of them exactly. By contrast, the "},"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":"1605.01031","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-05-02T10:46:03Z","cross_cats_sorted":[],"title_canon_sha256":"959bb3bd9121716fa7aa9e1ab3267983511492856066c520005e50411e42c531","abstract_canon_sha256":"917d3ae4ec286b586d0b9100cb2494ef57f40bcd11b3bf2cbffd0a863efaa6a8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:40:51.739947Z","signature_b64":"MkrN32ILaQLOBcwZqbjtyfju2Cu47Z+/g+N4aAQitG4dV03rUWIcRTaGtMNupBGcAmYA3KbotkFnG9pyrSgbBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"330bbcc8b3dece9144e13faff952ca5a9d6d4d8a2ca9302f176823ead632e68e","last_reissued_at":"2026-05-18T00:40:51.739219Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:40:51.739219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Equivalence of L0 and L1 Minimizations in Sudoku Problem","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Ailong Cai, Bin Yan, Linyuan Wang, Wenkun Zhang","submitted_at":"2016-05-02T10:46:03Z","abstract_excerpt":"Sudoku puzzles can be formulated and solved as a sparse linear system of equations. This problem is a very useful example for the Compressive Sensing (CS) theoretical study. In this study, the equivalence of Sudoku puzzles L0 and L1 minimizations is analyzed. In particular, 17-clue (smallest number of clues) uniquely completable puzzles with sparse optimization algorithms are studied and divided into two types, namely, type-I and -II puzzles. The solution of L1 minimization for the type-I puzzles is unique, and the sparse optimization algorithms can solve all of them exactly. By contrast, the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01031","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":"1605.01031","created_at":"2026-05-18T00:40:51.739336+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01031v2","created_at":"2026-05-18T00:40:51.739336+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01031","created_at":"2026-05-18T00:40:51.739336+00:00"},{"alias_kind":"pith_short_12","alias_value":"GMF3ZSFT33HJ","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_16","alias_value":"GMF3ZSFT33HJCRHB","created_at":"2026-05-18T12:30:19.053100+00:00"},{"alias_kind":"pith_short_8","alias_value":"GMF3ZSFT","created_at":"2026-05-18T12:30:19.053100+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/GMF3ZSFT33HJCRHBH6X7SUWKLK","json":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK.json","graph_json":"https://pith.science/api/pith-number/GMF3ZSFT33HJCRHBH6X7SUWKLK/graph.json","events_json":"https://pith.science/api/pith-number/GMF3ZSFT33HJCRHBH6X7SUWKLK/events.json","paper":"https://pith.science/paper/GMF3ZSFT"},"agent_actions":{"view_html":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK","download_json":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK.json","view_paper":"https://pith.science/paper/GMF3ZSFT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01031&json=true","fetch_graph":"https://pith.science/api/pith-number/GMF3ZSFT33HJCRHBH6X7SUWKLK/graph.json","fetch_events":"https://pith.science/api/pith-number/GMF3ZSFT33HJCRHBH6X7SUWKLK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK/action/storage_attestation","attest_author":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK/action/author_attestation","sign_citation":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK/action/citation_signature","submit_replication":"https://pith.science/pith/GMF3ZSFT33HJCRHBH6X7SUWKLK/action/replication_record"}},"created_at":"2026-05-18T00:40:51.739336+00:00","updated_at":"2026-05-18T00:40:51.739336+00:00"}