{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NEDCA3RNGI7TBAA7LC6KECX4CL","short_pith_number":"pith:NEDCA3RN","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"},"canonical_sha256":"6906206e2d323f30801f58bca20afc12c2b429e705ff59065af678f261712a34","source":{"kind":"arxiv","id":"1210.0729","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0729","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0729v2","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0729","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"NEDCA3RNGI7T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NEDCA3RNGI7TBAA7","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NEDCA3RN","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NEDCA3RNGI7TBAA7LC6KECX4CL","target":"record","payload":{"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"},"canonical_sha256":"6906206e2d323f30801f58bca20afc12c2b429e705ff59065af678f261712a34","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"},"source_kind":"arxiv","source_id":"1210.0729","source_version":2,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jA/K/eW6QjtUhZSrNYUwTAX1SaaBf0Dl0VhAnqY/is2bd5Xv20dyFYBwk4+dcanL6eD4e7Zd3ARqt4sj/YJiAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:35.462431Z"},"content_sha256":"33f13e176f03cda55583870736ba7bd8ffc41bf26a933d1cf47e771bf8ffb2ba","schema_version":"1.0","event_id":"sha256:33f13e176f03cda55583870736ba7bd8ffc41bf26a933d1cf47e771bf8ffb2ba"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NEDCA3RNGI7TBAA7LC6KECX4CL","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T02:50:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"sP1noJ4iS5D+QDPdPmxzl9T36JsTcJRH+g6JfZdKNlvr2VDfwBiu8vnJVCHwivXs2bAeYgC2+sX2Z6PQfTsgDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T16:11:35.462764Z"},"content_sha256":"856c3135db13a1d2b61dd373d105a281f08366416c6cc0023945c1854660fab7","schema_version":"1.0","event_id":"sha256:856c3135db13a1d2b61dd373d105a281f08366416c6cc0023945c1854660fab7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/bundle.json","state_url":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-27T16:11:35Z","links":{"resolver":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL","bundle":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/bundle.json","state":"https://pith.science/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NEDCA3RNGI7TBAA7LC6KECX4CL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NEDCA3RNGI7TBAA7LC6KECX4CL","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":"af4374f26438ffdcb50a1f74035d67a88d615a8e29c25ea63e08bdba9e276088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T10:32:51Z","title_canon_sha256":"8a2d159b57f0a42d105dda6b9635b023fc8ad2a77ac7f9ebfa0e3d0d96541873"},"schema_version":"1.0","source":{"id":"1210.0729","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1210.0729","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"arxiv_version","alias_value":"1210.0729v2","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1210.0729","created_at":"2026-05-18T02:50:58Z"},{"alias_kind":"pith_short_12","alias_value":"NEDCA3RNGI7T","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NEDCA3RNGI7TBAA7","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NEDCA3RN","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:856c3135db13a1d2b61dd373d105a281f08366416c6cc0023945c1854660fab7","target":"graph","created_at":"2026-05-18T02:50:58Z","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":"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","authors_text":"Andreas L\\\"ohne, Carola Schrage","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T10:32:51Z","title":"An Algorithm to Solve Polyhedral Convex Set Optimization Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1210.0729","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:33f13e176f03cda55583870736ba7bd8ffc41bf26a933d1cf47e771bf8ffb2ba","target":"record","created_at":"2026-05-18T02:50:58Z","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":"af4374f26438ffdcb50a1f74035d67a88d615a8e29c25ea63e08bdba9e276088","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2012-10-02T10:32:51Z","title_canon_sha256":"8a2d159b57f0a42d105dda6b9635b023fc8ad2a77ac7f9ebfa0e3d0d96541873"},"schema_version":"1.0","source":{"id":"1210.0729","kind":"arxiv","version":2}},"canonical_sha256":"6906206e2d323f30801f58bca20afc12c2b429e705ff59065af678f261712a34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6906206e2d323f30801f58bca20afc12c2b429e705ff59065af678f261712a34","first_computed_at":"2026-05-18T02:50:58.866284Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:50:58.866284Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"q4XvQuhxCjIK1GdTBXOKEwK8kiiWNCoJSFi3Ty2m1HxXsXlHjN/zKQD/jXaGpRdQCrj+pbu6BYVwGzhOX67tAA==","signature_status":"signed_v1","signed_at":"2026-05-18T02:50:58.866883Z","signed_message":"canonical_sha256_bytes"},"source_id":"1210.0729","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33f13e176f03cda55583870736ba7bd8ffc41bf26a933d1cf47e771bf8ffb2ba","sha256:856c3135db13a1d2b61dd373d105a281f08366416c6cc0023945c1854660fab7"],"state_sha256":"30c91fa10ad26085bc2cca88fa9d0f8e45ca1afb7a158ebd04ea96bec961f59c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3u83CUZ7QawSDebx6jHNu8c/JkF1lrzMpr39OpES3y6dtK67+13peRg8QW8E4LiRJAsGO46B4Wm+3wv6quxLCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T16:11:35.464574Z","bundle_sha256":"9e29b4aa65991d132d02dfa6ac9ca2d50716ece250fb622d58ddeb3b8755f510"}}