{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:PJKHCONCYYCSNOHQOSS6FU3CC2","short_pith_number":"pith:PJKHCONC","canonical_record":{"source":{"id":"1506.06365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-21T13:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"c42234291c73b7cbb21aef2f134b4586c7b2b09cf4a05eaa84b443f1cce0fd4c","abstract_canon_sha256":"2222ff3946631318c10b033a914d7bd9efd23b68aa9913008991742d412c86b7"},"schema_version":"1.0"},"canonical_sha256":"7a547139a2c60526b8f074a5e2d36216bb53e61905129bd0431557becec4bd34","source":{"kind":"arxiv","id":"1506.06365","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06365","created_at":"2026-05-18T00:15:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06365v2","created_at":"2026-05-18T00:15:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06365","created_at":"2026-05-18T00:15:10Z"},{"alias_kind":"pith_short_12","alias_value":"PJKHCONCYYCS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJKHCONCYYCSNOHQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJKHCONC","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:PJKHCONCYYCSNOHQOSS6FU3CC2","target":"record","payload":{"canonical_record":{"source":{"id":"1506.06365","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-21T13:55:03Z","cross_cats_sorted":[],"title_canon_sha256":"c42234291c73b7cbb21aef2f134b4586c7b2b09cf4a05eaa84b443f1cce0fd4c","abstract_canon_sha256":"2222ff3946631318c10b033a914d7bd9efd23b68aa9913008991742d412c86b7"},"schema_version":"1.0"},"canonical_sha256":"7a547139a2c60526b8f074a5e2d36216bb53e61905129bd0431557becec4bd34","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:10.884769Z","signature_b64":"75ZSyowkbowpTlAQh4aMSBzOm4nQSKmJrr8zfw2dHG4huQc+8SnfqUUNojCjYwafOnndClM1Sas3dBMGJgzCAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7a547139a2c60526b8f074a5e2d36216bb53e61905129bd0431557becec4bd34","last_reissued_at":"2026-05-18T00:15:10.884013Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:10.884013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1506.06365","source_version":2,"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-18T00:15:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"V0fXCP6hhWS4fAdKc6u4ZRphf1c3gZalHuI7puXlDPLtX2rWjAIK7LEPwvaO+IC0zzIJ5+p4+4j7BXZDnYrECA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:37:23.979296Z"},"content_sha256":"93af5448d43b1e9d3903ed9e223127ea684f2a1e50e7c69006acbe4ee2a0c002","schema_version":"1.0","event_id":"sha256:93af5448d43b1e9d3903ed9e223127ea684f2a1e50e7c69006acbe4ee2a0c002"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:PJKHCONCYYCSNOHQOSS6FU3CC2","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"An ${\\cal O}(nL)$ Infeasible-Interior-Point Algorithm for Linear Programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"Makoto Yamashita, Yaguang Yang","submitted_at":"2015-06-21T13:55:03Z","abstract_excerpt":"In this paper, we propose an arc-search infeasible-interior-point algorithm. We show that this algorithm is polynomial and the polynomial bound is ${\\cal O}(nL)$ which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06365","kind":"arxiv","version":2},"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-18T00:15:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"49ciCQOmb2lPEpikiyzfkcTwGuM06qDMhB9lG5UTAO7X6TkZeKxN7OUxVZ0o8X7s5NxgPQXDpG/oALBKUUDuDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T09:37:23.979658Z"},"content_sha256":"61c561dbae538c1b96e84a6d72794063b21eb9632b4f9ba698429b2dc6a10941","schema_version":"1.0","event_id":"sha256:61c561dbae538c1b96e84a6d72794063b21eb9632b4f9ba698429b2dc6a10941"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PJKHCONCYYCSNOHQOSS6FU3CC2/bundle.json","state_url":"https://pith.science/pith/PJKHCONCYYCSNOHQOSS6FU3CC2/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PJKHCONCYYCSNOHQOSS6FU3CC2/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-11T09:37:23Z","links":{"resolver":"https://pith.science/pith/PJKHCONCYYCSNOHQOSS6FU3CC2","bundle":"https://pith.science/pith/PJKHCONCYYCSNOHQOSS6FU3CC2/bundle.json","state":"https://pith.science/pith/PJKHCONCYYCSNOHQOSS6FU3CC2/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PJKHCONCYYCSNOHQOSS6FU3CC2/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:PJKHCONCYYCSNOHQOSS6FU3CC2","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":"2222ff3946631318c10b033a914d7bd9efd23b68aa9913008991742d412c86b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-21T13:55:03Z","title_canon_sha256":"c42234291c73b7cbb21aef2f134b4586c7b2b09cf4a05eaa84b443f1cce0fd4c"},"schema_version":"1.0","source":{"id":"1506.06365","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1506.06365","created_at":"2026-05-18T00:15:10Z"},{"alias_kind":"arxiv_version","alias_value":"1506.06365v2","created_at":"2026-05-18T00:15:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1506.06365","created_at":"2026-05-18T00:15:10Z"},{"alias_kind":"pith_short_12","alias_value":"PJKHCONCYYCS","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"PJKHCONCYYCSNOHQ","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"PJKHCONC","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:61c561dbae538c1b96e84a6d72794063b21eb9632b4f9ba698429b2dc6a10941","target":"graph","created_at":"2026-05-18T00:15:10Z","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":"In this paper, we propose an arc-search infeasible-interior-point algorithm. We show that this algorithm is polynomial and the polynomial bound is ${\\cal O}(nL)$ which is at least as good as the best existing bound for infeasible-interior-point algorithms for linear programming.","authors_text":"Makoto Yamashita, Yaguang Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-21T13:55:03Z","title":"An ${\\cal O}(nL)$ Infeasible-Interior-Point Algorithm for Linear Programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1506.06365","kind":"arxiv","version":2},"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:93af5448d43b1e9d3903ed9e223127ea684f2a1e50e7c69006acbe4ee2a0c002","target":"record","created_at":"2026-05-18T00:15:10Z","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":"2222ff3946631318c10b033a914d7bd9efd23b68aa9913008991742d412c86b7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-06-21T13:55:03Z","title_canon_sha256":"c42234291c73b7cbb21aef2f134b4586c7b2b09cf4a05eaa84b443f1cce0fd4c"},"schema_version":"1.0","source":{"id":"1506.06365","kind":"arxiv","version":2}},"canonical_sha256":"7a547139a2c60526b8f074a5e2d36216bb53e61905129bd0431557becec4bd34","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7a547139a2c60526b8f074a5e2d36216bb53e61905129bd0431557becec4bd34","first_computed_at":"2026-05-18T00:15:10.884013Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:15:10.884013Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"75ZSyowkbowpTlAQh4aMSBzOm4nQSKmJrr8zfw2dHG4huQc+8SnfqUUNojCjYwafOnndClM1Sas3dBMGJgzCAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:15:10.884769Z","signed_message":"canonical_sha256_bytes"},"source_id":"1506.06365","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:93af5448d43b1e9d3903ed9e223127ea684f2a1e50e7c69006acbe4ee2a0c002","sha256:61c561dbae538c1b96e84a6d72794063b21eb9632b4f9ba698429b2dc6a10941"],"state_sha256":"620a1fbe7484d36982300eb8bccb8fbfaf6f3ffd5740fafb0110d3446b81f00c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QECJVwSUApvFK5s5FzxnweK/oBdWtWSwr1SXxVvWW34vV1pPMt6lRHwCR9SvBBWMhk7J9mBUf1nb1FC9OYAJAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T09:37:23.981614Z","bundle_sha256":"719598f6d603c7a2c32e18d92af52dd3309ab896e34f3da0e40241c350de75d7"}}