{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2017:67A7VIC6TBPHLN2ONNDDTCRNRG","short_pith_number":"pith:67A7VIC6","canonical_record":{"source":{"id":"1708.04298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-08-14T20:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"19c123184e2d6bb9f70a59368445004850e512b95151a9f0465139452c016cf7","abstract_canon_sha256":"51e49441aabfc695590210c45ab473e73153db841ffc868b49d0b1daece19acc"},"schema_version":"1.0"},"canonical_sha256":"f7c1faa05e985e75b74e6b46398a2d89953d6d44bc61d8cc0e21a3663a70293a","source":{"kind":"arxiv","id":"1708.04298","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04298","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04298v2","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04298","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"67A7VIC6TBPH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67A7VIC6TBPHLN2O","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67A7VIC6","created_at":"2026-05-18T12:31:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2017:67A7VIC6TBPHLN2ONNDDTCRNRG","target":"record","payload":{"canonical_record":{"source":{"id":"1708.04298","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-08-14T20:01:01Z","cross_cats_sorted":[],"title_canon_sha256":"19c123184e2d6bb9f70a59368445004850e512b95151a9f0465139452c016cf7","abstract_canon_sha256":"51e49441aabfc695590210c45ab473e73153db841ffc868b49d0b1daece19acc"},"schema_version":"1.0"},"canonical_sha256":"f7c1faa05e985e75b74e6b46398a2d89953d6d44bc61d8cc0e21a3663a70293a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:37:57.263642Z","signature_b64":"Bc86e6uxK5YAayexVxSSkoIJzNiGB6ERnVx/YJW1newsJzRVumUbSWv6lVvih1TcAAJEVPdfEC6VYVKUB8B2Ag==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7c1faa05e985e75b74e6b46398a2d89953d6d44bc61d8cc0e21a3663a70293a","last_reissued_at":"2026-05-18T00:37:57.263009Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:37:57.263009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1708.04298","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:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"M2dvXseQu0M0skwgmhlT2h0oXDsMc5usfLFUgOybGyaudiWc4eS4X+U3miATXeUMHP2uvwr4NOmgnAvXVy7ACw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:39:18.017326Z"},"content_sha256":"187052d3743fd26eaef89991a9b0d7e75dfc3edd2d2bbc3baf96d820b6361e2a","schema_version":"1.0","event_id":"sha256:187052d3743fd26eaef89991a9b0d7e75dfc3edd2d2bbc3baf96d820b6361e2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2017:67A7VIC6TBPHLN2ONNDDTCRNRG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Using incomplete indefinite $LDL^T$ preconditioning for inexact interior point methods for linear programming","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Robert Luce","submitted_at":"2017-08-14T20:01:01Z","abstract_excerpt":"Most linear algebra kernels in interior point methods for linear programming require the solution of linear systems of equation with the matrix $N = A^TD^{-1}A$ (or $AD^{-1}A^T$), where $A$ denotes the constraint matrix of the linear program. This matrix $N$ arises from the reduced KKT system by block elimination. If the number of non-zeros in $N$ or in its Cholesky factorization $N= LL^T$ is very large, the computational cost and memory requirement to solve the linear systems of equations with $N$ may be prohibitively large. In this work we implement an interior point method described by R. F"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04298","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:37:57Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EFEOPCHqkDVSr898llZESz6DL8jz8NU6LZUjUBNxvlRpG0kA/l0RIGjRgSIrSJoDT/22lOf391RZYwcGbr5aCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-27T18:39:18.017752Z"},"content_sha256":"da0fb8ec1a94d8cd507390bf5e3012fced113c0fa8b5506aea9139e84243093f","schema_version":"1.0","event_id":"sha256:da0fb8ec1a94d8cd507390bf5e3012fced113c0fa8b5506aea9139e84243093f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/67A7VIC6TBPHLN2ONNDDTCRNRG/bundle.json","state_url":"https://pith.science/pith/67A7VIC6TBPHLN2ONNDDTCRNRG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/67A7VIC6TBPHLN2ONNDDTCRNRG/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-27T18:39:18Z","links":{"resolver":"https://pith.science/pith/67A7VIC6TBPHLN2ONNDDTCRNRG","bundle":"https://pith.science/pith/67A7VIC6TBPHLN2ONNDDTCRNRG/bundle.json","state":"https://pith.science/pith/67A7VIC6TBPHLN2ONNDDTCRNRG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/67A7VIC6TBPHLN2ONNDDTCRNRG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2017:67A7VIC6TBPHLN2ONNDDTCRNRG","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":"51e49441aabfc695590210c45ab473e73153db841ffc868b49d0b1daece19acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-08-14T20:01:01Z","title_canon_sha256":"19c123184e2d6bb9f70a59368445004850e512b95151a9f0465139452c016cf7"},"schema_version":"1.0","source":{"id":"1708.04298","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1708.04298","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"arxiv_version","alias_value":"1708.04298v2","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.04298","created_at":"2026-05-18T00:37:57Z"},{"alias_kind":"pith_short_12","alias_value":"67A7VIC6TBPH","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_16","alias_value":"67A7VIC6TBPHLN2O","created_at":"2026-05-18T12:31:03Z"},{"alias_kind":"pith_short_8","alias_value":"67A7VIC6","created_at":"2026-05-18T12:31:03Z"}],"graph_snapshots":[{"event_id":"sha256:da0fb8ec1a94d8cd507390bf5e3012fced113c0fa8b5506aea9139e84243093f","target":"graph","created_at":"2026-05-18T00:37:57Z","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":"Most linear algebra kernels in interior point methods for linear programming require the solution of linear systems of equation with the matrix $N = A^TD^{-1}A$ (or $AD^{-1}A^T$), where $A$ denotes the constraint matrix of the linear program. This matrix $N$ arises from the reduced KKT system by block elimination. If the number of non-zeros in $N$ or in its Cholesky factorization $N= LL^T$ is very large, the computational cost and memory requirement to solve the linear systems of equations with $N$ may be prohibitively large. In this work we implement an interior point method described by R. F","authors_text":"Robert Luce","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-08-14T20:01:01Z","title":"Using incomplete indefinite $LDL^T$ preconditioning for inexact interior point methods for linear programming"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.04298","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:187052d3743fd26eaef89991a9b0d7e75dfc3edd2d2bbc3baf96d820b6361e2a","target":"record","created_at":"2026-05-18T00:37:57Z","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":"51e49441aabfc695590210c45ab473e73153db841ffc868b49d0b1daece19acc","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2017-08-14T20:01:01Z","title_canon_sha256":"19c123184e2d6bb9f70a59368445004850e512b95151a9f0465139452c016cf7"},"schema_version":"1.0","source":{"id":"1708.04298","kind":"arxiv","version":2}},"canonical_sha256":"f7c1faa05e985e75b74e6b46398a2d89953d6d44bc61d8cc0e21a3663a70293a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7c1faa05e985e75b74e6b46398a2d89953d6d44bc61d8cc0e21a3663a70293a","first_computed_at":"2026-05-18T00:37:57.263009Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:37:57.263009Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Bc86e6uxK5YAayexVxSSkoIJzNiGB6ERnVx/YJW1newsJzRVumUbSWv6lVvih1TcAAJEVPdfEC6VYVKUB8B2Ag==","signature_status":"signed_v1","signed_at":"2026-05-18T00:37:57.263642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1708.04298","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:187052d3743fd26eaef89991a9b0d7e75dfc3edd2d2bbc3baf96d820b6361e2a","sha256:da0fb8ec1a94d8cd507390bf5e3012fced113c0fa8b5506aea9139e84243093f"],"state_sha256":"f24a8e76f94033db42dbaec59b4c9091164e7771e57b6546e6b80e7e9851d2aa"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ob2Z9HWXe79o77nJ1zuPJCdpswEv1BG23w4QTd4QLyoOfjCqmgal5eg02DzIxrAEBxbDNDa2k/7n3Xf0U5UaDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-27T18:39:18.019704Z","bundle_sha256":"5e6d824f25b3043346506e3c49d68c00951e8605c7c27f581f5fc4a7b075de85"}}