{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:GMF3ZSFT33HJCRHBH6X7SUWKLK","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":"917d3ae4ec286b586d0b9100cb2494ef57f40bcd11b3bf2cbffd0a863efaa6a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-05-02T10:46:03Z","title_canon_sha256":"959bb3bd9121716fa7aa9e1ab3267983511492856066c520005e50411e42c531"},"schema_version":"1.0","source":{"id":"1605.01031","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01031","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01031v2","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01031","created_at":"2026-05-18T00:40:51Z"},{"alias_kind":"pith_short_12","alias_value":"GMF3ZSFT33HJ","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_16","alias_value":"GMF3ZSFT33HJCRHB","created_at":"2026-05-18T12:30:19Z"},{"alias_kind":"pith_short_8","alias_value":"GMF3ZSFT","created_at":"2026-05-18T12:30:19Z"}],"graph_snapshots":[{"event_id":"sha256:040144aeaf3bc2aff4dbab6e1aca64fd1f4edfb189eed831020c4366d7e083df","target":"graph","created_at":"2026-05-18T00:40:51Z","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":"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 ","authors_text":"Ailong Cai, Bin Yan, Linyuan Wang, Wenkun Zhang","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-05-02T10:46:03Z","title":"Equivalence of L0 and L1 Minimizations in Sudoku Problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01031","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:1cca5636c5aeb606ad5fc08a869b740316b6c534b0f995d2d847aa23f04e14aa","target":"record","created_at":"2026-05-18T00:40:51Z","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":"917d3ae4ec286b586d0b9100cb2494ef57f40bcd11b3bf2cbffd0a863efaa6a8","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"math.OC","submitted_at":"2016-05-02T10:46:03Z","title_canon_sha256":"959bb3bd9121716fa7aa9e1ab3267983511492856066c520005e50411e42c531"},"schema_version":"1.0","source":{"id":"1605.01031","kind":"arxiv","version":2}},"canonical_sha256":"330bbcc8b3dece9144e13faff952ca5a9d6d4d8a2ca9302f176823ead632e68e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"330bbcc8b3dece9144e13faff952ca5a9d6d4d8a2ca9302f176823ead632e68e","first_computed_at":"2026-05-18T00:40:51.739219Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:40:51.739219Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"MkrN32ILaQLOBcwZqbjtyfju2Cu47Z+/g+N4aAQitG4dV03rUWIcRTaGtMNupBGcAmYA3KbotkFnG9pyrSgbBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:40:51.739947Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01031","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1cca5636c5aeb606ad5fc08a869b740316b6c534b0f995d2d847aa23f04e14aa","sha256:040144aeaf3bc2aff4dbab6e1aca64fd1f4edfb189eed831020c4366d7e083df"],"state_sha256":"2575255bb79caf92347ac6637df7e17dd89322a5621bbe68c34120bb9453cc32"}