{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:KFBFHFLNQFEDHJEVF4275G7TDO","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":"776d30d3b145832a98030b431a1362858711aff3a54f075649195937102c313f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-14T19:43:43Z","title_canon_sha256":"6ae132f6c2b481ecf29d87f38937e2536ba5694a757dd7f5dc6ddfbe77a7d54a"},"schema_version":"1.0","source":{"id":"1612.04782","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1612.04782","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"arxiv_version","alias_value":"1612.04782v1","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04782","created_at":"2026-05-18T00:54:58Z"},{"alias_kind":"pith_short_12","alias_value":"KFBFHFLNQFED","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_16","alias_value":"KFBFHFLNQFEDHJEV","created_at":"2026-05-18T12:30:25Z"},{"alias_kind":"pith_short_8","alias_value":"KFBFHFLN","created_at":"2026-05-18T12:30:25Z"}],"graph_snapshots":[{"event_id":"sha256:5579584c1cefd4ae97ed6e6f5e131d5905c10c932dcf60cb448d79205dd54f66","target":"graph","created_at":"2026-05-18T00:54:58Z","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":"The perceptron algorithm for linear programming, arising from machine learning, has been around since the 1950s. While not a polynomial-time algorithm, it is useful in practice due to its simplicity and robustness. In 2004, Dunagan and Vempala showed that a randomized rescaling turns the perceptron method into a polynomial time algorithm, and later Pe\\~{n}a and Soheili gave a deterministic rescaling. In this paper, we give a deterministic rescaling for the perceptron algorithm that improves upon the previous rescaling methods by making it possible to rescale much earlier. This results in a fas","authors_text":"Rebecca Hoberg, Thomas Rothvoss","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-14T19:43:43Z","title":"An Improved Deterministic Rescaling for Linear Programming Algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04782","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:54766af4c51f216d60fd460a7db1b5ee2872accbb4302b936377ee7d806ec434","target":"record","created_at":"2026-05-18T00:54:58Z","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":"776d30d3b145832a98030b431a1362858711aff3a54f075649195937102c313f","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-14T19:43:43Z","title_canon_sha256":"6ae132f6c2b481ecf29d87f38937e2536ba5694a757dd7f5dc6ddfbe77a7d54a"},"schema_version":"1.0","source":{"id":"1612.04782","kind":"arxiv","version":1}},"canonical_sha256":"514253956d814833a4952f35fe9bf31b8d155fbc840c99edd60319afa4403549","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"514253956d814833a4952f35fe9bf31b8d155fbc840c99edd60319afa4403549","first_computed_at":"2026-05-18T00:54:58.623364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:54:58.623364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"OBabBYQWECVnVkfYLcVv3G2BsOETWj5r93w59AlY4WmN3dMyPTj1PGkve8rZismFYm0F9g/qn8LQJm49M5bhBA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:54:58.623870Z","signed_message":"canonical_sha256_bytes"},"source_id":"1612.04782","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:54766af4c51f216d60fd460a7db1b5ee2872accbb4302b936377ee7d806ec434","sha256:5579584c1cefd4ae97ed6e6f5e131d5905c10c932dcf60cb448d79205dd54f66"],"state_sha256":"4707ccfd700b27dde8307554e0df1fe0f85658fb6321d1583a33e0096a55440e"}