{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:K7CVI57USIMAEUSLTSBHTL4NJE","short_pith_number":"pith:K7CVI57U","schema_version":"1.0","canonical_sha256":"57c55477f4921802524b9c8279af8d49282794b0c5c895a2270397f1211cdaed","source":{"kind":"arxiv","id":"2011.14312","version":3},"attestation_state":"computed","paper":{"title":"An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hong T. M. Chu, Kim-Chuan Toh, Lei Yang, Ling Liang","submitted_at":"2020-11-29T08:41:44Z","abstract_excerpt":"We introduce a class of specially structured linear programming (LP) problems, which has favorable modeling capability for important application problems in different areas such as optimal transport, discrete tomography and economics. To solve these generally large-scale LP problems efficiently, we design an implementable inexact entropic proximal point algorithm (iEPPA) combined with an easy-to-implement dual block coordinate descent method as a subsolver. Unlike existing entropy-type proximal point algorithms, our iEPPA employs a more practically checkable stopping condition for solving the "},"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":"2011.14312","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-11-29T08:41:44Z","cross_cats_sorted":[],"title_canon_sha256":"ead0b63c65b6b6ba4ece14e2e744cfdf7a191828ca995cc56e4069a3fc0dd1e6","abstract_canon_sha256":"8a057c3f161cbe42172b6e8bb41d599b80a55305cccd432add6963cc1cb30c8a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:17:02.453402Z","signature_b64":"1su46MC69bndL5fT2AsjypSLUPIf5DZA8aItZsJJxkWVXjI6FXBCn9qrjQVeiAmcSh1nQiTuevsuL0dDv7LdDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"57c55477f4921802524b9c8279af8d49282794b0c5c895a2270397f1211cdaed","last_reissued_at":"2026-07-05T04:17:02.452976Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:17:02.452976Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Hong T. M. Chu, Kim-Chuan Toh, Lei Yang, Ling Liang","submitted_at":"2020-11-29T08:41:44Z","abstract_excerpt":"We introduce a class of specially structured linear programming (LP) problems, which has favorable modeling capability for important application problems in different areas such as optimal transport, discrete tomography and economics. To solve these generally large-scale LP problems efficiently, we design an implementable inexact entropic proximal point algorithm (iEPPA) combined with an easy-to-implement dual block coordinate descent method as a subsolver. Unlike existing entropy-type proximal point algorithms, our iEPPA employs a more practically checkable stopping condition for solving the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2011.14312","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2011.14312/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":"2011.14312","created_at":"2026-07-05T04:17:02.453034+00:00"},{"alias_kind":"arxiv_version","alias_value":"2011.14312v3","created_at":"2026-07-05T04:17:02.453034+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2011.14312","created_at":"2026-07-05T04:17:02.453034+00:00"},{"alias_kind":"pith_short_12","alias_value":"K7CVI57USIMA","created_at":"2026-07-05T04:17:02.453034+00:00"},{"alias_kind":"pith_short_16","alias_value":"K7CVI57USIMAEUSL","created_at":"2026-07-05T04:17:02.453034+00:00"},{"alias_kind":"pith_short_8","alias_value":"K7CVI57U","created_at":"2026-07-05T04:17:02.453034+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/K7CVI57USIMAEUSLTSBHTL4NJE","json":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE.json","graph_json":"https://pith.science/api/pith-number/K7CVI57USIMAEUSLTSBHTL4NJE/graph.json","events_json":"https://pith.science/api/pith-number/K7CVI57USIMAEUSLTSBHTL4NJE/events.json","paper":"https://pith.science/paper/K7CVI57U"},"agent_actions":{"view_html":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE","download_json":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE.json","view_paper":"https://pith.science/paper/K7CVI57U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2011.14312&json=true","fetch_graph":"https://pith.science/api/pith-number/K7CVI57USIMAEUSLTSBHTL4NJE/graph.json","fetch_events":"https://pith.science/api/pith-number/K7CVI57USIMAEUSLTSBHTL4NJE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE/action/storage_attestation","attest_author":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE/action/author_attestation","sign_citation":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE/action/citation_signature","submit_replication":"https://pith.science/pith/K7CVI57USIMAEUSLTSBHTL4NJE/action/replication_record"}},"created_at":"2026-07-05T04:17:02.453034+00:00","updated_at":"2026-07-05T04:17:02.453034+00:00"}