{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:DPDJBQDEBGC2N3BFVFJE7S3OH3","short_pith_number":"pith:DPDJBQDE","canonical_record":{"source":{"id":"1810.04517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T13:27:02Z","cross_cats_sorted":["cs.DS","math.NA"],"title_canon_sha256":"dfdf443b8c3f3b502a846ffd2777e00826979e462382c874281345eb2f3a064d","abstract_canon_sha256":"5cbfb1cd2f1f805f45b7f294d26d06407a98ea54d2cab6d33259eb913de83c86"},"schema_version":"1.0"},"canonical_sha256":"1bc690c0640985a6ec25a9524fcb6e3ee27c475df6c7d2d204625979b4d39630","source":{"kind":"arxiv","id":"1810.04517","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04517","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04517v1","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04517","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"DPDJBQDEBGC2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPDJBQDEBGC2N3BF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPDJBQDE","created_at":"2026-05-18T12:32:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:DPDJBQDEBGC2N3BFVFJE7S3OH3","target":"record","payload":{"canonical_record":{"source":{"id":"1810.04517","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T13:27:02Z","cross_cats_sorted":["cs.DS","math.NA"],"title_canon_sha256":"dfdf443b8c3f3b502a846ffd2777e00826979e462382c874281345eb2f3a064d","abstract_canon_sha256":"5cbfb1cd2f1f805f45b7f294d26d06407a98ea54d2cab6d33259eb913de83c86"},"schema_version":"1.0"},"canonical_sha256":"1bc690c0640985a6ec25a9524fcb6e3ee27c475df6c7d2d204625979b4d39630","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:39.885419Z","signature_b64":"BqzFYw7iZMslQdqDeJu07n1r2LvHc3gUuhKmol++gdUtS+OZng6FNuOPZysyJoHRJfRzJUZPzlZYwj9Gg76yBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc690c0640985a6ec25a9524fcb6e3ee27c475df6c7d2d204625979b4d39630","last_reissued_at":"2026-05-18T00:03:39.884892Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:39.884892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.04517","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AFfhZC0TU/Iohf6k4fSNjp9UN0IKO1EXiyT+GUBEJ3LVS9mi70lQrNqbumtmaKug4rKDJG7nbsUn4gDMcbgcBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:56:12.920060Z"},"content_sha256":"c822c6366a0a98667131864bcad07f39d741a834a803da480c09e078f513e93a","schema_version":"1.0","event_id":"sha256:c822c6366a0a98667131864bcad07f39d741a834a803da480c09e078f513e93a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:DPDJBQDEBGC2N3BFVFJE7S3OH3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Fast Polynomial-time Primal-Dual Projection Algorithm for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS","math.NA"],"primary_cat":"math.OC","authors_text":"Kees Roos, Wei Zhang, Zhize Li","submitted_at":"2018-10-10T13:27:02Z","abstract_excerpt":"Traditionally, there are several polynomial algorithms for linear programming including the ellipsoid method, the interior point method and other variants. Recently, Chubanov [Chubanov, 2015] proposed a projection and rescaling algorithm, which has become a potentially \\emph{practical} class of polynomial algorithms for linear feasibility problems and also for the general linear programming. However, the Chubanov-type algorithms usually perform much better on the infeasible instances than on the feasible instances in practice. To explain this phenomenon, we derive a new theoretical complexity "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04517","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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T00:03:39Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"tYhQMPPqexI+vJSR/xRKh+jSLFYpahAw5tF9JkODDlHwkWnlxDxz+2T2ikIWUUn2pJ49V5ZYm4qOfQ6UxN3XBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-29T17:56:12.920729Z"},"content_sha256":"5fc1a638e19b22a149bd7672352aada1803faa1c9a91aaf3a5f7a07fd82766ba","schema_version":"1.0","event_id":"sha256:5fc1a638e19b22a149bd7672352aada1803faa1c9a91aaf3a5f7a07fd82766ba"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DPDJBQDEBGC2N3BFVFJE7S3OH3/bundle.json","state_url":"https://pith.science/pith/DPDJBQDEBGC2N3BFVFJE7S3OH3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DPDJBQDEBGC2N3BFVFJE7S3OH3/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-29T17:56:12Z","links":{"resolver":"https://pith.science/pith/DPDJBQDEBGC2N3BFVFJE7S3OH3","bundle":"https://pith.science/pith/DPDJBQDEBGC2N3BFVFJE7S3OH3/bundle.json","state":"https://pith.science/pith/DPDJBQDEBGC2N3BFVFJE7S3OH3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DPDJBQDEBGC2N3BFVFJE7S3OH3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:DPDJBQDEBGC2N3BFVFJE7S3OH3","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5cbfb1cd2f1f805f45b7f294d26d06407a98ea54d2cab6d33259eb913de83c86","cross_cats_sorted":["cs.DS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T13:27:02Z","title_canon_sha256":"dfdf443b8c3f3b502a846ffd2777e00826979e462382c874281345eb2f3a064d"},"schema_version":"1.0","source":{"id":"1810.04517","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.04517","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"arxiv_version","alias_value":"1810.04517v1","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.04517","created_at":"2026-05-18T00:03:39Z"},{"alias_kind":"pith_short_12","alias_value":"DPDJBQDEBGC2","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_16","alias_value":"DPDJBQDEBGC2N3BF","created_at":"2026-05-18T12:32:19Z"},{"alias_kind":"pith_short_8","alias_value":"DPDJBQDE","created_at":"2026-05-18T12:32:19Z"}],"graph_snapshots":[{"event_id":"sha256:5fc1a638e19b22a149bd7672352aada1803faa1c9a91aaf3a5f7a07fd82766ba","target":"graph","created_at":"2026-05-18T00:03:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"Traditionally, there are several polynomial algorithms for linear programming including the ellipsoid method, the interior point method and other variants. Recently, Chubanov [Chubanov, 2015] proposed a projection and rescaling algorithm, which has become a potentially \\emph{practical} class of polynomial algorithms for linear feasibility problems and also for the general linear programming. However, the Chubanov-type algorithms usually perform much better on the infeasible instances than on the feasible instances in practice. To explain this phenomenon, we derive a new theoretical complexity ","authors_text":"Kees Roos, Wei Zhang, Zhize Li","cross_cats":["cs.DS","math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T13:27:02Z","title":"A Fast Polynomial-time Primal-Dual Projection Algorithm for Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.04517","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c822c6366a0a98667131864bcad07f39d741a834a803da480c09e078f513e93a","target":"record","created_at":"2026-05-18T00:03:39Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5cbfb1cd2f1f805f45b7f294d26d06407a98ea54d2cab6d33259eb913de83c86","cross_cats_sorted":["cs.DS","math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2018-10-10T13:27:02Z","title_canon_sha256":"dfdf443b8c3f3b502a846ffd2777e00826979e462382c874281345eb2f3a064d"},"schema_version":"1.0","source":{"id":"1810.04517","kind":"arxiv","version":1}},"canonical_sha256":"1bc690c0640985a6ec25a9524fcb6e3ee27c475df6c7d2d204625979b4d39630","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1bc690c0640985a6ec25a9524fcb6e3ee27c475df6c7d2d204625979b4d39630","first_computed_at":"2026-05-18T00:03:39.884892Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:39.884892Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"BqzFYw7iZMslQdqDeJu07n1r2LvHc3gUuhKmol++gdUtS+OZng6FNuOPZysyJoHRJfRzJUZPzlZYwj9Gg76yBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:39.885419Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.04517","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c822c6366a0a98667131864bcad07f39d741a834a803da480c09e078f513e93a","sha256:5fc1a638e19b22a149bd7672352aada1803faa1c9a91aaf3a5f7a07fd82766ba"],"state_sha256":"ca3d3fc9a2d2151eb4da27319cf4eadc7cfd5111f8cd0007034d6602481366fb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Kjn85mQVSQ1Wko5NmJNbTZwaB2g0jMAQcjI75WHrGyqlfktLHF8fZ1ErFLQOpEoGPQD3nk8UffM9IbdFwq7BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-29T17:56:12.923423Z","bundle_sha256":"e8f5ed7fa40c59b3672ead7ea7d2fb212f64f007c7727abeedeecc412d06652e"}}