{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:FTVEVNPYVUFRSDTKIJIPTY3SL3","short_pith_number":"pith:FTVEVNPY","canonical_record":{"source":{"id":"1101.2342","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2011-01-12T12:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"e4cb87ef7415207db616d4997e599723e9f3ef7895c5cb1e184e2be897c0cb2b","abstract_canon_sha256":"1b04048411dfc856946da9697c3a21902bb25bb6b6437f87e88dcc112b9c6e0c"},"schema_version":"1.0"},"canonical_sha256":"2cea4ab5f8ad0b190e6a4250f9e3725ec26ddd7ff4d813f7f53cc69406a835e5","source":{"kind":"arxiv","id":"1101.2342","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2342","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2342v1","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2342","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"FTVEVNPYVUFR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTVEVNPYVUFRSDTK","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTVEVNPY","created_at":"2026-05-18T12:26:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:FTVEVNPYVUFRSDTKIJIPTY3SL3","target":"record","payload":{"canonical_record":{"source":{"id":"1101.2342","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2011-01-12T12:42:18Z","cross_cats_sorted":[],"title_canon_sha256":"e4cb87ef7415207db616d4997e599723e9f3ef7895c5cb1e184e2be897c0cb2b","abstract_canon_sha256":"1b04048411dfc856946da9697c3a21902bb25bb6b6437f87e88dcc112b9c6e0c"},"schema_version":"1.0"},"canonical_sha256":"2cea4ab5f8ad0b190e6a4250f9e3725ec26ddd7ff4d813f7f53cc69406a835e5","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:31:43.145067Z","signature_b64":"zwZM4OGsJt85Wi+drroN7h5i9//Ye0hL6S/zC6HCrhJEXq4apTqsfICgCuGCwkqocyUiXwTd3O2q+a4r6xPoCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2cea4ab5f8ad0b190e6a4250f9e3725ec26ddd7ff4d813f7f53cc69406a835e5","last_reissued_at":"2026-05-18T04:31:43.144708Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:31:43.144708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1101.2342","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-18T04:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nxvzIM4CMlfX1IAoqt7UwfIAUgtScJKPghT2nLxfDNUqGow8QiETundizPxJnWmfJluN+qcmYysueVIINLubCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:48:10.877776Z"},"content_sha256":"a8ac50c9a4759991a27cdb630b6b794aa7d586b825851c348c4e04c42d1eaa5d","schema_version":"1.0","event_id":"sha256:a8ac50c9a4759991a27cdb630b6b794aa7d586b825851c348c4e04c42d1eaa5d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:FTVEVNPYVUFRSDTKIJIPTY3SL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A contribution to the condition number of the total least squares problem","license":"http://creativecommons.org/licenses/by/3.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Bingyu Li, Zhongxiao Jia","submitted_at":"2011-01-12T12:42:18Z","abstract_excerpt":"This paper concerns cheaply computable formulas and bounds for the condition number of the TLS problem. For a TLS problem with data $A$, $b$, two formulas are derived that are simpler and more compact than the known results in the literature. One is derived by exploiting the properties of Kronecker products of matrices. The other is obtained by making use of the singular value decomposition (SVD) of $[A \\,\\,b]$, which allows us to compute the condition number cheaply and accurately. We present lower and upper bounds for the condition number that involve the singular values of $[A \\,\\, b]$ and "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2342","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-18T04:31:43Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mRYOpWWtYogmpQCF1Fz7d7RPGDCEsZ7GvcYDluoCAjOcpVEJRQu1aumG4UDkbc65Tdon0exHvRiydGHLQr+eCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T13:48:10.878118Z"},"content_sha256":"a4598a7ced0175b627905a13c99715a093a424cab22e5a426b5a141bbdbd58ce","schema_version":"1.0","event_id":"sha256:a4598a7ced0175b627905a13c99715a093a424cab22e5a426b5a141bbdbd58ce"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FTVEVNPYVUFRSDTKIJIPTY3SL3/bundle.json","state_url":"https://pith.science/pith/FTVEVNPYVUFRSDTKIJIPTY3SL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FTVEVNPYVUFRSDTKIJIPTY3SL3/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-05-28T13:48:10Z","links":{"resolver":"https://pith.science/pith/FTVEVNPYVUFRSDTKIJIPTY3SL3","bundle":"https://pith.science/pith/FTVEVNPYVUFRSDTKIJIPTY3SL3/bundle.json","state":"https://pith.science/pith/FTVEVNPYVUFRSDTKIJIPTY3SL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FTVEVNPYVUFRSDTKIJIPTY3SL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:FTVEVNPYVUFRSDTKIJIPTY3SL3","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":"1b04048411dfc856946da9697c3a21902bb25bb6b6437f87e88dcc112b9c6e0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2011-01-12T12:42:18Z","title_canon_sha256":"e4cb87ef7415207db616d4997e599723e9f3ef7895c5cb1e184e2be897c0cb2b"},"schema_version":"1.0","source":{"id":"1101.2342","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1101.2342","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"arxiv_version","alias_value":"1101.2342v1","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1101.2342","created_at":"2026-05-18T04:31:43Z"},{"alias_kind":"pith_short_12","alias_value":"FTVEVNPYVUFR","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_16","alias_value":"FTVEVNPYVUFRSDTK","created_at":"2026-05-18T12:26:28Z"},{"alias_kind":"pith_short_8","alias_value":"FTVEVNPY","created_at":"2026-05-18T12:26:28Z"}],"graph_snapshots":[{"event_id":"sha256:a4598a7ced0175b627905a13c99715a093a424cab22e5a426b5a141bbdbd58ce","target":"graph","created_at":"2026-05-18T04:31:43Z","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":"This paper concerns cheaply computable formulas and bounds for the condition number of the TLS problem. For a TLS problem with data $A$, $b$, two formulas are derived that are simpler and more compact than the known results in the literature. One is derived by exploiting the properties of Kronecker products of matrices. The other is obtained by making use of the singular value decomposition (SVD) of $[A \\,\\,b]$, which allows us to compute the condition number cheaply and accurately. We present lower and upper bounds for the condition number that involve the singular values of $[A \\,\\, b]$ and ","authors_text":"Bingyu Li, Zhongxiao Jia","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2011-01-12T12:42:18Z","title":"A contribution to the condition number of the total least squares problem"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1101.2342","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:a8ac50c9a4759991a27cdb630b6b794aa7d586b825851c348c4e04c42d1eaa5d","target":"record","created_at":"2026-05-18T04:31:43Z","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":"1b04048411dfc856946da9697c3a21902bb25bb6b6437f87e88dcc112b9c6e0c","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/3.0/","primary_cat":"math.NA","submitted_at":"2011-01-12T12:42:18Z","title_canon_sha256":"e4cb87ef7415207db616d4997e599723e9f3ef7895c5cb1e184e2be897c0cb2b"},"schema_version":"1.0","source":{"id":"1101.2342","kind":"arxiv","version":1}},"canonical_sha256":"2cea4ab5f8ad0b190e6a4250f9e3725ec26ddd7ff4d813f7f53cc69406a835e5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2cea4ab5f8ad0b190e6a4250f9e3725ec26ddd7ff4d813f7f53cc69406a835e5","first_computed_at":"2026-05-18T04:31:43.144708Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:31:43.144708Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"zwZM4OGsJt85Wi+drroN7h5i9//Ye0hL6S/zC6HCrhJEXq4apTqsfICgCuGCwkqocyUiXwTd3O2q+a4r6xPoCA==","signature_status":"signed_v1","signed_at":"2026-05-18T04:31:43.145067Z","signed_message":"canonical_sha256_bytes"},"source_id":"1101.2342","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a8ac50c9a4759991a27cdb630b6b794aa7d586b825851c348c4e04c42d1eaa5d","sha256:a4598a7ced0175b627905a13c99715a093a424cab22e5a426b5a141bbdbd58ce"],"state_sha256":"6fd59381a2a8847eea72e24bbd93037d2fbef568005d3482cb6a6958cce0964c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H7+dwNu71FfYDA7s8e/oVO4iDkoBLDOofmhX7itEmysoKLdlGGK1oGcZhRHx6gSQJ1vOA8rbSj2MKAeYz1fjAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T13:48:10.880059Z","bundle_sha256":"2a6daac8c159d29a580a00c1320052923d521f376efbdbd7eb6f9c77809182eb"}}