{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:SX6U6GSXHRTUNCQHKT7SKSD6QR","short_pith_number":"pith:SX6U6GSX","canonical_record":{"source":{"id":"1608.00020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-29T20:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"e29f318309134db6c8a0f9c6f7f7bdc1d8e1b9b212725686201b36a05c8561bd","abstract_canon_sha256":"7a938443e4968bf75b552e8082e53b40801a47c33b11cc61fcf4721f5a436c5c"},"schema_version":"1.0"},"canonical_sha256":"95fd4f1a573c67468a0754ff25487e846e27bf0aa1e9c7e1a11102d398f29d49","source":{"kind":"arxiv","id":"1608.00020","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00020","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00020v1","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00020","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"SX6U6GSXHRTU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SX6U6GSXHRTUNCQH","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SX6U6GSX","created_at":"2026-05-18T12:30:44Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:SX6U6GSXHRTUNCQHKT7SKSD6QR","target":"record","payload":{"canonical_record":{"source":{"id":"1608.00020","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-29T20:19:38Z","cross_cats_sorted":[],"title_canon_sha256":"e29f318309134db6c8a0f9c6f7f7bdc1d8e1b9b212725686201b36a05c8561bd","abstract_canon_sha256":"7a938443e4968bf75b552e8082e53b40801a47c33b11cc61fcf4721f5a436c5c"},"schema_version":"1.0"},"canonical_sha256":"95fd4f1a573c67468a0754ff25487e846e27bf0aa1e9c7e1a11102d398f29d49","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:10:13.995146Z","signature_b64":"LG1ZijHURFbJjDvUxXoBa3M6mHdv85fVcTWcdy/Nx5bd7J0wg75Mn5Ni8ooSNabzRLWlqsIDMybd0D8rThWZCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95fd4f1a573c67468a0754ff25487e846e27bf0aa1e9c7e1a11102d398f29d49","last_reissued_at":"2026-05-18T01:10:13.994744Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:10:13.994744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1608.00020","source_version":1,"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-18T01:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EPrBik+6aQQOmh0CpWlbvaI/lqMSqiZk7qCMNNcfL3kfDdDRDMVExq4rUOqV8AA+za/qAt2RHKiLFuilb6Q0Aw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:47:14.956626Z"},"content_sha256":"da8ef6c99880d4a373f2c7716e2fcaf48d90007406b5434a060dbb945a3f9618","schema_version":"1.0","event_id":"sha256:da8ef6c99880d4a373f2c7716e2fcaf48d90007406b5434a060dbb945a3f9618"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:SX6U6GSXHRTUNCQHKT7SKSD6QR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An inexact potential reduction method for linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Jacek Gondzio, Lukas Schork","submitted_at":"2016-07-29T20:19:38Z","abstract_excerpt":"A class of interior point methods using inexact directions is analysed. The linear system arising in interior point methods for linear programming is reformulated such that the solution is less sensitive to perturbations in the right-hand side. For the new system an implementable condition is formulated that controls the relative error in the solution. Based on this condition, a feasible and an infeasible potential reduction method are described which retain the convergence and complexity bounds known for exact directions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00020","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"},"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-18T01:10:13Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V1cF9h4+qbfXTvASwMgaO39TgaYHFN9VaaobaIDze4SWTGokKSmvV8CRSEBL42XTI2IShf7bY8pOC+vPriyMBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T22:47:14.957243Z"},"content_sha256":"5968d3ec15d6c95957a4f80b3ad59c2df162c05f31021905517310f625029e22","schema_version":"1.0","event_id":"sha256:5968d3ec15d6c95957a4f80b3ad59c2df162c05f31021905517310f625029e22"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SX6U6GSXHRTUNCQHKT7SKSD6QR/bundle.json","state_url":"https://pith.science/pith/SX6U6GSXHRTUNCQHKT7SKSD6QR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SX6U6GSXHRTUNCQHKT7SKSD6QR/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-06-06T22:47:14Z","links":{"resolver":"https://pith.science/pith/SX6U6GSXHRTUNCQHKT7SKSD6QR","bundle":"https://pith.science/pith/SX6U6GSXHRTUNCQHKT7SKSD6QR/bundle.json","state":"https://pith.science/pith/SX6U6GSXHRTUNCQHKT7SKSD6QR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SX6U6GSXHRTUNCQHKT7SKSD6QR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:SX6U6GSXHRTUNCQHKT7SKSD6QR","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":"7a938443e4968bf75b552e8082e53b40801a47c33b11cc61fcf4721f5a436c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-29T20:19:38Z","title_canon_sha256":"e29f318309134db6c8a0f9c6f7f7bdc1d8e1b9b212725686201b36a05c8561bd"},"schema_version":"1.0","source":{"id":"1608.00020","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1608.00020","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"arxiv_version","alias_value":"1608.00020v1","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1608.00020","created_at":"2026-05-18T01:10:13Z"},{"alias_kind":"pith_short_12","alias_value":"SX6U6GSXHRTU","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_16","alias_value":"SX6U6GSXHRTUNCQH","created_at":"2026-05-18T12:30:44Z"},{"alias_kind":"pith_short_8","alias_value":"SX6U6GSX","created_at":"2026-05-18T12:30:44Z"}],"graph_snapshots":[{"event_id":"sha256:5968d3ec15d6c95957a4f80b3ad59c2df162c05f31021905517310f625029e22","target":"graph","created_at":"2026-05-18T01:10:13Z","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":"A class of interior point methods using inexact directions is analysed. The linear system arising in interior point methods for linear programming is reformulated such that the solution is less sensitive to perturbations in the right-hand side. For the new system an implementable condition is formulated that controls the relative error in the solution. Based on this condition, a feasible and an infeasible potential reduction method are described which retain the convergence and complexity bounds known for exact directions.","authors_text":"Jacek Gondzio, Lukas Schork","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-29T20:19:38Z","title":"An inexact potential reduction method for linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1608.00020","kind":"arxiv","version":1},"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:da8ef6c99880d4a373f2c7716e2fcaf48d90007406b5434a060dbb945a3f9618","target":"record","created_at":"2026-05-18T01:10:13Z","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":"7a938443e4968bf75b552e8082e53b40801a47c33b11cc61fcf4721f5a436c5c","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2016-07-29T20:19:38Z","title_canon_sha256":"e29f318309134db6c8a0f9c6f7f7bdc1d8e1b9b212725686201b36a05c8561bd"},"schema_version":"1.0","source":{"id":"1608.00020","kind":"arxiv","version":1}},"canonical_sha256":"95fd4f1a573c67468a0754ff25487e846e27bf0aa1e9c7e1a11102d398f29d49","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95fd4f1a573c67468a0754ff25487e846e27bf0aa1e9c7e1a11102d398f29d49","first_computed_at":"2026-05-18T01:10:13.994744Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:10:13.994744Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LG1ZijHURFbJjDvUxXoBa3M6mHdv85fVcTWcdy/Nx5bd7J0wg75Mn5Ni8ooSNabzRLWlqsIDMybd0D8rThWZCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:10:13.995146Z","signed_message":"canonical_sha256_bytes"},"source_id":"1608.00020","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:da8ef6c99880d4a373f2c7716e2fcaf48d90007406b5434a060dbb945a3f9618","sha256:5968d3ec15d6c95957a4f80b3ad59c2df162c05f31021905517310f625029e22"],"state_sha256":"98bb67d8832a4f3e88b25c963a98e43a6dd3fa530a97c441b965a8261119031e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"f4TNftAvkZKlY+s0Jed6F3ahYANQaM5rcv9Xk0Xxdzsyh9JqpV0mZnqt/UofoS9BXtzyZzqOpK1QliMTKbTYDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T22:47:14.960440Z","bundle_sha256":"6c7be685701b8872a4bd43658b573944e6cc05da961cf45f2c935fbf1e478d85"}}