{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:GTGN6LPBA3AA4N66RNFAPAVGLF","short_pith_number":"pith:GTGN6LPB","canonical_record":{"source":{"id":"1802.02941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-08T16:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"75cbf3e9838ae6aadadf956109fdc3f29d6395037d74850879dd68bba1732172","abstract_canon_sha256":"cf7a66255dbf278a63202e366b0e3040033bc361861cc5c757d6af8c91e61015"},"schema_version":"1.0"},"canonical_sha256":"34ccdf2de106c00e37de8b4a0782a6596e8ac6c373a6bcc63f5ee87e64c1e8dd","source":{"kind":"arxiv","id":"1802.02941","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02941","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02941v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02941","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"GTGN6LPBA3AA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GTGN6LPBA3AA4N66","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GTGN6LPB","created_at":"2026-05-18T12:32:25Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:GTGN6LPBA3AA4N66RNFAPAVGLF","target":"record","payload":{"canonical_record":{"source":{"id":"1802.02941","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-08T16:04:06Z","cross_cats_sorted":[],"title_canon_sha256":"75cbf3e9838ae6aadadf956109fdc3f29d6395037d74850879dd68bba1732172","abstract_canon_sha256":"cf7a66255dbf278a63202e366b0e3040033bc361861cc5c757d6af8c91e61015"},"schema_version":"1.0"},"canonical_sha256":"34ccdf2de106c00e37de8b4a0782a6596e8ac6c373a6bcc63f5ee87e64c1e8dd","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:24:02.748109Z","signature_b64":"V+hTiuCqs+9JhPXooiJbgBBNN/cI70KW/DXTLh6mAkznSe3V+Z61Njz4YcWWeEhzarYWwEYxsKTc3ZT/eV8WBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"34ccdf2de106c00e37de8b4a0782a6596e8ac6c373a6bcc63f5ee87e64c1e8dd","last_reissued_at":"2026-05-18T00:24:02.747531Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:24:02.747531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1802.02941","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:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8sCIGDRe2iA21hThK2cHbwGbncrJUgYx0AHzkx69bs8IO1XJz2SBcsGrGHr9Fb6LKuBmr06m+ZvS0Cc4HEpGCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:58:55.229599Z"},"content_sha256":"732a291c8c7911f061b644d10d0566e86967c29fa5b35b93b1227828acc3f490","schema_version":"1.0","event_id":"sha256:732a291c8c7911f061b644d10d0566e86967c29fa5b35b93b1227828acc3f490"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:GTGN6LPBA3AA4N66RNFAPAVGLF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Solving Linear Programs with Complementarity Constraints using Branch-and-Cut","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Bin Yu, John E. Mitchell, Jong-Shi Pang","submitted_at":"2018-02-08T16:04:06Z","abstract_excerpt":"A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a modeling paradigm for a broad collection of problems, including bilevel programs, Stackelberg games, inverse quadratic programs, and problems involving equilibrium constraints. The presence of the complementarity constraints results in a nonconvex optimization problem. We develop a branch-and-cut algorithm to find a global optimum for this class of optimization pr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02941","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:24:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UcEmgBBg02mKG/F+Q4L1PoipXCN67yhZN+tdbvZpn/O0KYe4xavAI5hPq9ZeH1k/0tBpkbPBvUJHSy2XsY3kCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T10:58:55.229957Z"},"content_sha256":"75cb7c59ed7a85ddba5a9fc1daeff4a61101b13daca11b660ca84bed4659c5b1","schema_version":"1.0","event_id":"sha256:75cb7c59ed7a85ddba5a9fc1daeff4a61101b13daca11b660ca84bed4659c5b1"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/GTGN6LPBA3AA4N66RNFAPAVGLF/bundle.json","state_url":"https://pith.science/pith/GTGN6LPBA3AA4N66RNFAPAVGLF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/GTGN6LPBA3AA4N66RNFAPAVGLF/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-11T10:58:55Z","links":{"resolver":"https://pith.science/pith/GTGN6LPBA3AA4N66RNFAPAVGLF","bundle":"https://pith.science/pith/GTGN6LPBA3AA4N66RNFAPAVGLF/bundle.json","state":"https://pith.science/pith/GTGN6LPBA3AA4N66RNFAPAVGLF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/GTGN6LPBA3AA4N66RNFAPAVGLF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:GTGN6LPBA3AA4N66RNFAPAVGLF","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":"cf7a66255dbf278a63202e366b0e3040033bc361861cc5c757d6af8c91e61015","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-08T16:04:06Z","title_canon_sha256":"75cbf3e9838ae6aadadf956109fdc3f29d6395037d74850879dd68bba1732172"},"schema_version":"1.0","source":{"id":"1802.02941","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1802.02941","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"arxiv_version","alias_value":"1802.02941v1","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.02941","created_at":"2026-05-18T00:24:02Z"},{"alias_kind":"pith_short_12","alias_value":"GTGN6LPBA3AA","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_16","alias_value":"GTGN6LPBA3AA4N66","created_at":"2026-05-18T12:32:25Z"},{"alias_kind":"pith_short_8","alias_value":"GTGN6LPB","created_at":"2026-05-18T12:32:25Z"}],"graph_snapshots":[{"event_id":"sha256:75cb7c59ed7a85ddba5a9fc1daeff4a61101b13daca11b660ca84bed4659c5b1","target":"graph","created_at":"2026-05-18T00:24:02Z","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":"A linear program with linear complementarity constraints (LPCC) requires the minimization of a linear objective over a set of linear constraints together with additional linear complementarity constraints. This class has emerged as a modeling paradigm for a broad collection of problems, including bilevel programs, Stackelberg games, inverse quadratic programs, and problems involving equilibrium constraints. The presence of the complementarity constraints results in a nonconvex optimization problem. We develop a branch-and-cut algorithm to find a global optimum for this class of optimization pr","authors_text":"Bin Yu, John E. Mitchell, Jong-Shi Pang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-08T16:04:06Z","title":"Solving Linear Programs with Complementarity Constraints using Branch-and-Cut"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.02941","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:732a291c8c7911f061b644d10d0566e86967c29fa5b35b93b1227828acc3f490","target":"record","created_at":"2026-05-18T00:24:02Z","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":"cf7a66255dbf278a63202e366b0e3040033bc361861cc5c757d6af8c91e61015","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-02-08T16:04:06Z","title_canon_sha256":"75cbf3e9838ae6aadadf956109fdc3f29d6395037d74850879dd68bba1732172"},"schema_version":"1.0","source":{"id":"1802.02941","kind":"arxiv","version":1}},"canonical_sha256":"34ccdf2de106c00e37de8b4a0782a6596e8ac6c373a6bcc63f5ee87e64c1e8dd","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"34ccdf2de106c00e37de8b4a0782a6596e8ac6c373a6bcc63f5ee87e64c1e8dd","first_computed_at":"2026-05-18T00:24:02.747531Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:24:02.747531Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"V+hTiuCqs+9JhPXooiJbgBBNN/cI70KW/DXTLh6mAkznSe3V+Z61Njz4YcWWeEhzarYWwEYxsKTc3ZT/eV8WBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:24:02.748109Z","signed_message":"canonical_sha256_bytes"},"source_id":"1802.02941","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:732a291c8c7911f061b644d10d0566e86967c29fa5b35b93b1227828acc3f490","sha256:75cb7c59ed7a85ddba5a9fc1daeff4a61101b13daca11b660ca84bed4659c5b1"],"state_sha256":"e5df2d4e5cf53a216cb0a837bd09d84765a3dcf6b5a7dfa7f957e5d73909df6b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eRfsrmXRw7q68mCaqig+aELhzQikHPWQuH5Q3EslgvL6rVQruGOrDYBFqqF+mYunCGMSOYG9Z4MfqAlMMa26Cg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T10:58:55.232088Z","bundle_sha256":"5c38aaa53ffe0e041c81b20d390346bf01e894e4624bbac34251bf73909d684f"}}