{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:C3B6KZ2VJ37O7SMCTV4O75UQKW","short_pith_number":"pith:C3B6KZ2V","schema_version":"1.0","canonical_sha256":"16c3e567554efeefc9829d78eff69055a1cd10d51cd254ca7da9dc9941aa7f80","source":{"kind":"arxiv","id":"1805.06342","version":4},"attestation_state":"computed","paper":{"title":"Topological structure and a polynomial-time solution of linear programming over the real numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jing-Yuan Wei","submitted_at":"2018-05-16T14:18:23Z","abstract_excerpt":"We present an O(mn^2) algorithm for linear programming over the real numbers with n primal and m dual variables through deciding the support set a of an optimal solution. Let z and e be two 2(n+m)-tuples with z representing the primal, dual and slack variables of linear programming, and e the all-one vector. Let Z denote the region including all (tz, t) with z meeting the zero duality gap constraint, all primal and dual constraints except for the non-negativity constraints, and without limit on the real number t. Let L be the projection of Z on the hyperplane defined by t = 0. Consider a squee"},"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":"1805.06342","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-05-16T14:18:23Z","cross_cats_sorted":[],"title_canon_sha256":"11dae0b2b5103dce2e920b3756f0efe9fd8ea778d55ff14684316ce3d425d50c","abstract_canon_sha256":"986390b3f642e46ebf68bc0ccd6b1f6b0485e658c9a34544f7a7d5357be67e1e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-20T01:04:47.297199Z","signature_b64":"XWUIVh1vgXj+JITd9unTygJc+uut//NnNCChTV10VJspPssOdYwFQLl1YZEDRteZrdXJgD+mVPUAos4oBwi1CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"16c3e567554efeefc9829d78eff69055a1cd10d51cd254ca7da9dc9941aa7f80","last_reissued_at":"2026-05-20T01:04:47.296524Z","signature_status":"signed_v1","first_computed_at":"2026-05-20T01:04:47.296524Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Topological structure and a polynomial-time solution of linear programming over the real numbers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jing-Yuan Wei","submitted_at":"2018-05-16T14:18:23Z","abstract_excerpt":"We present an O(mn^2) algorithm for linear programming over the real numbers with n primal and m dual variables through deciding the support set a of an optimal solution. Let z and e be two 2(n+m)-tuples with z representing the primal, dual and slack variables of linear programming, and e the all-one vector. Let Z denote the region including all (tz, t) with z meeting the zero duality gap constraint, all primal and dual constraints except for the non-negativity constraints, and without limit on the real number t. Let L be the projection of Z on the hyperplane defined by t = 0. Consider a squee"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1805.06342","kind":"arxiv","version":4},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/1805.06342/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"1805.06342","created_at":"2026-05-20T01:04:47.296616+00:00"},{"alias_kind":"arxiv_version","alias_value":"1805.06342v4","created_at":"2026-05-20T01:04:47.296616+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1805.06342","created_at":"2026-05-20T01:04:47.296616+00:00"},{"alias_kind":"pith_short_12","alias_value":"C3B6KZ2VJ37O","created_at":"2026-05-20T01:04:47.296616+00:00"},{"alias_kind":"pith_short_16","alias_value":"C3B6KZ2VJ37O7SMC","created_at":"2026-05-20T01:04:47.296616+00:00"},{"alias_kind":"pith_short_8","alias_value":"C3B6KZ2V","created_at":"2026-05-20T01:04:47.296616+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/C3B6KZ2VJ37O7SMCTV4O75UQKW","json":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW.json","graph_json":"https://pith.science/api/pith-number/C3B6KZ2VJ37O7SMCTV4O75UQKW/graph.json","events_json":"https://pith.science/api/pith-number/C3B6KZ2VJ37O7SMCTV4O75UQKW/events.json","paper":"https://pith.science/paper/C3B6KZ2V"},"agent_actions":{"view_html":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW","download_json":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW.json","view_paper":"https://pith.science/paper/C3B6KZ2V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1805.06342&json=true","fetch_graph":"https://pith.science/api/pith-number/C3B6KZ2VJ37O7SMCTV4O75UQKW/graph.json","fetch_events":"https://pith.science/api/pith-number/C3B6KZ2VJ37O7SMCTV4O75UQKW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW/action/storage_attestation","attest_author":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW/action/author_attestation","sign_citation":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW/action/citation_signature","submit_replication":"https://pith.science/pith/C3B6KZ2VJ37O7SMCTV4O75UQKW/action/replication_record"}},"created_at":"2026-05-20T01:04:47.296616+00:00","updated_at":"2026-05-20T01:04:47.296616+00:00"}