{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:ZCYBLPYMKSMZKW5YPRZVWM7KNQ","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":"1426736039cddfaac3fd2cbd31524c0156fb9a6b30f4aa28790cbf4f3bc7e848","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-16T16:34:24Z","title_canon_sha256":"5c1119223b4e4dcfa5d3d71f7a1c15609dee1a71e2661f5ab5a6c451e34899f8"},"schema_version":"1.0","source":{"id":"1307.4334","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1307.4334","created_at":"2026-05-18T03:05:25Z"},{"alias_kind":"arxiv_version","alias_value":"1307.4334v3","created_at":"2026-05-18T03:05:25Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1307.4334","created_at":"2026-05-18T03:05:25Z"},{"alias_kind":"pith_short_12","alias_value":"ZCYBLPYMKSMZ","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_16","alias_value":"ZCYBLPYMKSMZKW5Y","created_at":"2026-05-18T12:28:09Z"},{"alias_kind":"pith_short_8","alias_value":"ZCYBLPYM","created_at":"2026-05-18T12:28:09Z"}],"graph_snapshots":[{"event_id":"sha256:baee4414e11aab9875e3a7b07c7cd20f54cf54e732c36004633845aa9d51196d","target":"graph","created_at":"2026-05-18T03:05:25Z","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":"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].","authors_text":"Giacomo Zambelli, L\\'aszl\\'o A. V\\'egh","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-16T16:34:24Z","title":"A polynomial projection-type algorithm for linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1307.4334","kind":"arxiv","version":3},"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:a15706da48b82159eb0678cafb88179460f410355706e77db75d9ba5e2de9314","target":"record","created_at":"2026-05-18T03:05:25Z","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":"1426736039cddfaac3fd2cbd31524c0156fb9a6b30f4aa28790cbf4f3bc7e848","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2013-07-16T16:34:24Z","title_canon_sha256":"5c1119223b4e4dcfa5d3d71f7a1c15609dee1a71e2661f5ab5a6c451e34899f8"},"schema_version":"1.0","source":{"id":"1307.4334","kind":"arxiv","version":3}},"canonical_sha256":"c8b015bf0c5499955bb87c735b33ea6c149f9861d5c21d38cd7e534fa6933486","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"c8b015bf0c5499955bb87c735b33ea6c149f9861d5c21d38cd7e534fa6933486","first_computed_at":"2026-05-18T03:05:25.924982Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:05:25.924982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"qZdkNVicSYNbMEGwr0NfC3GLOazYBfZQ94v/UXgD5SNGMcR2KIinExRnXRwRaE7aNJ2X+eozYpkBam+vfEIKCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:05:25.925686Z","signed_message":"canonical_sha256_bytes"},"source_id":"1307.4334","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a15706da48b82159eb0678cafb88179460f410355706e77db75d9ba5e2de9314","sha256:baee4414e11aab9875e3a7b07c7cd20f54cf54e732c36004633845aa9d51196d"],"state_sha256":"17fd91eb9d4c3d64eb30a5b68b19e95eff6c4ac7b954e9df94f7ae0861699c3b"}