{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:HGL4XLKMCSSTMTJMVS6Y5TTAJK","short_pith_number":"pith:HGL4XLKM","schema_version":"1.0","canonical_sha256":"3997cbad4c14a5364d2cacbd8ece604aa39043eeaccca27f36e1e7302bad7995","source":{"kind":"arxiv","id":"1407.1240","version":1},"attestation_state":"computed","paper":{"title":"An elementary proof of linear programming optimality conditions without using Farkas' lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Forsgren, Margaret H. Wright","submitted_at":"2014-07-04T14:22:55Z","abstract_excerpt":"Although it is easy to prove the sufficient conditions for optimality of a linear program, the necessary conditions pose a pedagogical challenge. A widespread practice in deriving the necessary conditions is to invoke Farkas' lemma, but proofs of Farkas' lemma typically involve \"nonlinear\" topics such as separating hyperplanes between disjoint convex sets, or else more advanced LP-related material such as duality and anti-cycling strategies in the simplex method. An alternative approach taken previously by several authors is to avoid Farkas' lemma through a direct proof of the necessary condit"},"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":"1407.1240","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2014-07-04T14:22:55Z","cross_cats_sorted":[],"title_canon_sha256":"3a20af29b573c3f394df015b18a7a7335be4936d5796f46854066045540e7bf4","abstract_canon_sha256":"1eb0a70a3911a7567bac71eda14301cf999eeacc16104dcdb1d8ce88ba8d95e4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:48:18.293423Z","signature_b64":"H+xMcSpV3cgpZxedspQ3sRVt6HHb+U0E5d9KfanqLMPC5n6qBTxIREE9xzMCV/O1iNYv+POWmkwLb6WXyNj8CQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3997cbad4c14a5364d2cacbd8ece604aa39043eeaccca27f36e1e7302bad7995","last_reissued_at":"2026-05-18T02:48:18.293013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:48:18.293013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An elementary proof of linear programming optimality conditions without using Farkas' lemma","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Anders Forsgren, Margaret H. Wright","submitted_at":"2014-07-04T14:22:55Z","abstract_excerpt":"Although it is easy to prove the sufficient conditions for optimality of a linear program, the necessary conditions pose a pedagogical challenge. A widespread practice in deriving the necessary conditions is to invoke Farkas' lemma, but proofs of Farkas' lemma typically involve \"nonlinear\" topics such as separating hyperplanes between disjoint convex sets, or else more advanced LP-related material such as duality and anti-cycling strategies in the simplex method. An alternative approach taken previously by several authors is to avoid Farkas' lemma through a direct proof of the necessary condit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.1240","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":"1407.1240","created_at":"2026-05-18T02:48:18.293073+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.1240v1","created_at":"2026-05-18T02:48:18.293073+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.1240","created_at":"2026-05-18T02:48:18.293073+00:00"},{"alias_kind":"pith_short_12","alias_value":"HGL4XLKMCSST","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_16","alias_value":"HGL4XLKMCSSTMTJM","created_at":"2026-05-18T12:28:30.664211+00:00"},{"alias_kind":"pith_short_8","alias_value":"HGL4XLKM","created_at":"2026-05-18T12:28:30.664211+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/HGL4XLKMCSSTMTJMVS6Y5TTAJK","json":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK.json","graph_json":"https://pith.science/api/pith-number/HGL4XLKMCSSTMTJMVS6Y5TTAJK/graph.json","events_json":"https://pith.science/api/pith-number/HGL4XLKMCSSTMTJMVS6Y5TTAJK/events.json","paper":"https://pith.science/paper/HGL4XLKM"},"agent_actions":{"view_html":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK","download_json":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK.json","view_paper":"https://pith.science/paper/HGL4XLKM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.1240&json=true","fetch_graph":"https://pith.science/api/pith-number/HGL4XLKMCSSTMTJMVS6Y5TTAJK/graph.json","fetch_events":"https://pith.science/api/pith-number/HGL4XLKMCSSTMTJMVS6Y5TTAJK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK/action/storage_attestation","attest_author":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK/action/author_attestation","sign_citation":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK/action/citation_signature","submit_replication":"https://pith.science/pith/HGL4XLKMCSSTMTJMVS6Y5TTAJK/action/replication_record"}},"created_at":"2026-05-18T02:48:18.293073+00:00","updated_at":"2026-05-18T02:48:18.293073+00:00"}