{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:YT5FKZUDXW2VBO5S63W6YZEKBT","short_pith_number":"pith:YT5FKZUD","schema_version":"1.0","canonical_sha256":"c4fa556683bdb550bbb2f6edec648a0cd48cb4e09edeeeaceaf30b326e2a25de","source":{"kind":"arxiv","id":"2606.18173","version":1},"attestation_state":"computed","paper":{"title":"An algorithm to exactly compute minimal upper bounds in the Loewner order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"math.FA","authors_text":"Adam Humeniuk, Gabriel Jarry-Bolduc, Nejaunie Williams, Patrick Pascua","submitted_at":"2026-06-16T17:08:55Z","abstract_excerpt":"The Loewner order on Hermitian matrices is a partial order that compares matrices in terms of positive semidefiniteness. The Loewner order plays a key role in many fields such as optimization, numerical linear algebra, control theory, operator theory, and quantum information. A fundamental difficulty is that two or more Hermitian matrices do not necessarily have a unique minimal upper bound (or maximal lower bound). In this paper, we propose an iterative method to exactly compute a minimal upper bound for any finite collection of $n\\times n$ Hermitian matrices. It is shown that the algorithm t"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2606.18173","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.FA","submitted_at":"2026-06-16T17:08:55Z","cross_cats_sorted":["cs.NA","math.NA","math.OC"],"title_canon_sha256":"18ce7810fabf270330a1a0aae2f8771ccb66613bede46f320e9a903f9185a383","abstract_canon_sha256":"c92e5a753123796bec5a97a530b36cca2fcf61c24b3251ca88c5938c83258629"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-19T16:10:50.249728Z","signature_b64":"GmMHgmJ4aKU4T7iijvP0gCRci8j5zlgNWdxA8s4NUmhv22tevf8afO3ZA124hCkcvKpeBFrA//P3MTAN7rxxAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c4fa556683bdb550bbb2f6edec648a0cd48cb4e09edeeeaceaf30b326e2a25de","last_reissued_at":"2026-06-19T16:10:50.249374Z","signature_status":"signed_v1","first_computed_at":"2026-06-19T16:10:50.249374Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An algorithm to exactly compute minimal upper bounds in the Loewner order","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.NA","math.NA","math.OC"],"primary_cat":"math.FA","authors_text":"Adam Humeniuk, Gabriel Jarry-Bolduc, Nejaunie Williams, Patrick Pascua","submitted_at":"2026-06-16T17:08:55Z","abstract_excerpt":"The Loewner order on Hermitian matrices is a partial order that compares matrices in terms of positive semidefiniteness. The Loewner order plays a key role in many fields such as optimization, numerical linear algebra, control theory, operator theory, and quantum information. A fundamental difficulty is that two or more Hermitian matrices do not necessarily have a unique minimal upper bound (or maximal lower bound). In this paper, we propose an iterative method to exactly compute a minimal upper bound for any finite collection of $n\\times n$ Hermitian matrices. It is shown that the algorithm t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.18173","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2606.18173/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2606.18173","created_at":"2026-06-19T16:10:50.249439+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.18173v1","created_at":"2026-06-19T16:10:50.249439+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.18173","created_at":"2026-06-19T16:10:50.249439+00:00"},{"alias_kind":"pith_short_12","alias_value":"YT5FKZUDXW2V","created_at":"2026-06-19T16:10:50.249439+00:00"},{"alias_kind":"pith_short_16","alias_value":"YT5FKZUDXW2VBO5S","created_at":"2026-06-19T16:10:50.249439+00:00"},{"alias_kind":"pith_short_8","alias_value":"YT5FKZUD","created_at":"2026-06-19T16:10:50.249439+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT","json":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT.json","graph_json":"https://pith.science/api/pith-number/YT5FKZUDXW2VBO5S63W6YZEKBT/graph.json","events_json":"https://pith.science/api/pith-number/YT5FKZUDXW2VBO5S63W6YZEKBT/events.json","paper":"https://pith.science/paper/YT5FKZUD"},"agent_actions":{"view_html":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT","download_json":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT.json","view_paper":"https://pith.science/paper/YT5FKZUD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.18173&json=true","fetch_graph":"https://pith.science/api/pith-number/YT5FKZUDXW2VBO5S63W6YZEKBT/graph.json","fetch_events":"https://pith.science/api/pith-number/YT5FKZUDXW2VBO5S63W6YZEKBT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT/action/storage_attestation","attest_author":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT/action/author_attestation","sign_citation":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT/action/citation_signature","submit_replication":"https://pith.science/pith/YT5FKZUDXW2VBO5S63W6YZEKBT/action/replication_record"}},"created_at":"2026-06-19T16:10:50.249439+00:00","updated_at":"2026-06-19T16:10:50.249439+00:00"}