{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:XH6DGEPVJMPM7KZLJO2BAIGIA3","short_pith_number":"pith:XH6DGEPV","schema_version":"1.0","canonical_sha256":"b9fc3311f54b1ecfab2b4bb41020c806e776b723819a242f52656e6ccc83d55d","source":{"kind":"arxiv","id":"1908.03465","version":1},"attestation_state":"computed","paper":{"title":"Extending the Davis-Kahan theorem for comparing eigenvectors of two symmetric matrices II: Computation and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"A. T. Walden, J. F. Lutzeyer","submitted_at":"2019-08-09T14:09:59Z","abstract_excerpt":"The extended Davis-Kahan theorem makes use of polynomial matrix transformations to produce bounds at least as tight as the standard Davis-Kahan theorem. The optimization problem of finding transformation parameters resulting in optimal bounds from the extended Davis-Kahan theorem is presented for affine transformations. It is demonstrated how globally optimal bound values can be computed automatically using fractional programming theory. Two different solution approaches, the Charnes-Cooper transformation and Dinkelbach's algorithm are reviewed. Our implementation of the extended Davis--Kahan "},"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":"1908.03465","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.ST","submitted_at":"2019-08-09T14:09:59Z","cross_cats_sorted":["stat.TH"],"title_canon_sha256":"8dee0eb785654a2ca0a6d92ef3f7ceb1bb351c7479f310ea38327aaec28f71e1","abstract_canon_sha256":"8380dfb7a912e0272c5fab64efb5e8f65bc2d7a62bad6440dc8cdad089bcaecf"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T23:52:40.181833Z","signature_b64":"IUocgneKjPgvGE8u4/c6G+3+/u+uo8outC1JwnobVf2V4x2W/Ohc/9rHezbMwPRO/OzbEC094wSfrnANrSPCDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"b9fc3311f54b1ecfab2b4bb41020c806e776b723819a242f52656e6ccc83d55d","last_reissued_at":"2026-07-04T23:52:40.181420Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T23:52:40.181420Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Extending the Davis-Kahan theorem for comparing eigenvectors of two symmetric matrices II: Computation and Applications","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.TH"],"primary_cat":"math.ST","authors_text":"A. T. Walden, J. F. Lutzeyer","submitted_at":"2019-08-09T14:09:59Z","abstract_excerpt":"The extended Davis-Kahan theorem makes use of polynomial matrix transformations to produce bounds at least as tight as the standard Davis-Kahan theorem. The optimization problem of finding transformation parameters resulting in optimal bounds from the extended Davis-Kahan theorem is presented for affine transformations. It is demonstrated how globally optimal bound values can be computed automatically using fractional programming theory. Two different solution approaches, the Charnes-Cooper transformation and Dinkelbach's algorithm are reviewed. Our implementation of the extended Davis--Kahan "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1908.03465","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/1908.03465/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":"1908.03465","created_at":"2026-07-04T23:52:40.181476+00:00"},{"alias_kind":"arxiv_version","alias_value":"1908.03465v1","created_at":"2026-07-04T23:52:40.181476+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1908.03465","created_at":"2026-07-04T23:52:40.181476+00:00"},{"alias_kind":"pith_short_12","alias_value":"XH6DGEPVJMPM","created_at":"2026-07-04T23:52:40.181476+00:00"},{"alias_kind":"pith_short_16","alias_value":"XH6DGEPVJMPM7KZL","created_at":"2026-07-04T23:52:40.181476+00:00"},{"alias_kind":"pith_short_8","alias_value":"XH6DGEPV","created_at":"2026-07-04T23:52:40.181476+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/XH6DGEPVJMPM7KZLJO2BAIGIA3","json":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3.json","graph_json":"https://pith.science/api/pith-number/XH6DGEPVJMPM7KZLJO2BAIGIA3/graph.json","events_json":"https://pith.science/api/pith-number/XH6DGEPVJMPM7KZLJO2BAIGIA3/events.json","paper":"https://pith.science/paper/XH6DGEPV"},"agent_actions":{"view_html":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3","download_json":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3.json","view_paper":"https://pith.science/paper/XH6DGEPV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1908.03465&json=true","fetch_graph":"https://pith.science/api/pith-number/XH6DGEPVJMPM7KZLJO2BAIGIA3/graph.json","fetch_events":"https://pith.science/api/pith-number/XH6DGEPVJMPM7KZLJO2BAIGIA3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3/action/storage_attestation","attest_author":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3/action/author_attestation","sign_citation":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3/action/citation_signature","submit_replication":"https://pith.science/pith/XH6DGEPVJMPM7KZLJO2BAIGIA3/action/replication_record"}},"created_at":"2026-07-04T23:52:40.181476+00:00","updated_at":"2026-07-04T23:52:40.181476+00:00"}