{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:F5EV6M4B4SWXNO4DR4RKWV3LQR","short_pith_number":"pith:F5EV6M4B","schema_version":"1.0","canonical_sha256":"2f495f3381e4ad76bb838f22ab576b8453669bc5212c0284ce29a05e9a6fbaab","source":{"kind":"arxiv","id":"1611.06427","version":5},"attestation_state":"computed","paper":{"title":"Rescaling Algorithms for Linear Conic Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Daniel Dadush, Giacomo Zambelli, L\\'aszl\\'o A. V\\'egh","submitted_at":"2016-11-19T20:38:23Z","abstract_excerpt":"We propose simple polynomial-time algorithms for two linear conic feasibility problems. For a matrix $A\\in \\mathbb{R}^{m\\times n}$, the kernel problem requires a positive vector in the kernel of $A$, and the image problem requires a positive vector in the image of $A^\\top$. Both algorithms iterate between simple first order steps and rescaling steps. These rescalings improve natural geometric potentials. If Goffin's condition measure $\\rho_A$ is negative, then the kernel problem is feasible and the worst-case complexity of the kernel algorithm is $O\\left((m^3n+mn^2)\\log{|\\rho_A|^{-1}}\\right)$;"},"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":"1611.06427","kind":"arxiv","version":5},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-19T20:38:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"e6e079b9dae47920f3436f413be008f9d2721ac09d3d30f785e352716033ba16","abstract_canon_sha256":"97b88b971d1cea69062b603d82caf2e36aca9d9d589c40c28bfa1322780a80f0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:49:12.220827Z","signature_b64":"AKdWZgHVIL/UknlgPRD9uqN4P4VRPHs3mOq+HMl0fr1PDdMlUta1Ss9q3cIolVgN8KVV43FjET7bOnssRStRAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2f495f3381e4ad76bb838f22ab576b8453669bc5212c0284ce29a05e9a6fbaab","last_reissued_at":"2026-05-17T23:49:12.220171Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:49:12.220171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rescaling Algorithms for Linear Conic Feasibility","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"math.OC","authors_text":"Daniel Dadush, Giacomo Zambelli, L\\'aszl\\'o A. V\\'egh","submitted_at":"2016-11-19T20:38:23Z","abstract_excerpt":"We propose simple polynomial-time algorithms for two linear conic feasibility problems. For a matrix $A\\in \\mathbb{R}^{m\\times n}$, the kernel problem requires a positive vector in the kernel of $A$, and the image problem requires a positive vector in the image of $A^\\top$. Both algorithms iterate between simple first order steps and rescaling steps. These rescalings improve natural geometric potentials. If Goffin's condition measure $\\rho_A$ is negative, then the kernel problem is feasible and the worst-case complexity of the kernel algorithm is $O\\left((m^3n+mn^2)\\log{|\\rho_A|^{-1}}\\right)$;"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06427","kind":"arxiv","version":5},"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":"1611.06427","created_at":"2026-05-17T23:49:12.220269+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.06427v5","created_at":"2026-05-17T23:49:12.220269+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06427","created_at":"2026-05-17T23:49:12.220269+00:00"},{"alias_kind":"pith_short_12","alias_value":"F5EV6M4B4SWX","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_16","alias_value":"F5EV6M4B4SWXNO4D","created_at":"2026-05-18T12:30:15.759754+00:00"},{"alias_kind":"pith_short_8","alias_value":"F5EV6M4B","created_at":"2026-05-18T12:30:15.759754+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/F5EV6M4B4SWXNO4DR4RKWV3LQR","json":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR.json","graph_json":"https://pith.science/api/pith-number/F5EV6M4B4SWXNO4DR4RKWV3LQR/graph.json","events_json":"https://pith.science/api/pith-number/F5EV6M4B4SWXNO4DR4RKWV3LQR/events.json","paper":"https://pith.science/paper/F5EV6M4B"},"agent_actions":{"view_html":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR","download_json":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR.json","view_paper":"https://pith.science/paper/F5EV6M4B","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.06427&json=true","fetch_graph":"https://pith.science/api/pith-number/F5EV6M4B4SWXNO4DR4RKWV3LQR/graph.json","fetch_events":"https://pith.science/api/pith-number/F5EV6M4B4SWXNO4DR4RKWV3LQR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/action/storage_attestation","attest_author":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/action/author_attestation","sign_citation":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/action/citation_signature","submit_replication":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/action/replication_record"}},"created_at":"2026-05-17T23:49:12.220269+00:00","updated_at":"2026-05-17T23:49:12.220269+00:00"}