{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:NEDCA3RNGI7TBAA7LC6KECX4CL","short_pith_number":"pith:NEDCA3RN","schema_version":"1.0","canonical_sha256":"6906206e2d323f30801f58bca20afc12c2b429e705ff59065af678f261712a34","source":{"kind":"arxiv","id":"1210.0729","version":2},"attestation_state":"computed","paper":{"title":"An Algorithm to Solve Polyhedral Convex Set Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas L\\\"ohne, Carola Schrage","submitted_at":"2012-10-02T10:32:51Z","abstract_excerpt":"An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain satisfying two conditions: the attainment of the infimum and minimality with respect to a set relation. In the first phase of the algorithm, a linear vector optimization problem, called the vectorial relaxation, is solved. The resulting pre-solution yields the attainment of the infimum but, in general, not minimality. In the second phase of the algorithm, minimal"},"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.0729","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T10:32:51Z","cross_cats_sorted":[],"title_canon_sha256":"8a2d159b57f0a42d105dda6b9635b023fc8ad2a77ac7f9ebfa0e3d0d96541873","abstract_canon_sha256":"af4374f26438ffdcb50a1f74035d67a88d615a8e29c25ea63e08bdba9e276088"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:50:58.866883Z","signature_b64":"q4XvQuhxCjIK1GdTBXOKEwK8kiiWNCoJSFi3Ty2m1HxXsXlHjN/zKQD/jXaGpRdQCrj+pbu6BYVwGzhOX67tAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6906206e2d323f30801f58bca20afc12c2b429e705ff59065af678f261712a34","last_reissued_at":"2026-05-18T02:50:58.866284Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:50:58.866284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Algorithm to Solve Polyhedral Convex Set Optimization Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Andreas L\\\"ohne, Carola Schrage","submitted_at":"2012-10-02T10:32:51Z","abstract_excerpt":"An algorithm which computes a solution of a set optimization problem is provided. The graph of the objective map is assumed to be given by finitely many linear inequalities. A solution is understood to be a set of points in the domain satisfying two conditions: the attainment of the infimum and minimality with respect to a set relation. In the first phase of the algorithm, a linear vector optimization problem, called the vectorial relaxation, is solved. The resulting pre-solution yields the attainment of the infimum but, in general, not minimality. In the second phase of the algorithm, minimal"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0729","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":"1210.0729","created_at":"2026-05-18T02:50:58.866393+00:00"},{"alias_kind":"arxiv_version","alias_value":"1210.0729v2","created_at":"2026-05-18T02:50:58.866393+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0729","created_at":"2026-05-18T02:50:58.866393+00:00"},{"alias_kind":"pith_short_12","alias_value":"NEDCA3RNGI7T","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_16","alias_value":"NEDCA3RNGI7TBAA7","created_at":"2026-05-18T12:27:16.716162+00:00"},{"alias_kind":"pith_short_8","alias_value":"NEDCA3RN","created_at":"2026-05-18T12:27:16.716162+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/NEDCA3RNGI7TBAA7LC6KECX4CL","json":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL.json","graph_json":"https://pith.science/api/pith-number/NEDCA3RNGI7TBAA7LC6KECX4CL/graph.json","events_json":"https://pith.science/api/pith-number/NEDCA3RNGI7TBAA7LC6KECX4CL/events.json","paper":"https://pith.science/paper/NEDCA3RN"},"agent_actions":{"view_html":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL","download_json":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL.json","view_paper":"https://pith.science/paper/NEDCA3RN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1210.0729&json=true","fetch_graph":"https://pith.science/api/pith-number/NEDCA3RNGI7TBAA7LC6KECX4CL/graph.json","fetch_events":"https://pith.science/api/pith-number/NEDCA3RNGI7TBAA7LC6KECX4CL/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/action/timestamp_anchor","attest_storage":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/action/storage_attestation","attest_author":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/action/author_attestation","sign_citation":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/action/citation_signature","submit_replication":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/action/replication_record"}},"created_at":"2026-05-18T02:50:58.866393+00:00","updated_at":"2026-05-18T02:50:58.866393+00:00"}