{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:2XB6IEDARSRGPEKEQNAJFIOGJN","short_pith_number":"pith:2XB6IEDA","schema_version":"1.0","canonical_sha256":"d5c3e410608ca2679144834092a1c64b6e2a9a524c63b3f2f4e049e8f75e32f6","source":{"kind":"arxiv","id":"1309.7225","version":2},"attestation_state":"computed","paper":{"title":"Enumeration of PLCP-orientations of the 4-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Hiroyuki Miyata, Lorenz Klaus","submitted_at":"2013-09-27T12:46:45Z","abstract_excerpt":"The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is known to be NP-hard, but there are some promising results that suggest the possibility that the LCP with a P-matrix (PLCP) may be polynomial-time solvable. However, no polynomial-time algorithm for the PLCP has been found yet and the computational complexity of the PLCP remains open. Simple principal pivoting (SPP) algorithms, also known as Bard-type algorithms, are candidates for polynomial-time algorithms for the PLCP"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1309.7225","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T12:46:45Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"56128ecb29950f1bffa59206c04cf2d76610daca455b978204f339a7b7042f90","abstract_canon_sha256":"7e253840265b9f6898198f904c6d9d5bc65ed909153e254823df995908f54da5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:47:52.926759Z","signature_b64":"qfc28ikCWLu4yA3pdOW4yxDuCxi0ATfxHSyEVFkHaWM2NYmLrYGGukwmblZxEQb96748upE4GFx+cZg0wXf8Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d5c3e410608ca2679144834092a1c64b6e2a9a524c63b3f2f4e049e8f75e32f6","last_reissued_at":"2026-05-18T02:47:52.926276Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:47:52.926276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Enumeration of PLCP-orientations of the 4-cube","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.CO","authors_text":"Hiroyuki Miyata, Lorenz Klaus","submitted_at":"2013-09-27T12:46:45Z","abstract_excerpt":"The linear complementarity problem (LCP) provides a unified approach to many problems such as linear programs, convex quadratic programs, and bimatrix games. The general LCP is known to be NP-hard, but there are some promising results that suggest the possibility that the LCP with a P-matrix (PLCP) may be polynomial-time solvable. However, no polynomial-time algorithm for the PLCP has been found yet and the computational complexity of the PLCP remains open. Simple principal pivoting (SPP) algorithms, also known as Bard-type algorithms, are candidates for polynomial-time algorithms for the PLCP"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7225","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1309.7225","created_at":"2026-05-18T02:47:52.926352+00:00"},{"alias_kind":"arxiv_version","alias_value":"1309.7225v2","created_at":"2026-05-18T02:47:52.926352+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7225","created_at":"2026-05-18T02:47:52.926352+00:00"},{"alias_kind":"pith_short_12","alias_value":"2XB6IEDARSRG","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_16","alias_value":"2XB6IEDARSRGPEKE","created_at":"2026-05-18T12:27:32.513160+00:00"},{"alias_kind":"pith_short_8","alias_value":"2XB6IEDA","created_at":"2026-05-18T12:27:32.513160+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN","json":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN.json","graph_json":"https://pith.science/api/pith-number/2XB6IEDARSRGPEKEQNAJFIOGJN/graph.json","events_json":"https://pith.science/api/pith-number/2XB6IEDARSRGPEKEQNAJFIOGJN/events.json","paper":"https://pith.science/paper/2XB6IEDA"},"agent_actions":{"view_html":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN","download_json":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN.json","view_paper":"https://pith.science/paper/2XB6IEDA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1309.7225&json=true","fetch_graph":"https://pith.science/api/pith-number/2XB6IEDARSRGPEKEQNAJFIOGJN/graph.json","fetch_events":"https://pith.science/api/pith-number/2XB6IEDARSRGPEKEQNAJFIOGJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/action/storage_attestation","attest_author":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/action/author_attestation","sign_citation":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/action/citation_signature","submit_replication":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/action/replication_record"}},"created_at":"2026-05-18T02:47:52.926352+00:00","updated_at":"2026-05-18T02:47:52.926352+00:00"}