{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:ZCYBLPYMKSMZKW5YPRZVWM7KNQ","short_pith_number":"pith:ZCYBLPYM","schema_version":"1.0","canonical_sha256":"c8b015bf0c5499955bb87c735b33ea6c149f9861d5c21d38cd7e534fa6933486","source":{"kind":"arxiv","id":"1307.4334","version":3},"attestation_state":"computed","paper":{"title":"A polynomial projection-type algorithm for linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Giacomo Zambelli, L\\'aszl\\'o A. V\\'egh","submitted_at":"2013-07-16T16:34:24Z","abstract_excerpt":"We propose a simple O([n^5/\\log n]L) algorithm for linear programming feasibility, that can be considered as a polynomial-time implementation of the relaxation method. Our work draws from Chubanov's \"Divide-and-Conquer\" algorithm [4], where the recursion is replaced by a simple and more efficient iterative method. A similar approach was used in a more recent paper of Chubanov [6]."},"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":"1307.4334","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-16T16:34:24Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"5c1119223b4e4dcfa5d3d71f7a1c15609dee1a71e2661f5ab5a6c451e34899f8","abstract_canon_sha256":"1426736039cddfaac3fd2cbd31524c0156fb9a6b30f4aa28790cbf4f3bc7e848"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:05:25.925686Z","signature_b64":"qZdkNVicSYNbMEGwr0NfC3GLOazYBfZQ94v/UXgD5SNGMcR2KIinExRnXRwRaE7aNJ2X+eozYpkBam+vfEIKCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c8b015bf0c5499955bb87c735b33ea6c149f9861d5c21d38cd7e534fa6933486","last_reissued_at":"2026-05-18T03:05:25.924982Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:05:25.924982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A polynomial projection-type algorithm for linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Giacomo Zambelli, L\\'aszl\\'o A. V\\'egh","submitted_at":"2013-07-16T16:34:24Z","abstract_excerpt":"We propose a simple O([n^5/\\log n]L) algorithm for linear programming feasibility, that can be considered as a polynomial-time implementation of the relaxation method. Our work draws from Chubanov's \"Divide-and-Conquer\" algorithm [4], where the recursion is replaced by a simple and more efficient iterative method. A similar approach was used in a more recent paper of Chubanov [6]."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4334","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":""},"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":"1307.4334","created_at":"2026-05-18T03:05:25.925098+00:00"},{"alias_kind":"arxiv_version","alias_value":"1307.4334v3","created_at":"2026-05-18T03:05:25.925098+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4334","created_at":"2026-05-18T03:05:25.925098+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZCYBLPYMKSMZ","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZCYBLPYMKSMZKW5Y","created_at":"2026-05-18T12:28:09.283467+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZCYBLPYM","created_at":"2026-05-18T12:28:09.283467+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/ZCYBLPYMKSMZKW5YPRZVWM7KNQ","json":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ.json","graph_json":"https://pith.science/api/pith-number/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/graph.json","events_json":"https://pith.science/api/pith-number/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/events.json","paper":"https://pith.science/paper/ZCYBLPYM"},"agent_actions":{"view_html":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ","download_json":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ.json","view_paper":"https://pith.science/paper/ZCYBLPYM","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1307.4334&json=true","fetch_graph":"https://pith.science/api/pith-number/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/graph.json","fetch_events":"https://pith.science/api/pith-number/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/action/storage_attestation","attest_author":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/action/author_attestation","sign_citation":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/action/citation_signature","submit_replication":"https://pith.science/pith/ZCYBLPYMKSMZKW5YPRZVWM7KNQ/action/replication_record"}},"created_at":"2026-05-18T03:05:25.925098+00:00","updated_at":"2026-05-18T03:05:25.925098+00:00"}