{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JSEA7DPVVULFSADJBKQVUFI5ES","short_pith_number":"pith:JSEA7DPV","schema_version":"1.0","canonical_sha256":"4c880f8df5ad165900690aa15a151d2494af0c0c2273ff47e4aaaaf27b02c32b","source":{"kind":"arxiv","id":"1604.07491","version":5},"attestation_state":"computed","paper":{"title":"Implementation of Interior-point Methods for LP based on Krylov Subspace Iterative Solvers with Inner-iteration Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Keiichi Morikuni, Ken Hayami, Takashi Tsuchiya, Yiran Cui","submitted_at":"2016-04-26T01:40:20Z","abstract_excerpt":"We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed by Morikuni and Hayami enable us to overcome the severe ill-conditioning of linear equations solved in the final phase of interior-point iterations. The Krylov subspace methods do not suffer from rank-deficiency and therefore no preprocessing is necessary even if rows of the constraint matrix are not linearly independent. By means of these methods, a new interior-point recurrence is proposed in order to omit one mat"},"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":"1604.07491","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-04-26T01:40:20Z","cross_cats_sorted":[],"title_canon_sha256":"82ce55e64845d4eeae6ea5d74b3553042a96b6de39e82eb39967fa7d4b186718","abstract_canon_sha256":"3e9e2714d8d524f12b541a38be4a5d9b18ba309742509273235c938739f36656"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:29:37.934347Z","signature_b64":"mrDfBDRqGv/mzzEADWe/CUgdVv32AdM2AA56L6wI9ej14FTMq3FsiK2PenyTxBqmuUtPQxex1Tk7MsfPxsYTBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4c880f8df5ad165900690aa15a151d2494af0c0c2273ff47e4aaaaf27b02c32b","last_reissued_at":"2026-07-05T03:29:37.933945Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:29:37.933945Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Implementation of Interior-point Methods for LP based on Krylov Subspace Iterative Solvers with Inner-iteration Preconditioning","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Keiichi Morikuni, Ken Hayami, Takashi Tsuchiya, Yiran Cui","submitted_at":"2016-04-26T01:40:20Z","abstract_excerpt":"We apply novel inner-iteration preconditioned Krylov subspace methods to the interior-point algorithm for linear programming (LP). Inner-iteration preconditioners recently proposed by Morikuni and Hayami enable us to overcome the severe ill-conditioning of linear equations solved in the final phase of interior-point iterations. The Krylov subspace methods do not suffer from rank-deficiency and therefore no preprocessing is necessary even if rows of the constraint matrix are not linearly independent. By means of these methods, a new interior-point recurrence is proposed in order to omit one mat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1604.07491","kind":"arxiv","version":5},"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/1604.07491/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":"1604.07491","created_at":"2026-07-05T03:29:37.934000+00:00"},{"alias_kind":"arxiv_version","alias_value":"1604.07491v5","created_at":"2026-07-05T03:29:37.934000+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1604.07491","created_at":"2026-07-05T03:29:37.934000+00:00"},{"alias_kind":"pith_short_12","alias_value":"JSEA7DPVVULF","created_at":"2026-07-05T03:29:37.934000+00:00"},{"alias_kind":"pith_short_16","alias_value":"JSEA7DPVVULFSADJ","created_at":"2026-07-05T03:29:37.934000+00:00"},{"alias_kind":"pith_short_8","alias_value":"JSEA7DPV","created_at":"2026-07-05T03:29:37.934000+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2412.05979","citing_title":"Relational Quantum Dynamics (RQD): An Informational Ontology","ref_index":58,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES","json":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES.json","graph_json":"https://pith.science/api/pith-number/JSEA7DPVVULFSADJBKQVUFI5ES/graph.json","events_json":"https://pith.science/api/pith-number/JSEA7DPVVULFSADJBKQVUFI5ES/events.json","paper":"https://pith.science/paper/JSEA7DPV"},"agent_actions":{"view_html":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES","download_json":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES.json","view_paper":"https://pith.science/paper/JSEA7DPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1604.07491&json=true","fetch_graph":"https://pith.science/api/pith-number/JSEA7DPVVULFSADJBKQVUFI5ES/graph.json","fetch_events":"https://pith.science/api/pith-number/JSEA7DPVVULFSADJBKQVUFI5ES/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES/action/storage_attestation","attest_author":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES/action/author_attestation","sign_citation":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES/action/citation_signature","submit_replication":"https://pith.science/pith/JSEA7DPVVULFSADJBKQVUFI5ES/action/replication_record"}},"created_at":"2026-07-05T03:29:37.934000+00:00","updated_at":"2026-07-05T03:29:37.934000+00:00"}