{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:F5EV6M4B4SWXNO4DR4RKWV3LQR","short_pith_number":"pith:F5EV6M4B","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"},"canonical_sha256":"2f495f3381e4ad76bb838f22ab576b8453669bc5212c0284ce29a05e9a6fbaab","source":{"kind":"arxiv","id":"1611.06427","version":5},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06427","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06427v5","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06427","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"pith_short_12","alias_value":"F5EV6M4B4SWX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5EV6M4B4SWXNO4D","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5EV6M4B","created_at":"2026-05-18T12:30:15Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:F5EV6M4B4SWXNO4DR4RKWV3LQR","target":"record","payload":{"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"},"canonical_sha256":"2f495f3381e4ad76bb838f22ab576b8453669bc5212c0284ce29a05e9a6fbaab","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"},"source_kind":"arxiv","source_id":"1611.06427","source_version":5,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ibTeayVU16NBlUZXpq01NdQFKuuVm+m4PU/2vf+NXOEDQRp70zpaM0Q4cnI7rOXHM9hbBh9/ueaMvHtEWZz1CA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:42.505744Z"},"content_sha256":"b7231a49fddfa0f8e898aa93fb86b740814b7713c88a4177b903180f2212f7b7","schema_version":"1.0","event_id":"sha256:b7231a49fddfa0f8e898aa93fb86b740814b7713c88a4177b903180f2212f7b7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:F5EV6M4B4SWXNO4DR4RKWV3LQR","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:49:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kWJYwkZZ5WF9uE/csGbTrRUafBcXDrsiDqBxr5hCVuSrI/p65qs32JS3R7zdxlCAvZ8zt3bLHKztP9cjCWvRDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-25T15:24:42.506423Z"},"content_sha256":"514466a70a26573533c64d44e6832dd0cda2c1bf685a8755c0ecb5b79a6bb0dc","schema_version":"1.0","event_id":"sha256:514466a70a26573533c64d44e6832dd0cda2c1bf685a8755c0ecb5b79a6bb0dc"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/bundle.json","state_url":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-25T15:24:42Z","links":{"resolver":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR","bundle":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/bundle.json","state":"https://pith.science/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/F5EV6M4B4SWXNO4DR4RKWV3LQR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:F5EV6M4B4SWXNO4DR4RKWV3LQR","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":"97b88b971d1cea69062b603d82caf2e36aca9d9d589c40c28bfa1322780a80f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-19T20:38:23Z","title_canon_sha256":"e6e079b9dae47920f3436f413be008f9d2721ac09d3d30f785e352716033ba16"},"schema_version":"1.0","source":{"id":"1611.06427","kind":"arxiv","version":5}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06427","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06427v5","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06427","created_at":"2026-05-17T23:49:12Z"},{"alias_kind":"pith_short_12","alias_value":"F5EV6M4B4SWX","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_16","alias_value":"F5EV6M4B4SWXNO4D","created_at":"2026-05-18T12:30:15Z"},{"alias_kind":"pith_short_8","alias_value":"F5EV6M4B","created_at":"2026-05-18T12:30:15Z"}],"graph_snapshots":[{"event_id":"sha256:514466a70a26573533c64d44e6832dd0cda2c1bf685a8755c0ecb5b79a6bb0dc","target":"graph","created_at":"2026-05-17T23:49:12Z","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 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)$;","authors_text":"Daniel Dadush, 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":"2016-11-19T20:38:23Z","title":"Rescaling Algorithms for Linear Conic Feasibility"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06427","kind":"arxiv","version":5},"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:b7231a49fddfa0f8e898aa93fb86b740814b7713c88a4177b903180f2212f7b7","target":"record","created_at":"2026-05-17T23:49:12Z","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":"97b88b971d1cea69062b603d82caf2e36aca9d9d589c40c28bfa1322780a80f0","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-11-19T20:38:23Z","title_canon_sha256":"e6e079b9dae47920f3436f413be008f9d2721ac09d3d30f785e352716033ba16"},"schema_version":"1.0","source":{"id":"1611.06427","kind":"arxiv","version":5}},"canonical_sha256":"2f495f3381e4ad76bb838f22ab576b8453669bc5212c0284ce29a05e9a6fbaab","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2f495f3381e4ad76bb838f22ab576b8453669bc5212c0284ce29a05e9a6fbaab","first_computed_at":"2026-05-17T23:49:12.220171Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:49:12.220171Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"AKdWZgHVIL/UknlgPRD9uqN4P4VRPHs3mOq+HMl0fr1PDdMlUta1Ss9q3cIolVgN8KVV43FjET7bOnssRStRAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:49:12.220827Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06427","source_kind":"arxiv","source_version":5}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b7231a49fddfa0f8e898aa93fb86b740814b7713c88a4177b903180f2212f7b7","sha256:514466a70a26573533c64d44e6832dd0cda2c1bf685a8755c0ecb5b79a6bb0dc"],"state_sha256":"cee38e8405a5f1f9e9f7dbd89f9ba4a7730532054bb0506d5947ff6d904b3aa1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"w17BylMVKGcKESxKBaFA7nq5NQJsu2Ys3zIgUo5n2pxz9h06C9vk3Es35FaE4CeouowGUdUfveiUOyb0ip+GDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-25T15:24:42.510185Z","bundle_sha256":"baa79bb1bc59f1958956dd8cd2a7ef7eeaa6113ffd0ea44b0b5ad07f7e35277e"}}