{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:YKUGX5I7H7NEUAPRYFGW76W5IA","short_pith_number":"pith:YKUGX5I7","schema_version":"1.0","canonical_sha256":"c2a86bf51f3fda4a01f1c14d6ffadd400443baaa0ae7d191f3ab4ff414d2c694","source":{"kind":"arxiv","id":"1510.03339","version":2},"attestation_state":"computed","paper":{"title":"A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Sanjeev Saxena","submitted_at":"2015-10-12T15:37:07Z","abstract_excerpt":"Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We give a self-contained treatment of an interior-point method which is particularly tailored to the typical mathematical background of CS students. In particular, only limited knowledge of linear algebra and calculus is assumed."},"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":"1510.03339","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2015-10-12T15:37:07Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"cc8f38376f36f6fc28f118b5e36ad28aee399f740974f31b2a0b1e18f3fb8951","abstract_canon_sha256":"54c659b4ceffe910f3f2630539b9fea941ac1b453bd3f1a515d9c912138107d5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:55:52.194255Z","signature_b64":"5Z6twptRCRDl8WVbPVLcsB+SDyDFPQtnDaYqTRwFalpaWWCxgPWHD6y77B+hz4ulcVedaIkCORAqp6w9+PEEBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c2a86bf51f3fda4a01f1c14d6ffadd400443baaa0ae7d191f3ab4ff414d2c694","last_reissued_at":"2026-05-18T00:55:52.193805Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:55:52.193805Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A Still Simpler Way of Introducing the Interior-Point Method for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"cs.DS","authors_text":"Kurt Mehlhorn, Sanjeev Saxena","submitted_at":"2015-10-12T15:37:07Z","abstract_excerpt":"Linear programming is now included in algorithm undergraduate and postgraduate courses for computer science majors. We give a self-contained treatment of an interior-point method which is particularly tailored to the typical mathematical background of CS students. In particular, only limited knowledge of linear algebra and calculus is assumed."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.03339","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":"1510.03339","created_at":"2026-05-18T00:55:52.193868+00:00"},{"alias_kind":"arxiv_version","alias_value":"1510.03339v2","created_at":"2026-05-18T00:55:52.193868+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1510.03339","created_at":"2026-05-18T00:55:52.193868+00:00"},{"alias_kind":"pith_short_12","alias_value":"YKUGX5I7H7NE","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_16","alias_value":"YKUGX5I7H7NEUAPR","created_at":"2026-05-18T12:29:50.041715+00:00"},{"alias_kind":"pith_short_8","alias_value":"YKUGX5I7","created_at":"2026-05-18T12:29:50.041715+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/YKUGX5I7H7NEUAPRYFGW76W5IA","json":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA.json","graph_json":"https://pith.science/api/pith-number/YKUGX5I7H7NEUAPRYFGW76W5IA/graph.json","events_json":"https://pith.science/api/pith-number/YKUGX5I7H7NEUAPRYFGW76W5IA/events.json","paper":"https://pith.science/paper/YKUGX5I7"},"agent_actions":{"view_html":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA","download_json":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA.json","view_paper":"https://pith.science/paper/YKUGX5I7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1510.03339&json=true","fetch_graph":"https://pith.science/api/pith-number/YKUGX5I7H7NEUAPRYFGW76W5IA/graph.json","fetch_events":"https://pith.science/api/pith-number/YKUGX5I7H7NEUAPRYFGW76W5IA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA/action/storage_attestation","attest_author":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA/action/author_attestation","sign_citation":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA/action/citation_signature","submit_replication":"https://pith.science/pith/YKUGX5I7H7NEUAPRYFGW76W5IA/action/replication_record"}},"created_at":"2026-05-18T00:55:52.193868+00:00","updated_at":"2026-05-18T00:55:52.193868+00:00"}