{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:BGSLDQC45IJFNJTUHH6SUZVHFV","short_pith_number":"pith:BGSLDQC4","canonical_record":{"source":{"id":"1112.0526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-02T18:07:43Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"e294cd2e5c7dd9d156e8a6b95a6621dbcb288876d41087cdc610f1d7c22c144a","abstract_canon_sha256":"f1414e9e97c0dce0a9de296940a43b6c9b02a4804ddeed2555d063f9c0fe04c1"},"schema_version":"1.0"},"canonical_sha256":"09a4b1c05cea1256a67439fd2a66a72d4cfbc2b04c77b37d3da0cd98c234b5f6","source":{"kind":"arxiv","id":"1112.0526","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0526","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0526v3","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0526","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"BGSLDQC45IJF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BGSLDQC45IJFNJTU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BGSLDQC4","created_at":"2026-05-18T12:26:24Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:BGSLDQC45IJFNJTUHH6SUZVHFV","target":"record","payload":{"canonical_record":{"source":{"id":"1112.0526","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-02T18:07:43Z","cross_cats_sorted":["math.NA"],"title_canon_sha256":"e294cd2e5c7dd9d156e8a6b95a6621dbcb288876d41087cdc610f1d7c22c144a","abstract_canon_sha256":"f1414e9e97c0dce0a9de296940a43b6c9b02a4804ddeed2555d063f9c0fe04c1"},"schema_version":"1.0"},"canonical_sha256":"09a4b1c05cea1256a67439fd2a66a72d4cfbc2b04c77b37d3da0cd98c234b5f6","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:05:15.077803Z","signature_b64":"ek6GYgObMb+kxnPc+EoirdKvHnZFEKmCID4VDWLjWx2E4JaZhDqAK7Luz0KSqpS5m33BlGSRBXfSJRbjo1myBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"09a4b1c05cea1256a67439fd2a66a72d4cfbc2b04c77b37d3da0cd98c234b5f6","last_reissued_at":"2026-05-18T00:05:15.077154Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:05:15.077154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1112.0526","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-18T00:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LnCS+krreHiGmQmJFWJL6dzIgDX1ZidR9a5sSl/adQD2LJfdB2LkNoXI0jnMQ2qfjWnTfS+3JT2dIIM7NYR7DQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:06:10.742207Z"},"content_sha256":"83b8b16ff02ccd575d8603d2952142a5f50e2f571533f946dd49e3732f499de6","schema_version":"1.0","event_id":"sha256:83b8b16ff02ccd575d8603d2952142a5f50e2f571533f946dd49e3732f499de6"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:BGSLDQC45IJFNJTUHH6SUZVHFV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Prox-regularity of rank constraint sets and implications for algorithms","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.NA"],"primary_cat":"math.OC","authors_text":"D. Russell Luke","submitted_at":"2011-12-02T18:07:43Z","abstract_excerpt":"We present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank exactly equal to $s$. The normal cone formula appears to be new. This allows for easy application of prior results guaranteeing local linear convergence of the fundamental alternating projection algorithm between sets, one of which is a rank constraint set. We apply this to show local linear convergence of another fundamental algorithm, approximate steepest d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0526","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-18T00:05:15Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fJtDFQamAjHtVN+ZhfqOduMWXm9QaQBGjHsa3Bt7/EqyUiN/sSUNAOiZxcOVQyCnjsV6YJ5DSR4+/6LHkIa/BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T23:06:10.742914Z"},"content_sha256":"33c74d2b8be385e1b34f1950e29f3fcd78a8fcf38d18737da7a39c15c271d584","schema_version":"1.0","event_id":"sha256:33c74d2b8be385e1b34f1950e29f3fcd78a8fcf38d18737da7a39c15c271d584"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/BGSLDQC45IJFNJTUHH6SUZVHFV/bundle.json","state_url":"https://pith.science/pith/BGSLDQC45IJFNJTUHH6SUZVHFV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/BGSLDQC45IJFNJTUHH6SUZVHFV/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-11T23:06:10Z","links":{"resolver":"https://pith.science/pith/BGSLDQC45IJFNJTUHH6SUZVHFV","bundle":"https://pith.science/pith/BGSLDQC45IJFNJTUHH6SUZVHFV/bundle.json","state":"https://pith.science/pith/BGSLDQC45IJFNJTUHH6SUZVHFV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/BGSLDQC45IJFNJTUHH6SUZVHFV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:BGSLDQC45IJFNJTUHH6SUZVHFV","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":"f1414e9e97c0dce0a9de296940a43b6c9b02a4804ddeed2555d063f9c0fe04c1","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-02T18:07:43Z","title_canon_sha256":"e294cd2e5c7dd9d156e8a6b95a6621dbcb288876d41087cdc610f1d7c22c144a"},"schema_version":"1.0","source":{"id":"1112.0526","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1112.0526","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"arxiv_version","alias_value":"1112.0526v3","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1112.0526","created_at":"2026-05-18T00:05:15Z"},{"alias_kind":"pith_short_12","alias_value":"BGSLDQC45IJF","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_16","alias_value":"BGSLDQC45IJFNJTU","created_at":"2026-05-18T12:26:24Z"},{"alias_kind":"pith_short_8","alias_value":"BGSLDQC4","created_at":"2026-05-18T12:26:24Z"}],"graph_snapshots":[{"event_id":"sha256:33c74d2b8be385e1b34f1950e29f3fcd78a8fcf38d18737da7a39c15c271d584","target":"graph","created_at":"2026-05-18T00:05:15Z","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 present an analysis of sets of matrices with rank less than or equal to a specified number $s$. We provide a simple formula for the normal cone to such sets, and use this to show that these sets are prox-regular at all points with rank exactly equal to $s$. The normal cone formula appears to be new. This allows for easy application of prior results guaranteeing local linear convergence of the fundamental alternating projection algorithm between sets, one of which is a rank constraint set. We apply this to show local linear convergence of another fundamental algorithm, approximate steepest d","authors_text":"D. Russell Luke","cross_cats":["math.NA"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-02T18:07:43Z","title":"Prox-regularity of rank constraint sets and implications for algorithms"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1112.0526","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:83b8b16ff02ccd575d8603d2952142a5f50e2f571533f946dd49e3732f499de6","target":"record","created_at":"2026-05-18T00:05:15Z","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":"f1414e9e97c0dce0a9de296940a43b6c9b02a4804ddeed2555d063f9c0fe04c1","cross_cats_sorted":["math.NA"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2011-12-02T18:07:43Z","title_canon_sha256":"e294cd2e5c7dd9d156e8a6b95a6621dbcb288876d41087cdc610f1d7c22c144a"},"schema_version":"1.0","source":{"id":"1112.0526","kind":"arxiv","version":3}},"canonical_sha256":"09a4b1c05cea1256a67439fd2a66a72d4cfbc2b04c77b37d3da0cd98c234b5f6","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"09a4b1c05cea1256a67439fd2a66a72d4cfbc2b04c77b37d3da0cd98c234b5f6","first_computed_at":"2026-05-18T00:05:15.077154Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:05:15.077154Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ek6GYgObMb+kxnPc+EoirdKvHnZFEKmCID4VDWLjWx2E4JaZhDqAK7Luz0KSqpS5m33BlGSRBXfSJRbjo1myBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T00:05:15.077803Z","signed_message":"canonical_sha256_bytes"},"source_id":"1112.0526","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:83b8b16ff02ccd575d8603d2952142a5f50e2f571533f946dd49e3732f499de6","sha256:33c74d2b8be385e1b34f1950e29f3fcd78a8fcf38d18737da7a39c15c271d584"],"state_sha256":"00085f0159eaaa4b890a3efddad2c2d37c301344f030cc610c7e95c9111953e9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZhtwCPR8l1vejB9j6q3iIwkW4Rux9NdMIfhU7Nw6NTPnEhWBMzkMYfo0jA5IGT0cIm1Md5GNGxAkk0xGo/inAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T23:06:10.746921Z","bundle_sha256":"4c0a7d589a0730caddf0ad8ecaa053df0575dd500c4197e5b23b057377f7ac1c"}}