{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:QA4BIKJWS3IEHIHX7E5QLOE2FY","short_pith_number":"pith:QA4BIKJW","canonical_record":{"source":{"id":"1502.02074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T23:18:48Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"3d117e52f4333783c6bd9fc467ce0763032e199adbc07ccdcd93188983ee467f","abstract_canon_sha256":"c03cb333b4d3ca974558d25cb928aee8b846699059d8203f0986f7eecefdc371"},"schema_version":"1.0"},"canonical_sha256":"803814293696d043a0f7f93b05b89a2e3fb58120f602845c365ae7d3900f0310","source":{"kind":"arxiv","id":"1502.02074","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02074","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02074v2","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02074","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"QA4BIKJWS3IE","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QA4BIKJWS3IEHIHX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QA4BIKJW","created_at":"2026-05-18T12:29:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:QA4BIKJWS3IEHIHX7E5QLOE2FY","target":"record","payload":{"canonical_record":{"source":{"id":"1502.02074","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T23:18:48Z","cross_cats_sorted":["math.AG"],"title_canon_sha256":"3d117e52f4333783c6bd9fc467ce0763032e199adbc07ccdcd93188983ee467f","abstract_canon_sha256":"c03cb333b4d3ca974558d25cb928aee8b846699059d8203f0986f7eecefdc371"},"schema_version":"1.0"},"canonical_sha256":"803814293696d043a0f7f93b05b89a2e3fb58120f602845c365ae7d3900f0310","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:48:06.395058Z","signature_b64":"nJFZ3XcbG6U+l7Lf1cuZdjjlAfll9VyFHtkCWnjsPeU+x1oiydaqINBoFfTC69QAKG5YOPpBPHh9vfErDYntBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"803814293696d043a0f7f93b05b89a2e3fb58120f602845c365ae7d3900f0310","last_reissued_at":"2026-05-18T01:48:06.394403Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:48:06.394403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1502.02074","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-18T01:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5DZ5aTblXL4/s2gTPt3JdC0LKUKE0y2KCoay7BCc7cqGGJf5YKfXAWpiWysTUhmCLPYGlOTBWbQhHHywIHdXDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:30:30.497209Z"},"content_sha256":"6981005eaf5a1a86255f3b3df64fe90de30b4c987194664607355d7db86e667e","schema_version":"1.0","event_id":"sha256:6981005eaf5a1a86255f3b3df64fe90de30b4c987194664607355d7db86e667e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:QA4BIKJWS3IEHIHX7E5QLOE2FY","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Counting real critical points of the distance to orthogonally invariant matrix sets","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.AG"],"primary_cat":"math.OC","authors_text":"Dmitriy Drusvyatskiy, Hon-leung Lee, Rekha R. Thomas","submitted_at":"2015-02-06T23:18:48Z","abstract_excerpt":"Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to compute and count the real smooth critical points of a data matrix on an orthogonally invariant set of matrices. The technique relies on \"transfer principles\" that allow calculations to be done in the space of singular values of the matrices in the orthogonally invariant set. The calculations often simplify greatly and yield transparent formulas. We illustra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02074","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-18T01:48:06Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uUvc0Uc1JXHP7z4DhwVHRZAZsqypkjaOiH77KDZgG3Y9qHOc2D+3cVDWTRknisIXLuUPi8nrLsDaC/1/1rYlBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T20:30:30.497974Z"},"content_sha256":"2ace3c544cb9977d98c8ae4014bd5544ed4ea8857bc014e20999a08f06e2d65e","schema_version":"1.0","event_id":"sha256:2ace3c544cb9977d98c8ae4014bd5544ed4ea8857bc014e20999a08f06e2d65e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QA4BIKJWS3IEHIHX7E5QLOE2FY/bundle.json","state_url":"https://pith.science/pith/QA4BIKJWS3IEHIHX7E5QLOE2FY/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QA4BIKJWS3IEHIHX7E5QLOE2FY/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-04T20:30:30Z","links":{"resolver":"https://pith.science/pith/QA4BIKJWS3IEHIHX7E5QLOE2FY","bundle":"https://pith.science/pith/QA4BIKJWS3IEHIHX7E5QLOE2FY/bundle.json","state":"https://pith.science/pith/QA4BIKJWS3IEHIHX7E5QLOE2FY/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QA4BIKJWS3IEHIHX7E5QLOE2FY/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:QA4BIKJWS3IEHIHX7E5QLOE2FY","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":"c03cb333b4d3ca974558d25cb928aee8b846699059d8203f0986f7eecefdc371","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T23:18:48Z","title_canon_sha256":"3d117e52f4333783c6bd9fc467ce0763032e199adbc07ccdcd93188983ee467f"},"schema_version":"1.0","source":{"id":"1502.02074","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1502.02074","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"arxiv_version","alias_value":"1502.02074v2","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1502.02074","created_at":"2026-05-18T01:48:06Z"},{"alias_kind":"pith_short_12","alias_value":"QA4BIKJWS3IE","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_16","alias_value":"QA4BIKJWS3IEHIHX","created_at":"2026-05-18T12:29:37Z"},{"alias_kind":"pith_short_8","alias_value":"QA4BIKJW","created_at":"2026-05-18T12:29:37Z"}],"graph_snapshots":[{"event_id":"sha256:2ace3c544cb9977d98c8ae4014bd5544ed4ea8857bc014e20999a08f06e2d65e","target":"graph","created_at":"2026-05-18T01:48:06Z","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":"Minimizing the Euclidean distance to a set arises frequently in applications. When the set is algebraic, a measure of complexity of this optimization problem is its number of critical points. In this paper we provide a general framework to compute and count the real smooth critical points of a data matrix on an orthogonally invariant set of matrices. The technique relies on \"transfer principles\" that allow calculations to be done in the space of singular values of the matrices in the orthogonally invariant set. The calculations often simplify greatly and yield transparent formulas. We illustra","authors_text":"Dmitriy Drusvyatskiy, Hon-leung Lee, Rekha R. Thomas","cross_cats":["math.AG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T23:18:48Z","title":"Counting real critical points of the distance to orthogonally invariant matrix sets"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.02074","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:6981005eaf5a1a86255f3b3df64fe90de30b4c987194664607355d7db86e667e","target":"record","created_at":"2026-05-18T01:48:06Z","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":"c03cb333b4d3ca974558d25cb928aee8b846699059d8203f0986f7eecefdc371","cross_cats_sorted":["math.AG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2015-02-06T23:18:48Z","title_canon_sha256":"3d117e52f4333783c6bd9fc467ce0763032e199adbc07ccdcd93188983ee467f"},"schema_version":"1.0","source":{"id":"1502.02074","kind":"arxiv","version":2}},"canonical_sha256":"803814293696d043a0f7f93b05b89a2e3fb58120f602845c365ae7d3900f0310","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"803814293696d043a0f7f93b05b89a2e3fb58120f602845c365ae7d3900f0310","first_computed_at":"2026-05-18T01:48:06.394403Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:48:06.394403Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nJFZ3XcbG6U+l7Lf1cuZdjjlAfll9VyFHtkCWnjsPeU+x1oiydaqINBoFfTC69QAKG5YOPpBPHh9vfErDYntBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T01:48:06.395058Z","signed_message":"canonical_sha256_bytes"},"source_id":"1502.02074","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6981005eaf5a1a86255f3b3df64fe90de30b4c987194664607355d7db86e667e","sha256:2ace3c544cb9977d98c8ae4014bd5544ed4ea8857bc014e20999a08f06e2d65e"],"state_sha256":"79eecf34846337532f3655880ecc0f4789f9600f612b978dd30438cd47381366"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6naxnzIKK2i9mkjeaLnutjrUKLVI+hsgj1LYkjJZZHb/Ze0BTS6DMrX1Q3+I7yNiQ8J/fgk1nuh0OEqb3AaUDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T20:30:30.501533Z","bundle_sha256":"ebe84cf60374a7b77588fddc938c47fe826ad51db9b0117b77ade2f9042d62ce"}}