{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:JJO2OSGHZRZ7JMNROXUJVM4ZUC","short_pith_number":"pith:JJO2OSGH","schema_version":"1.0","canonical_sha256":"4a5da748c7cc73f4b1b175e89ab399a09bbeaffe50f91a33f16c8220b4c4eeda","source":{"kind":"arxiv","id":"1412.0652","version":3},"attestation_state":"computed","paper":{"title":"Still Simpler Way of Introducing Interior-Point method for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjeev Saxena","submitted_at":"2014-11-30T11:35:33Z","abstract_excerpt":"Linear Programming is now included in Algorithm undergraduate and postgraduate courses for Computer Science majors. It is possible to teach interior-point methods directly with just minimal knowledge of Algebra and Matrices."},"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":"1412.0652","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2014-11-30T11:35:33Z","cross_cats_sorted":[],"title_canon_sha256":"6fcb0f22b12fb1e701a67930c362389c411752b139aa5657116f7cda611e1015","abstract_canon_sha256":"026066b78093adf9af847b65431da9ac9b416370fc274e49545f835503106b75"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:29:24.658947Z","signature_b64":"0T9IrdTfFNsIk5/w0hAjc4nx9iAMC8FA0TwaSww9kES9vGrungGYwOJ7fHWUkwOIo1JxOsB6FmVhGUvOctTJDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4a5da748c7cc73f4b1b175e89ab399a09bbeaffe50f91a33f16c8220b4c4eeda","last_reissued_at":"2026-05-18T02:29:24.658570Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:29:24.658570Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Still Simpler Way of Introducing Interior-Point method for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjeev Saxena","submitted_at":"2014-11-30T11:35:33Z","abstract_excerpt":"Linear Programming is now included in Algorithm undergraduate and postgraduate courses for Computer Science majors. It is possible to teach interior-point methods directly with just minimal knowledge of Algebra and Matrices."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1412.0652","kind":"arxiv","version":3},"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":"1412.0652","created_at":"2026-05-18T02:29:24.658633+00:00"},{"alias_kind":"arxiv_version","alias_value":"1412.0652v3","created_at":"2026-05-18T02:29:24.658633+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1412.0652","created_at":"2026-05-18T02:29:24.658633+00:00"},{"alias_kind":"pith_short_12","alias_value":"JJO2OSGHZRZ7","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_16","alias_value":"JJO2OSGHZRZ7JMNR","created_at":"2026-05-18T12:28:33.132498+00:00"},{"alias_kind":"pith_short_8","alias_value":"JJO2OSGH","created_at":"2026-05-18T12:28:33.132498+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/JJO2OSGHZRZ7JMNROXUJVM4ZUC","json":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC.json","graph_json":"https://pith.science/api/pith-number/JJO2OSGHZRZ7JMNROXUJVM4ZUC/graph.json","events_json":"https://pith.science/api/pith-number/JJO2OSGHZRZ7JMNROXUJVM4ZUC/events.json","paper":"https://pith.science/paper/JJO2OSGH"},"agent_actions":{"view_html":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC","download_json":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC.json","view_paper":"https://pith.science/paper/JJO2OSGH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1412.0652&json=true","fetch_graph":"https://pith.science/api/pith-number/JJO2OSGHZRZ7JMNROXUJVM4ZUC/graph.json","fetch_events":"https://pith.science/api/pith-number/JJO2OSGHZRZ7JMNROXUJVM4ZUC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC/action/storage_attestation","attest_author":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC/action/author_attestation","sign_citation":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC/action/citation_signature","submit_replication":"https://pith.science/pith/JJO2OSGHZRZ7JMNROXUJVM4ZUC/action/replication_record"}},"created_at":"2026-05-18T02:29:24.658633+00:00","updated_at":"2026-05-18T02:29:24.658633+00:00"}