{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:DBEFSJYP5FCCHFV3JLTD7ZJAD3","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":"7de0f62a7ded736b190775dcc950c614e5a83bc474d2f4c062da3a4e65f828c6","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-17T09:01:07Z","title_canon_sha256":"8db3a0b53a55dd180f9575a6f13654e2acbbe1531225613dfdb850225094197e"},"schema_version":"1.0","source":{"id":"1306.3778","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1306.3778","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"arxiv_version","alias_value":"1306.3778v2","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1306.3778","created_at":"2026-05-18T01:36:48Z"},{"alias_kind":"pith_short_12","alias_value":"DBEFSJYP5FCC","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_16","alias_value":"DBEFSJYP5FCCHFV3","created_at":"2026-05-18T12:27:40Z"},{"alias_kind":"pith_short_8","alias_value":"DBEFSJYP","created_at":"2026-05-18T12:27:40Z"}],"graph_snapshots":[{"event_id":"sha256:e7f19006c3af119d5d9be7ab784146be8954bd73fa9aa0139e1517896a38108a","target":"graph","created_at":"2026-05-18T01:36:48Z","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":"In this paper we look at a particular problem related to under-determined linear systems of equations with sparse solutions. $\\ell_1$-minimization is a fairly successful polynomial technique that can in certain statistical scenarios find sparse enough solutions of such systems. Barriers of $\\ell_1$ performance are typically referred to as its thresholds. Depending if one is interested in a typical or worst case behavior one then distinguishes between the \\emph{weak} thresholds that relate to a typical behavior on one side and the \\emph{sectional} and \\emph{strong} thresholds that relate to the","authors_text":"Mihailo Stojnic","cross_cats":["math.IT","math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-17T09:01:07Z","title":"Upper-bounding $\\ell_1$-optimization sectional thresholds"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1306.3778","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:720388da182d71c989f4832225bbf242d5feeecc7ae99c268d5e0748835df7ff","target":"record","created_at":"2026-05-18T01:36:48Z","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":"7de0f62a7ded736b190775dcc950c614e5a83bc474d2f4c062da3a4e65f828c6","cross_cats_sorted":["math.IT","math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-06-17T09:01:07Z","title_canon_sha256":"8db3a0b53a55dd180f9575a6f13654e2acbbe1531225613dfdb850225094197e"},"schema_version":"1.0","source":{"id":"1306.3778","kind":"arxiv","version":2}},"canonical_sha256":"184859270fe9442396bb4ae63fe5201edf4d4149e3ec133a61a4ceae4abebfdb","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"184859270fe9442396bb4ae63fe5201edf4d4149e3ec133a61a4ceae4abebfdb","first_computed_at":"2026-05-18T01:36:48.484349Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:36:48.484349Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"taAKHE6TH4eT3aj63jfgUu4CyUeN6sdeAIeDzaDmiwEuEjyKKngmMCd+lRodcOEirD0Tx7Dv+rvQ6BbSk/8+Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:36:48.485019Z","signed_message":"canonical_sha256_bytes"},"source_id":"1306.3778","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:720388da182d71c989f4832225bbf242d5feeecc7ae99c268d5e0748835df7ff","sha256:e7f19006c3af119d5d9be7ab784146be8954bd73fa9aa0139e1517896a38108a"],"state_sha256":"3d6fb9902f8624a299563979c326413aceb4ce238b43cba80801774aa2b7d33a"}