{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:VTHBOPDJJNAPJLGSVMPWUTQSAT","short_pith_number":"pith:VTHBOPDJ","schema_version":"1.0","canonical_sha256":"acce173c694b40f4acd2ab1f6a4e1204d2051a3bd261252e5d5662d23b6c9bdd","source":{"kind":"arxiv","id":"1210.7507","version":1},"attestation_state":"computed","paper":{"title":"Exact Relaxation for Classes of Minimization Problems with Binary Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Martin Burger, Michael Hinterm\\\"uller, Yiqiu Dong","submitted_at":"2012-10-28T20:37:34Z","abstract_excerpt":"Relying on the co-area formula, an exact relaxation framework for minimizing objectives involving the total variation of a binary valued function (of bounded variation) is presented. The underlying problem class covers many important applications ranging from binary image restoration, segmentation, minimal compliance topology optimization to the optimal design of composite membranes and many more. The relaxation approach turns the binary constraint into a box constraint. It is shown that thresholding a solution of the relaxed problem almost surely yields a solution of the original binary-value"},"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":"1210.7507","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-28T20:37:34Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"1a133e2f19b310d3e96f302839e1fd339c5c28fe014f6feddede34c02ffe91bb","abstract_canon_sha256":"5011ef882340d71d565af4d8ee4c83ad196eeed1d724417b350e19da0488f1c1"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:42:09.734829Z","signature_b64":"PPFLp6Z18d93V7lC0L4XOuVUkt3J1nWMMEst5pIZmIFkEYfpqmPUldQlS3Q/xB6UCrGhrME0dOL61oe02qneBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"acce173c694b40f4acd2ab1f6a4e1204d2051a3bd261252e5d5662d23b6c9bdd","last_reissued_at":"2026-05-18T03:42:09.733983Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:42:09.733983Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Exact Relaxation for Classes of Minimization Problems with Binary Constraints","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"Martin Burger, Michael Hinterm\\\"uller, Yiqiu Dong","submitted_at":"2012-10-28T20:37:34Z","abstract_excerpt":"Relying on the co-area formula, an exact relaxation framework for minimizing objectives involving the total variation of a binary valued function (of bounded variation) is presented. The underlying problem class covers many important applications ranging from binary image restoration, segmentation, minimal compliance topology optimization to the optimal design of composite membranes and many more. The relaxation approach turns the binary constraint into a box constraint. It is shown that thresholding a solution of the relaxed problem almost surely yields a solution of the original binary-value"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.7507","kind":"arxiv","version":1},"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":"1210.7507","created_at":"2026-05-18T03:42:09.734129+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.7507v1","created_at":"2026-05-18T03:42:09.734129+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.7507","created_at":"2026-05-18T03:42:09.734129+00:00"},{"alias_kind":"pith_short_12","alias_value":"VTHBOPDJJNAP","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_16","alias_value":"VTHBOPDJJNAPJLGS","created_at":"2026-05-18T12:27:25.539911+00:00"},{"alias_kind":"pith_short_8","alias_value":"VTHBOPDJ","created_at":"2026-05-18T12:27:25.539911+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/VTHBOPDJJNAPJLGSVMPWUTQSAT","json":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT.json","graph_json":"https://pith.science/api/pith-number/VTHBOPDJJNAPJLGSVMPWUTQSAT/graph.json","events_json":"https://pith.science/api/pith-number/VTHBOPDJJNAPJLGSVMPWUTQSAT/events.json","paper":"https://pith.science/paper/VTHBOPDJ"},"agent_actions":{"view_html":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT","download_json":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT.json","view_paper":"https://pith.science/paper/VTHBOPDJ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.7507&json=true","fetch_graph":"https://pith.science/api/pith-number/VTHBOPDJJNAPJLGSVMPWUTQSAT/graph.json","fetch_events":"https://pith.science/api/pith-number/VTHBOPDJJNAPJLGSVMPWUTQSAT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT/action/storage_attestation","attest_author":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT/action/author_attestation","sign_citation":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT/action/citation_signature","submit_replication":"https://pith.science/pith/VTHBOPDJJNAPJLGSVMPWUTQSAT/action/replication_record"}},"created_at":"2026-05-18T03:42:09.734129+00:00","updated_at":"2026-05-18T03:42:09.734129+00:00"}