{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2023:LPH3MCQMMPTSX5QALLRFNB2PEI","short_pith_number":"pith:LPH3MCQM","canonical_record":{"source":{"id":"2310.11403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-17T17:11:55Z","cross_cats_sorted":[],"title_canon_sha256":"cbbe4eee364c12d595c3b21dc72b1255db5c860ece81198af44a3ef4a5fa80bf","abstract_canon_sha256":"2ea243d7a280dd78e53f8e04e522ccf2d5d275927c094fdd76d045504f5a1e9d"},"schema_version":"1.0"},"canonical_sha256":"5bcfb60a0c63e72bf6005ae256874f220d506b886a801e96e3e779adcba86d80","source":{"kind":"arxiv","id":"2310.11403","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11403","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11403v2","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11403","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"LPH3MCQMMPTS","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_16","alias_value":"LPH3MCQMMPTSX5QA","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_8","alias_value":"LPH3MCQM","created_at":"2026-07-05T09:46:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2023:LPH3MCQMMPTSX5QALLRFNB2PEI","target":"record","payload":{"canonical_record":{"source":{"id":"2310.11403","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-17T17:11:55Z","cross_cats_sorted":[],"title_canon_sha256":"cbbe4eee364c12d595c3b21dc72b1255db5c860ece81198af44a3ef4a5fa80bf","abstract_canon_sha256":"2ea243d7a280dd78e53f8e04e522ccf2d5d275927c094fdd76d045504f5a1e9d"},"schema_version":"1.0"},"canonical_sha256":"5bcfb60a0c63e72bf6005ae256874f220d506b886a801e96e3e779adcba86d80","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:46:43.177385Z","signature_b64":"EIoMMOEtz8cOza/hkAQLL4Y1aK47fOS46fb9Gksg+/jlykAlD26gf4XDP6L7aHr+A+FmOdlR1vCC+0N23jgRBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5bcfb60a0c63e72bf6005ae256874f220d506b886a801e96e3e779adcba86d80","last_reissued_at":"2026-07-05T09:46:43.176844Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:46:43.176844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2310.11403","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-07-05T09:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UvoeRqOArNySeSIkOC4MhgOfsRiDC2ERSjvjqYniMtZuvcQAnm5vIn1M7UsE8n6A1wT7JPbSzSi7CI97p78VAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:29:00.479127Z"},"content_sha256":"d26becc78ff40fae2e08ae4db0c21e55e86aa5896848a3e011bdc28722e537bd","schema_version":"1.0","event_id":"sha256:d26becc78ff40fae2e08ae4db0c21e55e86aa5896848a3e011bdc28722e537bd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2023:LPH3MCQMMPTSX5QALLRFNB2PEI","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximations of unbounded convex projections and unbounded convex sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Birgit Rudloff, Gabriela Kov\\'a\\v{c}ov\\'a","submitted_at":"2023-10-17T17:11:55Z","abstract_excerpt":"We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex sets by polyhedrons. The existing literature on convex projections provides methods for bounded convex sets only, in this paper we propose a method that can handle both bounded and unbounded problems. The algorithms we propose build on the ideas of inner and outer approximation. In particular, we adapt the recently proposed methods for solving unbounded con"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11403","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2310.11403/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"},"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-07-05T09:46:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3rf2hacnnBLrhqO99P1WS6jg1xMxj7lzXpwhyV6YlY+BvqxyCI++YHFc+oJWplKF2BqlgSH1n5SaG+j8uUMPBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-06T23:29:00.479516Z"},"content_sha256":"d90cb42dc668512fa9f79d65f8fba84fe9a52dbc5b61aceb82789519a438109e","schema_version":"1.0","event_id":"sha256:d90cb42dc668512fa9f79d65f8fba84fe9a52dbc5b61aceb82789519a438109e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LPH3MCQMMPTSX5QALLRFNB2PEI/bundle.json","state_url":"https://pith.science/pith/LPH3MCQMMPTSX5QALLRFNB2PEI/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LPH3MCQMMPTSX5QALLRFNB2PEI/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-07-06T23:29:00Z","links":{"resolver":"https://pith.science/pith/LPH3MCQMMPTSX5QALLRFNB2PEI","bundle":"https://pith.science/pith/LPH3MCQMMPTSX5QALLRFNB2PEI/bundle.json","state":"https://pith.science/pith/LPH3MCQMMPTSX5QALLRFNB2PEI/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LPH3MCQMMPTSX5QALLRFNB2PEI/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2023:LPH3MCQMMPTSX5QALLRFNB2PEI","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":"2ea243d7a280dd78e53f8e04e522ccf2d5d275927c094fdd76d045504f5a1e9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-17T17:11:55Z","title_canon_sha256":"cbbe4eee364c12d595c3b21dc72b1255db5c860ece81198af44a3ef4a5fa80bf"},"schema_version":"1.0","source":{"id":"2310.11403","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2310.11403","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"arxiv_version","alias_value":"2310.11403v2","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2310.11403","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_12","alias_value":"LPH3MCQMMPTS","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_16","alias_value":"LPH3MCQMMPTSX5QA","created_at":"2026-07-05T09:46:43Z"},{"alias_kind":"pith_short_8","alias_value":"LPH3MCQM","created_at":"2026-07-05T09:46:43Z"}],"graph_snapshots":[{"event_id":"sha256:d90cb42dc668512fa9f79d65f8fba84fe9a52dbc5b61aceb82789519a438109e","target":"graph","created_at":"2026-07-05T09:46:43Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2310.11403/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We consider the problem of projecting a convex set onto a subspace, or equivalently formulated, the problem of computing a set obtained by applying a linear mapping to a convex feasible set. This includes the problem of approximating convex sets by polyhedrons. The existing literature on convex projections provides methods for bounded convex sets only, in this paper we propose a method that can handle both bounded and unbounded problems. The algorithms we propose build on the ideas of inner and outer approximation. In particular, we adapt the recently proposed methods for solving unbounded con","authors_text":"Birgit Rudloff, Gabriela Kov\\'a\\v{c}ov\\'a","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-17T17:11:55Z","title":"Approximations of unbounded convex projections and unbounded convex sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2310.11403","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:d26becc78ff40fae2e08ae4db0c21e55e86aa5896848a3e011bdc28722e537bd","target":"record","created_at":"2026-07-05T09:46:43Z","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":"2ea243d7a280dd78e53f8e04e522ccf2d5d275927c094fdd76d045504f5a1e9d","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2023-10-17T17:11:55Z","title_canon_sha256":"cbbe4eee364c12d595c3b21dc72b1255db5c860ece81198af44a3ef4a5fa80bf"},"schema_version":"1.0","source":{"id":"2310.11403","kind":"arxiv","version":2}},"canonical_sha256":"5bcfb60a0c63e72bf6005ae256874f220d506b886a801e96e3e779adcba86d80","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5bcfb60a0c63e72bf6005ae256874f220d506b886a801e96e3e779adcba86d80","first_computed_at":"2026-07-05T09:46:43.176844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:46:43.176844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"EIoMMOEtz8cOza/hkAQLL4Y1aK47fOS46fb9Gksg+/jlykAlD26gf4XDP6L7aHr+A+FmOdlR1vCC+0N23jgRBA==","signature_status":"signed_v1","signed_at":"2026-07-05T09:46:43.177385Z","signed_message":"canonical_sha256_bytes"},"source_id":"2310.11403","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d26becc78ff40fae2e08ae4db0c21e55e86aa5896848a3e011bdc28722e537bd","sha256:d90cb42dc668512fa9f79d65f8fba84fe9a52dbc5b61aceb82789519a438109e"],"state_sha256":"21acb7f46dd9f6956d072767af2c477a4c8f8e900dc4c8ce53b603a6cf650940"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"n4sH2SsxfzYomnDmYYM+Z5yxwmeIC3CsvUF4vw/PMm7N7Uv1CLxj4Mv+X4Q87NDuFYsM2bPhbFgvafcllCgeAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-06T23:29:00.481422Z","bundle_sha256":"cd8d0c91380fc50a7edbbb5faeb3e97de8d3f6e741709bee9ae4ef6ea5abcfee"}}