{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:IEQENFSMJES2LBUVOBZOCCBZAG","short_pith_number":"pith:IEQENFSM","canonical_record":{"source":{"id":"1310.5880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-22T11:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"8f17049c58b1ad8016e4b0d3f32a9d0641fc4c62cb6c215288da45d7ff6cceee","abstract_canon_sha256":"7663029ec1d2692dc550087876d2c6dec804f35bffc8614b46b93db1a6f3fbb4"},"schema_version":"1.0"},"canonical_sha256":"412046964c4925a586957072e1083901957fb26814565f0af9cde77a4b98e339","source":{"kind":"arxiv","id":"1310.5880","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5880","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5880v1","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5880","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"IEQENFSMJES2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IEQENFSMJES2LBUV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IEQENFSM","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:IEQENFSMJES2LBUVOBZOCCBZAG","target":"record","payload":{"canonical_record":{"source":{"id":"1310.5880","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-22T11:23:28Z","cross_cats_sorted":[],"title_canon_sha256":"8f17049c58b1ad8016e4b0d3f32a9d0641fc4c62cb6c215288da45d7ff6cceee","abstract_canon_sha256":"7663029ec1d2692dc550087876d2c6dec804f35bffc8614b46b93db1a6f3fbb4"},"schema_version":"1.0"},"canonical_sha256":"412046964c4925a586957072e1083901957fb26814565f0af9cde77a4b98e339","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:09:24.365270Z","signature_b64":"S56oAi5f20gsP18ScNQLVSvWpTJGnfIVQ/Zffu0IkWRqiFEs0vowPf2wGu4P6YetKSjsFgbvXyzGZT/qcxckDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"412046964c4925a586957072e1083901957fb26814565f0af9cde77a4b98e339","last_reissued_at":"2026-05-18T03:09:24.364629Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:09:24.364629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1310.5880","source_version":1,"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-18T03:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Hvj1D/tdlb3oTgP/KenERTctf9Qea1EbZeXxozKtiet31HxPdtR1LQNOjWHuYDSd1nt06lfY/l82BnEoxDWXCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:30:50.415829Z"},"content_sha256":"bacd6e5848fce8d4e70b230348d8a80ec88fb792beb06edf2e1de14b3de08c2f","schema_version":"1.0","event_id":"sha256:bacd6e5848fce8d4e70b230348d8a80ec88fb792beb06edf2e1de14b3de08c2f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:IEQENFSMJES2LBUVOBZOCCBZAG","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Max-min and min-max approximation problems for normal matrices revisited","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"J\\\"org Liesen, Petr Tich\\'y","submitted_at":"2013-10-22T11:23:28Z","abstract_excerpt":"We give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and constrained convex optimization. Our proof uses a classical characterization theorem from approximation theory and thus exploits the link between the two approximation problems with normal matrices on the one hand and approximation problems on compact sets in the complex plane on the other."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5880","kind":"arxiv","version":1},"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-18T03:09:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5wEVUebctNw+lekJlVzk1bKpSKcWT9uTThcGZ9kHgSXYGoWKtExAfeir73NMvS+F6b2PTngEJ40AstH47ch7Cw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-29T17:30:50.416187Z"},"content_sha256":"26e8fa2f6e7a986b1ede0222b74aee48150562316e9507af8fe2d9fc0f9f795b","schema_version":"1.0","event_id":"sha256:26e8fa2f6e7a986b1ede0222b74aee48150562316e9507af8fe2d9fc0f9f795b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/IEQENFSMJES2LBUVOBZOCCBZAG/bundle.json","state_url":"https://pith.science/pith/IEQENFSMJES2LBUVOBZOCCBZAG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/IEQENFSMJES2LBUVOBZOCCBZAG/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-29T17:30:50Z","links":{"resolver":"https://pith.science/pith/IEQENFSMJES2LBUVOBZOCCBZAG","bundle":"https://pith.science/pith/IEQENFSMJES2LBUVOBZOCCBZAG/bundle.json","state":"https://pith.science/pith/IEQENFSMJES2LBUVOBZOCCBZAG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/IEQENFSMJES2LBUVOBZOCCBZAG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:IEQENFSMJES2LBUVOBZOCCBZAG","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":"7663029ec1d2692dc550087876d2c6dec804f35bffc8614b46b93db1a6f3fbb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-22T11:23:28Z","title_canon_sha256":"8f17049c58b1ad8016e4b0d3f32a9d0641fc4c62cb6c215288da45d7ff6cceee"},"schema_version":"1.0","source":{"id":"1310.5880","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1310.5880","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"arxiv_version","alias_value":"1310.5880v1","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1310.5880","created_at":"2026-05-18T03:09:24Z"},{"alias_kind":"pith_short_12","alias_value":"IEQENFSMJES2","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"IEQENFSMJES2LBUV","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"IEQENFSM","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:26e8fa2f6e7a986b1ede0222b74aee48150562316e9507af8fe2d9fc0f9f795b","target":"graph","created_at":"2026-05-18T03:09:24Z","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 give a new proof for an equality of certain max-min and min-max approximation problems involving normal matrices. The previously published proofs of this equality apply tools from matrix theory, (analytic) optimization theory and constrained convex optimization. Our proof uses a classical characterization theorem from approximation theory and thus exploits the link between the two approximation problems with normal matrices on the one hand and approximation problems on compact sets in the complex plane on the other.","authors_text":"J\\\"org Liesen, Petr Tich\\'y","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-22T11:23:28Z","title":"Max-min and min-max approximation problems for normal matrices revisited"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1310.5880","kind":"arxiv","version":1},"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:bacd6e5848fce8d4e70b230348d8a80ec88fb792beb06edf2e1de14b3de08c2f","target":"record","created_at":"2026-05-18T03:09:24Z","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":"7663029ec1d2692dc550087876d2c6dec804f35bffc8614b46b93db1a6f3fbb4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2013-10-22T11:23:28Z","title_canon_sha256":"8f17049c58b1ad8016e4b0d3f32a9d0641fc4c62cb6c215288da45d7ff6cceee"},"schema_version":"1.0","source":{"id":"1310.5880","kind":"arxiv","version":1}},"canonical_sha256":"412046964c4925a586957072e1083901957fb26814565f0af9cde77a4b98e339","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"412046964c4925a586957072e1083901957fb26814565f0af9cde77a4b98e339","first_computed_at":"2026-05-18T03:09:24.364629Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:09:24.364629Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S56oAi5f20gsP18ScNQLVSvWpTJGnfIVQ/Zffu0IkWRqiFEs0vowPf2wGu4P6YetKSjsFgbvXyzGZT/qcxckDg==","signature_status":"signed_v1","signed_at":"2026-05-18T03:09:24.365270Z","signed_message":"canonical_sha256_bytes"},"source_id":"1310.5880","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bacd6e5848fce8d4e70b230348d8a80ec88fb792beb06edf2e1de14b3de08c2f","sha256:26e8fa2f6e7a986b1ede0222b74aee48150562316e9507af8fe2d9fc0f9f795b"],"state_sha256":"38117b4029dc14f0e64e42bbed2ec3e75ad3cc808a05fcf25a48a45810f0bca2"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"m0sw2bD9f6Tt0ZQWhgTx/ia2iZ4/xppaXBeEiC5qj9kzPcHuuhJRhVKpPHqV5uhs55pBCA55dzyjGbIKZa83BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-29T17:30:50.418123Z","bundle_sha256":"2d90793a395059cd9639dd52ca6f0c6d2c90c3c78747d6d10e0509f23f2d3007"}}