{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:YRID6UEDTSJUGYSTNTKIMJB44T","short_pith_number":"pith:YRID6UED","schema_version":"1.0","canonical_sha256":"c4503f50839c934362536cd486243ce4dd006efb6c6b8b1f191346b9d1c9eedc","source":{"kind":"arxiv","id":"1807.09196","version":3},"attestation_state":"computed","paper":{"title":"A Convex Formulation for Binary Tomography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","eess.SP","math.OC"],"primary_cat":"eess.IV","authors_text":"Ajinkya Kadu, Tristan van Leeuwen","submitted_at":"2018-07-24T15:50:22Z","abstract_excerpt":"Binary tomography is concerned with the recovery of binary images from a few of their projections (i.e., sums of the pixel values along various directions). To reconstruct an image from noisy projection data, one can pose it as a constrained least-squares problem. As the constraints are non-convex, many approaches for solving it rely on either relaxing the constraints or heuristics. In this paper we propose a novel convex formulation, based on the Lagrange dual of the constrained least-squares problem. The resulting problem is a generalized LASSO problem which can be solved efficiently. It is "},"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":"1807.09196","kind":"arxiv","version":3},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.IV","submitted_at":"2018-07-24T15:50:22Z","cross_cats_sorted":["cs.CE","eess.SP","math.OC"],"title_canon_sha256":"2095edff2b7892c8259d27665baf7e27ebaf4d9545ff47ef0f1612614bcae123","abstract_canon_sha256":"8d5bab911bdff267b393f1bf61410d292fbf4552b720dc163d04a5fcda40250a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:59:53.193303Z","signature_b64":"hjMI5kSG7HL6Vs0Ybvg54o97D8K4QBY2hoS6p7IoE7iSRtESsK789PYsSr0AIHFc0noe9/PhoRgy3Z9UjFHeAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4503f50839c934362536cd486243ce4dd006efb6c6b8b1f191346b9d1c9eedc","last_reissued_at":"2026-07-05T01:59:53.192854Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:59:53.192854Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Convex Formulation for Binary Tomography","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CE","eess.SP","math.OC"],"primary_cat":"eess.IV","authors_text":"Ajinkya Kadu, Tristan van Leeuwen","submitted_at":"2018-07-24T15:50:22Z","abstract_excerpt":"Binary tomography is concerned with the recovery of binary images from a few of their projections (i.e., sums of the pixel values along various directions). To reconstruct an image from noisy projection data, one can pose it as a constrained least-squares problem. As the constraints are non-convex, many approaches for solving it rely on either relaxing the constraints or heuristics. In this paper we propose a novel convex formulation, based on the Lagrange dual of the constrained least-squares problem. The resulting problem is a generalized LASSO problem which can be solved efficiently. It is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1807.09196","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1807.09196/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1807.09196","created_at":"2026-07-05T01:59:53.192911+00:00"},{"alias_kind":"arxiv_version","alias_value":"1807.09196v3","created_at":"2026-07-05T01:59:53.192911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1807.09196","created_at":"2026-07-05T01:59:53.192911+00:00"},{"alias_kind":"pith_short_12","alias_value":"YRID6UEDTSJU","created_at":"2026-07-05T01:59:53.192911+00:00"},{"alias_kind":"pith_short_16","alias_value":"YRID6UEDTSJUGYST","created_at":"2026-07-05T01:59:53.192911+00:00"},{"alias_kind":"pith_short_8","alias_value":"YRID6UED","created_at":"2026-07-05T01:59:53.192911+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/YRID6UEDTSJUGYSTNTKIMJB44T","json":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T.json","graph_json":"https://pith.science/api/pith-number/YRID6UEDTSJUGYSTNTKIMJB44T/graph.json","events_json":"https://pith.science/api/pith-number/YRID6UEDTSJUGYSTNTKIMJB44T/events.json","paper":"https://pith.science/paper/YRID6UED"},"agent_actions":{"view_html":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T","download_json":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T.json","view_paper":"https://pith.science/paper/YRID6UED","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1807.09196&json=true","fetch_graph":"https://pith.science/api/pith-number/YRID6UEDTSJUGYSTNTKIMJB44T/graph.json","fetch_events":"https://pith.science/api/pith-number/YRID6UEDTSJUGYSTNTKIMJB44T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T/action/storage_attestation","attest_author":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T/action/author_attestation","sign_citation":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T/action/citation_signature","submit_replication":"https://pith.science/pith/YRID6UEDTSJUGYSTNTKIMJB44T/action/replication_record"}},"created_at":"2026-07-05T01:59:53.192911+00:00","updated_at":"2026-07-05T01:59:53.192911+00:00"}