{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:KFBFHFLNQFEDHJEVF4275G7TDO","short_pith_number":"pith:KFBFHFLN","schema_version":"1.0","canonical_sha256":"514253956d814833a4952f35fe9bf31b8d155fbc840c99edd60319afa4403549","source":{"kind":"arxiv","id":"1612.04782","version":1},"attestation_state":"computed","paper":{"title":"An Improved Deterministic Rescaling for Linear Programming Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Rebecca Hoberg, Thomas Rothvoss","submitted_at":"2016-12-14T19:43:43Z","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"},"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":"1612.04782","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-12-14T19:43:43Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"6ae132f6c2b481ecf29d87f38937e2536ba5694a757dd7f5dc6ddfbe77a7d54a","abstract_canon_sha256":"776d30d3b145832a98030b431a1362858711aff3a54f075649195937102c313f"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:54:58.623870Z","signature_b64":"OBabBYQWECVnVkfYLcVv3G2BsOETWj5r93w59AlY4WmN3dMyPTj1PGkve8rZismFYm0F9g/qn8LQJm49M5bhBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"514253956d814833a4952f35fe9bf31b8d155fbc840c99edd60319afa4403549","last_reissued_at":"2026-05-18T00:54:58.623364Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:54:58.623364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An Improved Deterministic Rescaling for Linear Programming Algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Rebecca Hoberg, Thomas Rothvoss","submitted_at":"2016-12-14T19:43:43Z","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"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1612.04782","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":"1612.04782","created_at":"2026-05-18T00:54:58.623444+00:00"},{"alias_kind":"arxiv_version","alias_value":"1612.04782v1","created_at":"2026-05-18T00:54:58.623444+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1612.04782","created_at":"2026-05-18T00:54:58.623444+00:00"},{"alias_kind":"pith_short_12","alias_value":"KFBFHFLNQFED","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"KFBFHFLNQFEDHJEV","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"KFBFHFLN","created_at":"2026-05-18T12:30:25.849896+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/KFBFHFLNQFEDHJEVF4275G7TDO","json":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO.json","graph_json":"https://pith.science/api/pith-number/KFBFHFLNQFEDHJEVF4275G7TDO/graph.json","events_json":"https://pith.science/api/pith-number/KFBFHFLNQFEDHJEVF4275G7TDO/events.json","paper":"https://pith.science/paper/KFBFHFLN"},"agent_actions":{"view_html":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO","download_json":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO.json","view_paper":"https://pith.science/paper/KFBFHFLN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1612.04782&json=true","fetch_graph":"https://pith.science/api/pith-number/KFBFHFLNQFEDHJEVF4275G7TDO/graph.json","fetch_events":"https://pith.science/api/pith-number/KFBFHFLNQFEDHJEVF4275G7TDO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO/action/storage_attestation","attest_author":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO/action/author_attestation","sign_citation":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO/action/citation_signature","submit_replication":"https://pith.science/pith/KFBFHFLNQFEDHJEVF4275G7TDO/action/replication_record"}},"created_at":"2026-05-18T00:54:58.623444+00:00","updated_at":"2026-05-18T00:54:58.623444+00:00"}