{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:2UETFY27BNDIBHT4R3MDL3U7IW","short_pith_number":"pith:2UETFY27","canonical_record":{"source":{"id":"1706.06847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T11:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"12c780750338c77685eb36e193eb7661322b3ad7240fbf54d583f49b7d1040ad","abstract_canon_sha256":"2e242585effab588312db769ca00140bde23365c025de663c236bd18936f2965"},"schema_version":"1.0"},"canonical_sha256":"d50932e35f0b46809e7c8ed835ee9f4587341fae905e3328e12d6edaf51d46cf","source":{"kind":"arxiv","id":"1706.06847","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06847","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06847v1","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06847","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"2UETFY27BNDI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2UETFY27BNDIBHT4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2UETFY27","created_at":"2026-05-18T12:30:55Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:2UETFY27BNDIBHT4R3MDL3U7IW","target":"record","payload":{"canonical_record":{"source":{"id":"1706.06847","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T11:58:06Z","cross_cats_sorted":[],"title_canon_sha256":"12c780750338c77685eb36e193eb7661322b3ad7240fbf54d583f49b7d1040ad","abstract_canon_sha256":"2e242585effab588312db769ca00140bde23365c025de663c236bd18936f2965"},"schema_version":"1.0"},"canonical_sha256":"d50932e35f0b46809e7c8ed835ee9f4587341fae905e3328e12d6edaf51d46cf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:41:56.727853Z","signature_b64":"pM6ISzMaLtN50Cp3/asgKpLDKzUZ/0IDHHhAXxJk5IR6k9UGx/ff7aODHc6/yrMtH7lZGVIuIYyVyaH3CwKaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d50932e35f0b46809e7c8ed835ee9f4587341fae905e3328e12d6edaf51d46cf","last_reissued_at":"2026-05-18T00:41:56.727384Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:41:56.727384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1706.06847","source_version":1,"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-18T00:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kgJFLkSWTzyOgbbCU2m2zJureKFMw1JVZMCGNFNpUMMNyzql3r5snI6EnyU50o9RC+aejU+mwP9am8NUgaV5Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:01:04.822275Z"},"content_sha256":"33209620806dfd6dbb5e45502970f020e2677ef83cf988395208ecd41b175602","schema_version":"1.0","event_id":"sha256:33209620806dfd6dbb5e45502970f020e2677ef83cf988395208ecd41b175602"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:2UETFY27BNDIBHT4R3MDL3U7IW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Discrete Approximation of Two-Stage Stochastic and Distributionally Robust Linear Complementarity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hailin Sun, Huifu Xu, Xiaojun Chen","submitted_at":"2017-06-21T11:58:06Z","abstract_excerpt":"In this paper, we propose a discretization scheme for the two-stage stochastic linear complementarity problem (LCP) where the underlying random data are continuously distributed. Under some moderate conditions, we derive qualitative and quantitative convergence for the solutions obtained from solving the discretized two-stage stochastic LCP (SLCP). We explain how the discretized two-stage SLCP may be solved by the well-known progressive hedging method (PHM). Moreover, we extend the discussion by considering a two-stage distributionally robust LCP (DRLCP) with moment constraints and proposing a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06847","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"},"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-18T00:41:56Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZCQvO/y+kFu7IuyBGN1dJSDXO0cjy0dHEQh00aXdE1+IQDXUl0DfUIxJOjYWF+dHNc1blKAU1HHmJA9KzoPyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T05:01:04.822634Z"},"content_sha256":"a0dbccdb1447d60e947da9652af8f5ebf4135443d3025380168dee79200b9c5f","schema_version":"1.0","event_id":"sha256:a0dbccdb1447d60e947da9652af8f5ebf4135443d3025380168dee79200b9c5f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UETFY27BNDIBHT4R3MDL3U7IW/bundle.json","state_url":"https://pith.science/pith/2UETFY27BNDIBHT4R3MDL3U7IW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UETFY27BNDIBHT4R3MDL3U7IW/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-05-30T05:01:04Z","links":{"resolver":"https://pith.science/pith/2UETFY27BNDIBHT4R3MDL3U7IW","bundle":"https://pith.science/pith/2UETFY27BNDIBHT4R3MDL3U7IW/bundle.json","state":"https://pith.science/pith/2UETFY27BNDIBHT4R3MDL3U7IW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UETFY27BNDIBHT4R3MDL3U7IW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:2UETFY27BNDIBHT4R3MDL3U7IW","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":"2e242585effab588312db769ca00140bde23365c025de663c236bd18936f2965","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T11:58:06Z","title_canon_sha256":"12c780750338c77685eb36e193eb7661322b3ad7240fbf54d583f49b7d1040ad"},"schema_version":"1.0","source":{"id":"1706.06847","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1706.06847","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"arxiv_version","alias_value":"1706.06847v1","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1706.06847","created_at":"2026-05-18T00:41:56Z"},{"alias_kind":"pith_short_12","alias_value":"2UETFY27BNDI","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_16","alias_value":"2UETFY27BNDIBHT4","created_at":"2026-05-18T12:30:55Z"},{"alias_kind":"pith_short_8","alias_value":"2UETFY27","created_at":"2026-05-18T12:30:55Z"}],"graph_snapshots":[{"event_id":"sha256:a0dbccdb1447d60e947da9652af8f5ebf4135443d3025380168dee79200b9c5f","target":"graph","created_at":"2026-05-18T00:41:56Z","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":"In this paper, we propose a discretization scheme for the two-stage stochastic linear complementarity problem (LCP) where the underlying random data are continuously distributed. Under some moderate conditions, we derive qualitative and quantitative convergence for the solutions obtained from solving the discretized two-stage stochastic LCP (SLCP). We explain how the discretized two-stage SLCP may be solved by the well-known progressive hedging method (PHM). Moreover, we extend the discussion by considering a two-stage distributionally robust LCP (DRLCP) with moment constraints and proposing a","authors_text":"Hailin Sun, Huifu Xu, Xiaojun Chen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T11:58:06Z","title":"Discrete Approximation of Two-Stage Stochastic and Distributionally Robust Linear Complementarity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1706.06847","kind":"arxiv","version":1},"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:33209620806dfd6dbb5e45502970f020e2677ef83cf988395208ecd41b175602","target":"record","created_at":"2026-05-18T00:41:56Z","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":"2e242585effab588312db769ca00140bde23365c025de663c236bd18936f2965","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2017-06-21T11:58:06Z","title_canon_sha256":"12c780750338c77685eb36e193eb7661322b3ad7240fbf54d583f49b7d1040ad"},"schema_version":"1.0","source":{"id":"1706.06847","kind":"arxiv","version":1}},"canonical_sha256":"d50932e35f0b46809e7c8ed835ee9f4587341fae905e3328e12d6edaf51d46cf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d50932e35f0b46809e7c8ed835ee9f4587341fae905e3328e12d6edaf51d46cf","first_computed_at":"2026-05-18T00:41:56.727384Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:41:56.727384Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"pM6ISzMaLtN50Cp3/asgKpLDKzUZ/0IDHHhAXxJk5IR6k9UGx/ff7aODHc6/yrMtH7lZGVIuIYyVyaH3CwKaAw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:41:56.727853Z","signed_message":"canonical_sha256_bytes"},"source_id":"1706.06847","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:33209620806dfd6dbb5e45502970f020e2677ef83cf988395208ecd41b175602","sha256:a0dbccdb1447d60e947da9652af8f5ebf4135443d3025380168dee79200b9c5f"],"state_sha256":"750501af4b02ddf6c62f813cbc7b6ba74651e47ce7ed2bd8f64f212921a103e7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fUSjiadHOf8hdjhs1qiCh+YE3LNjVAXY5ElozKPWYKCwMclLjztuOXsZzzNMPBB/yFHnmemAh6AU1VcdQcWVCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T05:01:04.824603Z","bundle_sha256":"fd5eae75cac0f921e3a90a99517dfff3c78f64cac7124e9f57d906e27b715af7"}}