{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2026:DIKYBY7YV4YPUIR7XENPDR36T7","short_pith_number":"pith:DIKYBY7Y","schema_version":"1.0","canonical_sha256":"1a1580e3f8af30fa223fb91af1c77e9ff74d0582deb30c96760f5c814c7743e2","source":{"kind":"arxiv","id":"2606.04259","version":1},"attestation_state":"computed","paper":{"title":"An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Marija Milolo\\v{z}a Pandur","submitted_at":"2026-06-02T22:24:49Z","abstract_excerpt":"A Hermitian matrix pair $(A,B)$ is called definite if some real linear combination of the matrices $A$ and $B$ is a positive definite matrix. Detection of the definiteness is not straightforward. We propose a basic subspace algorithm for detecting a large definite matrix pair $(A,B)$ with indefinite $B$. The proposed subspace algorithm is based on iterative testing of small projected Hermitian matrix pairs formed by using subspaces of small dimensions. Furthermore, we propose a specialized algorithm with parameter $m$, and its preconditioned variant. In the specialized algorithm with $m=3$ we "},"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.04259","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.NA","submitted_at":"2026-06-02T22:24:49Z","cross_cats_sorted":["cs.NA"],"title_canon_sha256":"efbba272b6fe65669e3e467e10012758f98787f94eead9853014ad593d9637b6","abstract_canon_sha256":"d2934803891f99da5c345f6d55a3e4076b8b81307a4397607e23a2a4810c6601"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-06-04T01:09:00.698292Z","signature_b64":"/cjiFfvM8zKKbjM+EzrF4QgdbUtxKfqDhzsVr3mShoOXZ18vUmafXtg7UTsfHExy1jT7fi8A9AyzyKx3wdu9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1a1580e3f8af30fa223fb91af1c77e9ff74d0582deb30c96760f5c814c7743e2","last_reissued_at":"2026-06-04T01:09:00.696663Z","signature_status":"signed_v1","first_computed_at":"2026-06-04T01:09:00.696663Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"An indefinite LOBPCG type of algorithm for detecting a definite Hermitian matrix pair","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":["cs.NA"],"primary_cat":"math.NA","authors_text":"Marija Milolo\\v{z}a Pandur","submitted_at":"2026-06-02T22:24:49Z","abstract_excerpt":"A Hermitian matrix pair $(A,B)$ is called definite if some real linear combination of the matrices $A$ and $B$ is a positive definite matrix. Detection of the definiteness is not straightforward. We propose a basic subspace algorithm for detecting a large definite matrix pair $(A,B)$ with indefinite $B$. The proposed subspace algorithm is based on iterative testing of small projected Hermitian matrix pairs formed by using subspaces of small dimensions. Furthermore, we propose a specialized algorithm with parameter $m$, and its preconditioned variant. In the specialized algorithm with $m=3$ we "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2606.04259","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.04259/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.04259","created_at":"2026-06-04T01:09:00.697635+00:00"},{"alias_kind":"arxiv_version","alias_value":"2606.04259v1","created_at":"2026-06-04T01:09:00.697635+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2606.04259","created_at":"2026-06-04T01:09:00.697635+00:00"},{"alias_kind":"pith_short_12","alias_value":"DIKYBY7YV4YP","created_at":"2026-06-04T01:09:00.697635+00:00"},{"alias_kind":"pith_short_16","alias_value":"DIKYBY7YV4YPUIR7","created_at":"2026-06-04T01:09:00.697635+00:00"},{"alias_kind":"pith_short_8","alias_value":"DIKYBY7Y","created_at":"2026-06-04T01:09:00.697635+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/DIKYBY7YV4YPUIR7XENPDR36T7","json":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7.json","graph_json":"https://pith.science/api/pith-number/DIKYBY7YV4YPUIR7XENPDR36T7/graph.json","events_json":"https://pith.science/api/pith-number/DIKYBY7YV4YPUIR7XENPDR36T7/events.json","paper":"https://pith.science/paper/DIKYBY7Y"},"agent_actions":{"view_html":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7","download_json":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7.json","view_paper":"https://pith.science/paper/DIKYBY7Y","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2606.04259&json=true","fetch_graph":"https://pith.science/api/pith-number/DIKYBY7YV4YPUIR7XENPDR36T7/graph.json","fetch_events":"https://pith.science/api/pith-number/DIKYBY7YV4YPUIR7XENPDR36T7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7/action/storage_attestation","attest_author":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7/action/author_attestation","sign_citation":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7/action/citation_signature","submit_replication":"https://pith.science/pith/DIKYBY7YV4YPUIR7XENPDR36T7/action/replication_record"}},"created_at":"2026-06-04T01:09:00.697635+00:00","updated_at":"2026-06-04T01:09:00.697635+00:00"}