{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:N6QH76PXJJNTM2VJXDO3NX3V3O","short_pith_number":"pith:N6QH76PX","canonical_record":{"source":{"id":"1212.6958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-31T20:13:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"553d8132973c8b62f0b0e948a0db1d48135eef8ef9200f1cfdd711901be699b4","abstract_canon_sha256":"aec38539afa555b3052619a8be210d552f3bf1fffd11f6dcef34213a465119ba"},"schema_version":"1.0"},"canonical_sha256":"6fa07ff9f74a5b366aa9b8ddb6df75dbb15848a5fc52dc8987fbda06903f6d6a","source":{"kind":"arxiv","id":"1212.6958","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6958","created_at":"2026-05-18T03:37:29Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6958v1","created_at":"2026-05-18T03:37:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6958","created_at":"2026-05-18T03:37:29Z"},{"alias_kind":"pith_short_12","alias_value":"N6QH76PXJJNT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N6QH76PXJJNTM2VJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N6QH76PX","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:N6QH76PXJJNTM2VJXDO3NX3V3O","target":"record","payload":{"canonical_record":{"source":{"id":"1212.6958","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-31T20:13:23Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"553d8132973c8b62f0b0e948a0db1d48135eef8ef9200f1cfdd711901be699b4","abstract_canon_sha256":"aec38539afa555b3052619a8be210d552f3bf1fffd11f6dcef34213a465119ba"},"schema_version":"1.0"},"canonical_sha256":"6fa07ff9f74a5b366aa9b8ddb6df75dbb15848a5fc52dc8987fbda06903f6d6a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:29.406937Z","signature_b64":"zjPOc58gJAu5YIYdoSC9TeVIngruPLNk7KrUZreM23z9YIhITyFRlCYLfXjfsMDbIDbupG1NDpzBtnqnfJkoAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6fa07ff9f74a5b366aa9b8ddb6df75dbb15848a5fc52dc8987fbda06903f6d6a","last_reissued_at":"2026-05-18T03:37:29.406090Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:29.406090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1212.6958","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-18T03:37:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZYde9m/dS5aUvtV/l0ztTJU7f2jzz+Wg99NDEDNVFDFySWaXYblen6dkTlZ1bZOxd8XYYrzJRLFK4AhsvgSNCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:08:28.673018Z"},"content_sha256":"6d50de65a5d7fb27a9c389ce97e53aae0b1cc5ef482558f9aee5fddbb3bf2c97","schema_version":"1.0","event_id":"sha256:6d50de65a5d7fb27a9c389ce97e53aae0b1cc5ef482558f9aee5fddbb3bf2c97"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:N6QH76PXJJNTM2VJXDO3NX3V3O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Fast Solutions to Projective Monotone Linear Complementarity Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.LG","authors_text":"Geoffrey J. Gordon","submitted_at":"2012-12-31T20:13:23Z","abstract_excerpt":"We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\\in{\\mathbb R}^{n\\times n}$ can be decomposed as $M=\\Phi U + \\Pi_0$, where the rank of $\\Phi$ is $k<n$, and $\\Pi_0$ denotes Euclidean projection onto the nullspace of $\\Phi^\\top$. We call such LCPs projective. Our algorithm solves a monotone projective LCP to relative accuracy $\\epsilon$ in $O(\\sqrt n \\ln(1/\\epsilon))$ iterations, with each iteration requiring $O(nk^2)$ flops. This complexity compares favorably with i"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6958","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-18T03:37:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/5SWqtse/Q4yOKzJEmPvl2GT791jn2jfLgLlv0JZFyRyitTf8omZR3NnYQZDSvBIZhZUughOG31SbEqSk4JPDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T07:08:28.673382Z"},"content_sha256":"ba84329b4e325ba4a09aa4c6e49098a605aa6d659ba293b99ab086369430a14f","schema_version":"1.0","event_id":"sha256:ba84329b4e325ba4a09aa4c6e49098a605aa6d659ba293b99ab086369430a14f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/N6QH76PXJJNTM2VJXDO3NX3V3O/bundle.json","state_url":"https://pith.science/pith/N6QH76PXJJNTM2VJXDO3NX3V3O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/N6QH76PXJJNTM2VJXDO3NX3V3O/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-02T07:08:28Z","links":{"resolver":"https://pith.science/pith/N6QH76PXJJNTM2VJXDO3NX3V3O","bundle":"https://pith.science/pith/N6QH76PXJJNTM2VJXDO3NX3V3O/bundle.json","state":"https://pith.science/pith/N6QH76PXJJNTM2VJXDO3NX3V3O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/N6QH76PXJJNTM2VJXDO3NX3V3O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:N6QH76PXJJNTM2VJXDO3NX3V3O","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":"aec38539afa555b3052619a8be210d552f3bf1fffd11f6dcef34213a465119ba","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-31T20:13:23Z","title_canon_sha256":"553d8132973c8b62f0b0e948a0db1d48135eef8ef9200f1cfdd711901be699b4"},"schema_version":"1.0","source":{"id":"1212.6958","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1212.6958","created_at":"2026-05-18T03:37:29Z"},{"alias_kind":"arxiv_version","alias_value":"1212.6958v1","created_at":"2026-05-18T03:37:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6958","created_at":"2026-05-18T03:37:29Z"},{"alias_kind":"pith_short_12","alias_value":"N6QH76PXJJNT","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"N6QH76PXJJNTM2VJ","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"N6QH76PX","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:ba84329b4e325ba4a09aa4c6e49098a605aa6d659ba293b99ab086369430a14f","target":"graph","created_at":"2026-05-18T03:37:29Z","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":"We present a new interior-point potential-reduction algorithm for solving monotone linear complementarity problems (LCPs) that have a particular special structure: their matrix $M\\in{\\mathbb R}^{n\\times n}$ can be decomposed as $M=\\Phi U + \\Pi_0$, where the rank of $\\Phi$ is $k<n$, and $\\Pi_0$ denotes Euclidean projection onto the nullspace of $\\Phi^\\top$. We call such LCPs projective. Our algorithm solves a monotone projective LCP to relative accuracy $\\epsilon$ in $O(\\sqrt n \\ln(1/\\epsilon))$ iterations, with each iteration requiring $O(nk^2)$ flops. This complexity compares favorably with i","authors_text":"Geoffrey J. Gordon","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-31T20:13:23Z","title":"Fast Solutions to Projective Monotone Linear Complementarity Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6958","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:6d50de65a5d7fb27a9c389ce97e53aae0b1cc5ef482558f9aee5fddbb3bf2c97","target":"record","created_at":"2026-05-18T03:37:29Z","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":"aec38539afa555b3052619a8be210d552f3bf1fffd11f6dcef34213a465119ba","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2012-12-31T20:13:23Z","title_canon_sha256":"553d8132973c8b62f0b0e948a0db1d48135eef8ef9200f1cfdd711901be699b4"},"schema_version":"1.0","source":{"id":"1212.6958","kind":"arxiv","version":1}},"canonical_sha256":"6fa07ff9f74a5b366aa9b8ddb6df75dbb15848a5fc52dc8987fbda06903f6d6a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6fa07ff9f74a5b366aa9b8ddb6df75dbb15848a5fc52dc8987fbda06903f6d6a","first_computed_at":"2026-05-18T03:37:29.406090Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:37:29.406090Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zjPOc58gJAu5YIYdoSC9TeVIngruPLNk7KrUZreM23z9YIhITyFRlCYLfXjfsMDbIDbupG1NDpzBtnqnfJkoAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:37:29.406937Z","signed_message":"canonical_sha256_bytes"},"source_id":"1212.6958","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6d50de65a5d7fb27a9c389ce97e53aae0b1cc5ef482558f9aee5fddbb3bf2c97","sha256:ba84329b4e325ba4a09aa4c6e49098a605aa6d659ba293b99ab086369430a14f"],"state_sha256":"b3d55986017cf817219ce3bc0b8f70581d441ca0fbde1b0df94b7ca201d638dd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JWLspg11iDBQfcnIs3tSJLmqvcGeKNVESAm9kFvcsIoHRsgEPsVEvrD/NFnPHEeYDRS/km4WGmwLcx1+k85DDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T07:08:28.675353Z","bundle_sha256":"555ba0f4f0e000599fdb967caa4c4120cd45a348dbeae3b7cad2b05346b3720b"}}