{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:EPRRY4TIWU3WNEO4MH5NI2VNUC","short_pith_number":"pith:EPRRY4TI","canonical_record":{"source":{"id":"1312.0047","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-30T00:42:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f96bbf6f99853f51e671afc816951e8a744007a746d72f2fcd654cea8a3d360f","abstract_canon_sha256":"8bb83054ee78258f9ec9dbfeaf7801cb8d0cb890528cd16d2324821c7826ac6d"},"schema_version":"1.0"},"canonical_sha256":"23e31c7268b5376691dc61fad46aada08be6dbdc868aafaa57c68674677b7350","source":{"kind":"arxiv","id":"1312.0047","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0047","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0047v3","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0047","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"pith_short_12","alias_value":"EPRRY4TIWU3W","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EPRRY4TIWU3WNEO4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EPRRY4TI","created_at":"2026-05-18T12:27:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:EPRRY4TIWU3WNEO4MH5NI2VNUC","target":"record","payload":{"canonical_record":{"source":{"id":"1312.0047","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-30T00:42:30Z","cross_cats_sorted":["math.OC"],"title_canon_sha256":"f96bbf6f99853f51e671afc816951e8a744007a746d72f2fcd654cea8a3d360f","abstract_canon_sha256":"8bb83054ee78258f9ec9dbfeaf7801cb8d0cb890528cd16d2324821c7826ac6d"},"schema_version":"1.0"},"canonical_sha256":"23e31c7268b5376691dc61fad46aada08be6dbdc868aafaa57c68674677b7350","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:32:41.996266Z","signature_b64":"D8SLzxbFW8Q1B8pMv55jwh6n6u04bqCXJUBXpPSAtpH4SyTPAyKJwohtW5rJ/n5AWBKTLmIGb59aGnGXJfAyBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"23e31c7268b5376691dc61fad46aada08be6dbdc868aafaa57c68674677b7350","last_reissued_at":"2026-05-18T01:32:41.995844Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:32:41.995844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1312.0047","source_version":3,"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:32:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UHhlB3LVuf42GcmDr09I184feZe5+qM2sqVjsXXC9bk/K/U92apbPpfV7hNpI/oKuuz/d9c+qbovWFttemMiAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:31.964526Z"},"content_sha256":"1197a12b81dc2f28a5ce947d0276d7a662321d415efcd9fa8ec9ebb27a0e4b0e","schema_version":"1.0","event_id":"sha256:1197a12b81dc2f28a5ce947d0276d7a662321d415efcd9fa8ec9ebb27a0e4b0e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:EPRRY4TIWU3WNEO4MH5NI2VNUC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.OC"],"primary_cat":"math.NA","authors_text":"B. Morini, D. Di Serafino, S. Bellavia, V. De Simone","submitted_at":"2013-11-30T00:42:30Z","abstract_excerpt":"This work focuses on the iterative solution of sequences of KKT linear systems arising in interior point methods applied to large convex quadratic programming problems. This task is the computational core of the interior point procedure and an efficient preconditioning strategy is crucial for the efficiency of the overall method. Constraint preconditioners are very effective in this context; nevertheless, their computation may be very expensive for large-scale problems, and resorting to approximations of them may be convenient. Here we propose a procedure for building inexact constraint precon"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0047","kind":"arxiv","version":3},"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:32:41Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vJC7aLQVpYCPbld83tOPwQPsZWnxK93XnNwzpZQTBMNV1+PjMDPnWOLZAdsdiDoifXoPN4wxcaGRkLPSEqo/DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:27:31.964877Z"},"content_sha256":"7f3c37629c2aad3a3bc28f0a07df1d94454c206438854ec17685a1421913663d","schema_version":"1.0","event_id":"sha256:7f3c37629c2aad3a3bc28f0a07df1d94454c206438854ec17685a1421913663d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/EPRRY4TIWU3WNEO4MH5NI2VNUC/bundle.json","state_url":"https://pith.science/pith/EPRRY4TIWU3WNEO4MH5NI2VNUC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/EPRRY4TIWU3WNEO4MH5NI2VNUC/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-28T09:27:31Z","links":{"resolver":"https://pith.science/pith/EPRRY4TIWU3WNEO4MH5NI2VNUC","bundle":"https://pith.science/pith/EPRRY4TIWU3WNEO4MH5NI2VNUC/bundle.json","state":"https://pith.science/pith/EPRRY4TIWU3WNEO4MH5NI2VNUC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/EPRRY4TIWU3WNEO4MH5NI2VNUC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:EPRRY4TIWU3WNEO4MH5NI2VNUC","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":"8bb83054ee78258f9ec9dbfeaf7801cb8d0cb890528cd16d2324821c7826ac6d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-30T00:42:30Z","title_canon_sha256":"f96bbf6f99853f51e671afc816951e8a744007a746d72f2fcd654cea8a3d360f"},"schema_version":"1.0","source":{"id":"1312.0047","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1312.0047","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"arxiv_version","alias_value":"1312.0047v3","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1312.0047","created_at":"2026-05-18T01:32:41Z"},{"alias_kind":"pith_short_12","alias_value":"EPRRY4TIWU3W","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_16","alias_value":"EPRRY4TIWU3WNEO4","created_at":"2026-05-18T12:27:43Z"},{"alias_kind":"pith_short_8","alias_value":"EPRRY4TI","created_at":"2026-05-18T12:27:43Z"}],"graph_snapshots":[{"event_id":"sha256:7f3c37629c2aad3a3bc28f0a07df1d94454c206438854ec17685a1421913663d","target":"graph","created_at":"2026-05-18T01:32:41Z","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":"This work focuses on the iterative solution of sequences of KKT linear systems arising in interior point methods applied to large convex quadratic programming problems. This task is the computational core of the interior point procedure and an efficient preconditioning strategy is crucial for the efficiency of the overall method. Constraint preconditioners are very effective in this context; nevertheless, their computation may be very expensive for large-scale problems, and resorting to approximations of them may be convenient. Here we propose a procedure for building inexact constraint precon","authors_text":"B. Morini, D. Di Serafino, S. Bellavia, V. De Simone","cross_cats":["math.OC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-30T00:42:30Z","title":"Updating constraint preconditioners for KKT systems in quadratic programming via low-rank corrections"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1312.0047","kind":"arxiv","version":3},"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:1197a12b81dc2f28a5ce947d0276d7a662321d415efcd9fa8ec9ebb27a0e4b0e","target":"record","created_at":"2026-05-18T01:32:41Z","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":"8bb83054ee78258f9ec9dbfeaf7801cb8d0cb890528cd16d2324821c7826ac6d","cross_cats_sorted":["math.OC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-11-30T00:42:30Z","title_canon_sha256":"f96bbf6f99853f51e671afc816951e8a744007a746d72f2fcd654cea8a3d360f"},"schema_version":"1.0","source":{"id":"1312.0047","kind":"arxiv","version":3}},"canonical_sha256":"23e31c7268b5376691dc61fad46aada08be6dbdc868aafaa57c68674677b7350","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"23e31c7268b5376691dc61fad46aada08be6dbdc868aafaa57c68674677b7350","first_computed_at":"2026-05-18T01:32:41.995844Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:32:41.995844Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8SLzxbFW8Q1B8pMv55jwh6n6u04bqCXJUBXpPSAtpH4SyTPAyKJwohtW5rJ/n5AWBKTLmIGb59aGnGXJfAyBg==","signature_status":"signed_v1","signed_at":"2026-05-18T01:32:41.996266Z","signed_message":"canonical_sha256_bytes"},"source_id":"1312.0047","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1197a12b81dc2f28a5ce947d0276d7a662321d415efcd9fa8ec9ebb27a0e4b0e","sha256:7f3c37629c2aad3a3bc28f0a07df1d94454c206438854ec17685a1421913663d"],"state_sha256":"55b0c1ee50a1ee300f9306e041d5ec37a07f22aadcb330efb3b55ce8ef0b106c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SGuQDzp7Nd6TZao4KBtHVNcPYQf5/F3lQG1f7+rhVi3WMISgyF1AF8TV2t6FDYHU5VVlH3N426ZjgJMqPsRuBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:27:31.966989Z","bundle_sha256":"fcbb1ce2db7ebaec83e3aa01d1175dd8758b66d19ff88af93afd1feb29665bc4"}}