{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:4SQVMA73HC3KH3WQLIRSUBRKLO","short_pith_number":"pith:4SQVMA73","schema_version":"1.0","canonical_sha256":"e4a15603fb38b6a3eed05a232a062a5b892ec814041b8ffe1eeea381f2b675aa","source":{"kind":"arxiv","id":"1712.04637","version":1},"attestation_state":"computed","paper":{"title":"Ellipsoid Method for Linear Programming made simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjeev Saxena","submitted_at":"2017-12-13T07:35:17Z","abstract_excerpt":"In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, then later prove its correctness, which requires a good knowledge of linear algebra."},"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":"1712.04637","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-12-13T07:35:17Z","cross_cats_sorted":[],"title_canon_sha256":"b71ea33e93751e87ed6653aa3c086926e1b6b671a409c7f95f83a669bba9f062","abstract_canon_sha256":"136b02045c240816704c3d6afe4f515695894f644fd80ca9be2a4b66cabce85b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:03.951649Z","signature_b64":"/hqa3te3e+2toTFaBDGsFsZxR46Ny5V8K4qwsIclnjKa2G0fASMFAowUjqH0FOyEa7NyfKXaatLngyW3v8LoAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e4a15603fb38b6a3eed05a232a062a5b892ec814041b8ffe1eeea381f2b675aa","last_reissued_at":"2026-05-18T00:28:03.950932Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:03.950932Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Ellipsoid Method for Linear Programming made simple","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Sanjeev Saxena","submitted_at":"2017-12-13T07:35:17Z","abstract_excerpt":"In this paper, ellipsoid method for linear programming is derived using only minimal knowledge of algebra and matrices. Unfortunately, most authors first describe the algorithm, then later prove its correctness, which requires a good knowledge of linear algebra."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1712.04637","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":"1712.04637","created_at":"2026-05-18T00:28:03.951060+00:00"},{"alias_kind":"arxiv_version","alias_value":"1712.04637v1","created_at":"2026-05-18T00:28:03.951060+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1712.04637","created_at":"2026-05-18T00:28:03.951060+00:00"},{"alias_kind":"pith_short_12","alias_value":"4SQVMA73HC3K","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_16","alias_value":"4SQVMA73HC3KH3WQ","created_at":"2026-05-18T12:31:00.734936+00:00"},{"alias_kind":"pith_short_8","alias_value":"4SQVMA73","created_at":"2026-05-18T12:31:00.734936+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/4SQVMA73HC3KH3WQLIRSUBRKLO","json":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO.json","graph_json":"https://pith.science/api/pith-number/4SQVMA73HC3KH3WQLIRSUBRKLO/graph.json","events_json":"https://pith.science/api/pith-number/4SQVMA73HC3KH3WQLIRSUBRKLO/events.json","paper":"https://pith.science/paper/4SQVMA73"},"agent_actions":{"view_html":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO","download_json":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO.json","view_paper":"https://pith.science/paper/4SQVMA73","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1712.04637&json=true","fetch_graph":"https://pith.science/api/pith-number/4SQVMA73HC3KH3WQLIRSUBRKLO/graph.json","fetch_events":"https://pith.science/api/pith-number/4SQVMA73HC3KH3WQLIRSUBRKLO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO/action/storage_attestation","attest_author":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO/action/author_attestation","sign_citation":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO/action/citation_signature","submit_replication":"https://pith.science/pith/4SQVMA73HC3KH3WQLIRSUBRKLO/action/replication_record"}},"created_at":"2026-05-18T00:28:03.951060+00:00","updated_at":"2026-05-18T00:28:03.951060+00:00"}