{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2XB6IEDARSRGPEKEQNAJFIOGJN","short_pith_number":"pith:2XB6IEDA","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"},"canonical_sha256":"d5c3e410608ca2679144834092a1c64b6e2a9a524c63b3f2f4e049e8f75e32f6","source":{"kind":"arxiv","id":"1309.7225","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7225","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7225v2","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7225","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"2XB6IEDARSRG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2XB6IEDARSRGPEKE","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2XB6IEDA","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2XB6IEDARSRGPEKEQNAJFIOGJN","target":"record","payload":{"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"},"canonical_sha256":"d5c3e410608ca2679144834092a1c64b6e2a9a524c63b3f2f4e049e8f75e32f6","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"},"source_kind":"arxiv","source_id":"1309.7225","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-05-18T02:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uuwRmVA++oew36Nb3GaQbHlAbQaGSmFtNht6Puj0zxlIDCh88TtKjAtayQUkrtznJjpRt6eSz+INZFN0sWkEAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:37.732181Z"},"content_sha256":"8b29c9cac98791b8362b4c04327e4856dc62d7315aad68272d7d563c023baa7a","schema_version":"1.0","event_id":"sha256:8b29c9cac98791b8362b4c04327e4856dc62d7315aad68272d7d563c023baa7a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2XB6IEDARSRGPEKEQNAJFIOGJN","target":"graph","payload":{"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"},"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-18T02:47:52Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IpBIo5RWRRSOXtYQMIOzn8+2LYrCHTY6P0neWgWnSbUqUYYbcq0PJcc2pnISRQEsr9G9pWOkS55L6vzWU8+kBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:45:37.732880Z"},"content_sha256":"1666f72c40ac38f14cb756fa8040b807e013877558672ec93081e65b3e71c550","schema_version":"1.0","event_id":"sha256:1666f72c40ac38f14cb756fa8040b807e013877558672ec93081e65b3e71c550"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/bundle.json","state_url":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/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-05T01:45:37Z","links":{"resolver":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN","bundle":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/bundle.json","state":"https://pith.science/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2XB6IEDARSRGPEKEQNAJFIOGJN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2XB6IEDARSRGPEKEQNAJFIOGJN","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":"7e253840265b9f6898198f904c6d9d5bc65ed909153e254823df995908f54da5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T12:46:45Z","title_canon_sha256":"56128ecb29950f1bffa59206c04cf2d76610daca455b978204f339a7b7042f90"},"schema_version":"1.0","source":{"id":"1309.7225","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1309.7225","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"arxiv_version","alias_value":"1309.7225v2","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1309.7225","created_at":"2026-05-18T02:47:52Z"},{"alias_kind":"pith_short_12","alias_value":"2XB6IEDARSRG","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2XB6IEDARSRGPEKE","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2XB6IEDA","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:1666f72c40ac38f14cb756fa8040b807e013877558672ec93081e65b3e71c550","target":"graph","created_at":"2026-05-18T02:47:52Z","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":"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","authors_text":"Hiroyuki Miyata, Lorenz Klaus","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T12:46:45Z","title":"Enumeration of PLCP-orientations of the 4-cube"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1309.7225","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:8b29c9cac98791b8362b4c04327e4856dc62d7315aad68272d7d563c023baa7a","target":"record","created_at":"2026-05-18T02:47:52Z","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":"7e253840265b9f6898198f904c6d9d5bc65ed909153e254823df995908f54da5","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-09-27T12:46:45Z","title_canon_sha256":"56128ecb29950f1bffa59206c04cf2d76610daca455b978204f339a7b7042f90"},"schema_version":"1.0","source":{"id":"1309.7225","kind":"arxiv","version":2}},"canonical_sha256":"d5c3e410608ca2679144834092a1c64b6e2a9a524c63b3f2f4e049e8f75e32f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d5c3e410608ca2679144834092a1c64b6e2a9a524c63b3f2f4e049e8f75e32f6","first_computed_at":"2026-05-18T02:47:52.926276Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:47:52.926276Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qfc28ikCWLu4yA3pdOW4yxDuCxi0ATfxHSyEVFkHaWM2NYmLrYGGukwmblZxEQb96748upE4GFx+cZg0wXf8Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:47:52.926759Z","signed_message":"canonical_sha256_bytes"},"source_id":"1309.7225","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8b29c9cac98791b8362b4c04327e4856dc62d7315aad68272d7d563c023baa7a","sha256:1666f72c40ac38f14cb756fa8040b807e013877558672ec93081e65b3e71c550"],"state_sha256":"9a44181b0472e9991143ed8554a3eafee9f0c5c4c16009a6a9a2342d8e4fbd60"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bDjr3WwPFv2o147dsMEPIGUrX8W/y0TkSF7OnpkKIuqgNcig06QwUZubiwzBnDYB9+270QdguXMgu1rJqBOlCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:45:37.736565Z","bundle_sha256":"a3f00aa78014a664b379ba19e2d862bff68104205e20f53f3a1ade86bec008ec"}}