{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:AXMICEMFBBGYUGFOIRIXZUE4ER","short_pith_number":"pith:AXMICEMF","schema_version":"1.0","canonical_sha256":"05d8811185084d8a18ae44517cd09c245b2e4c7380f6bb86b29ff6bd1a1e1178","source":{"kind":"arxiv","id":"1511.06470","version":1},"attestation_state":"computed","paper":{"title":"Comment on Two schemes for Secure Outsourcing of Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Lihua Liu, Zhengjun Cao","submitted_at":"2015-11-20T01:28:15Z","abstract_excerpt":"Recently, Wang et al. [IEEE INFOCOM 2011, 820-828], and Nie et al. [IEEE AINA 2014, 591-596] have proposed two schemes for secure outsourcing of large-scale linear programming (LP). They did not consider the standard form: minimize c^{T}x, subject to Ax=b, x>0. Instead, they studied a peculiar form: minimize c^{T}x, subject to Ax = b, Bx>0, where B is a non-singular matrix. In this note, we stress that the proposed peculiar form is unsolvable and meaningless. The two schemes have confused the functional inequality constraints Bx>0 with the nonnegativity constraints x>0 in the linear programmin"},"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":"1511.06470","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CR","submitted_at":"2015-11-20T01:28:15Z","cross_cats_sorted":[],"title_canon_sha256":"35db58001bb08cd0227be0ce78c1a3000bfc382c667f29c387d6a74004994167","abstract_canon_sha256":"8643d3e7545543bb82ae277d8485148bb2610ed708224ad1916c4db8357317c4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:26:24.444546Z","signature_b64":"jvi+0Nx2N4/xbrgurJ9ZfzLMwziQQLA28JI4m/lWa7mdBpCXJqm2kVXLzNc0lOM5WsmV0YjlQhrr7adHNtNsCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"05d8811185084d8a18ae44517cd09c245b2e4c7380f6bb86b29ff6bd1a1e1178","last_reissued_at":"2026-05-18T01:26:24.444138Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:26:24.444138Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comment on Two schemes for Secure Outsourcing of Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.CR","authors_text":"Lihua Liu, Zhengjun Cao","submitted_at":"2015-11-20T01:28:15Z","abstract_excerpt":"Recently, Wang et al. [IEEE INFOCOM 2011, 820-828], and Nie et al. [IEEE AINA 2014, 591-596] have proposed two schemes for secure outsourcing of large-scale linear programming (LP). They did not consider the standard form: minimize c^{T}x, subject to Ax=b, x>0. Instead, they studied a peculiar form: minimize c^{T}x, subject to Ax = b, Bx>0, where B is a non-singular matrix. In this note, we stress that the proposed peculiar form is unsolvable and meaningless. The two schemes have confused the functional inequality constraints Bx>0 with the nonnegativity constraints x>0 in the linear programmin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1511.06470","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1511.06470","created_at":"2026-05-18T01:26:24.444201+00:00"},{"alias_kind":"arxiv_version","alias_value":"1511.06470v1","created_at":"2026-05-18T01:26:24.444201+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1511.06470","created_at":"2026-05-18T01:26:24.444201+00:00"},{"alias_kind":"pith_short_12","alias_value":"AXMICEMFBBGY","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_16","alias_value":"AXMICEMFBBGYUGFO","created_at":"2026-05-18T12:29:10.953037+00:00"},{"alias_kind":"pith_short_8","alias_value":"AXMICEMF","created_at":"2026-05-18T12:29:10.953037+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/AXMICEMFBBGYUGFOIRIXZUE4ER","json":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER.json","graph_json":"https://pith.science/api/pith-number/AXMICEMFBBGYUGFOIRIXZUE4ER/graph.json","events_json":"https://pith.science/api/pith-number/AXMICEMFBBGYUGFOIRIXZUE4ER/events.json","paper":"https://pith.science/paper/AXMICEMF"},"agent_actions":{"view_html":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER","download_json":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER.json","view_paper":"https://pith.science/paper/AXMICEMF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1511.06470&json=true","fetch_graph":"https://pith.science/api/pith-number/AXMICEMFBBGYUGFOIRIXZUE4ER/graph.json","fetch_events":"https://pith.science/api/pith-number/AXMICEMFBBGYUGFOIRIXZUE4ER/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER/action/storage_attestation","attest_author":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER/action/author_attestation","sign_citation":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER/action/citation_signature","submit_replication":"https://pith.science/pith/AXMICEMFBBGYUGFOIRIXZUE4ER/action/replication_record"}},"created_at":"2026-05-18T01:26:24.444201+00:00","updated_at":"2026-05-18T01:26:24.444201+00:00"}