{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:6BHTJ2DMNC7GF2VQENXF6XK52I","short_pith_number":"pith:6BHTJ2DM","canonical_record":{"source":{"id":"1401.6832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-01-27T12:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"11c979f91206fc2c9d28557f0a4825a5035f7cdea364f53b606d91d9b758e2b1","abstract_canon_sha256":"0345c07a0b136894889204ced0ade707d986d7fb4f25a5d436136573769366e4"},"schema_version":"1.0"},"canonical_sha256":"f04f34e86c68be62eab0236e5f5d5dd238be4cc4c5b5d0fdf7ba275d6031928b","source":{"kind":"arxiv","id":"1401.6832","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6832","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6832v2","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6832","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"6BHTJ2DMNC7G","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6BHTJ2DMNC7GF2VQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6BHTJ2DM","created_at":"2026-05-18T12:28:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:6BHTJ2DMNC7GF2VQENXF6XK52I","target":"record","payload":{"canonical_record":{"source":{"id":"1401.6832","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-01-27T12:56:42Z","cross_cats_sorted":[],"title_canon_sha256":"11c979f91206fc2c9d28557f0a4825a5035f7cdea364f53b606d91d9b758e2b1","abstract_canon_sha256":"0345c07a0b136894889204ced0ade707d986d7fb4f25a5d436136573769366e4"},"schema_version":"1.0"},"canonical_sha256":"f04f34e86c68be62eab0236e5f5d5dd238be4cc4c5b5d0fdf7ba275d6031928b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:37:58.835499Z","signature_b64":"p857MIYSLEpM8KKqPPHyGBRNPsfuoVEWYC/RRrpLKMrSSXMFUEb+j/ekgl8tLe6FIGvZhSmxxUyWTMWSG3M5Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f04f34e86c68be62eab0236e5f5d5dd238be4cc4c5b5d0fdf7ba275d6031928b","last_reissued_at":"2026-05-18T02:37:58.834956Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:37:58.834956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1401.6832","source_version":2,"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-18T02:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Q7iWD+uciRQdJpT871VAZOUpCKjoJK30RPrSu0JHYG2p3+bCe28wAnBV0LpEwQsnYxFCJivVSmLLnAA/iJdnCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:27:02.484667Z"},"content_sha256":"97f73dafa47a832ab163917c921b66651ed778b4c36934884330b4a48d2e9ec9","schema_version":"1.0","event_id":"sha256:97f73dafa47a832ab163917c921b66651ed778b4c36934884330b4a48d2e9ec9"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:6BHTJ2DMNC7GF2VQENXF6XK52I","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Perturbation Analysis and Randomized Algorithms for Large-Scale Total Least Squares Problems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.NA","authors_text":"Hua Xiang, Pengpeng Xie, Yimin Wei","submitted_at":"2014-01-27T12:56:42Z","abstract_excerpt":"In this paper, we present perturbation analysis and randomized algorithms for the total least squares (TLS) problems. We derive the perturbation bound and check its sharpness by numerical experiments. Motivated by the recently popular probabilistic algorithms for low-rank approximations, we develop randomized algorithms for the TLS and the truncated total least squares (TTLS) solutions of large-scale discrete ill-posed problems, which can greatly reduce the computational time and still keep good accuracy."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6832","kind":"arxiv","version":2},"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-18T02:37:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1hfcLegQzbiNrmC2ari7B5JWwvfU8C3cGf4381o/mGBppyiR8J4lTcVLplY/H10rwRtXXcAM070LoRrCIaU8AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-23T00:27:02.485011Z"},"content_sha256":"8f9b13e3eb895a78e6c6d9e8ab383e8d351f3f27634f9f11286e307a41c444b4","schema_version":"1.0","event_id":"sha256:8f9b13e3eb895a78e6c6d9e8ab383e8d351f3f27634f9f11286e307a41c444b4"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6BHTJ2DMNC7GF2VQENXF6XK52I/bundle.json","state_url":"https://pith.science/pith/6BHTJ2DMNC7GF2VQENXF6XK52I/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6BHTJ2DMNC7GF2VQENXF6XK52I/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-23T00:27:02Z","links":{"resolver":"https://pith.science/pith/6BHTJ2DMNC7GF2VQENXF6XK52I","bundle":"https://pith.science/pith/6BHTJ2DMNC7GF2VQENXF6XK52I/bundle.json","state":"https://pith.science/pith/6BHTJ2DMNC7GF2VQENXF6XK52I/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6BHTJ2DMNC7GF2VQENXF6XK52I/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:6BHTJ2DMNC7GF2VQENXF6XK52I","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":"0345c07a0b136894889204ced0ade707d986d7fb4f25a5d436136573769366e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-01-27T12:56:42Z","title_canon_sha256":"11c979f91206fc2c9d28557f0a4825a5035f7cdea364f53b606d91d9b758e2b1"},"schema_version":"1.0","source":{"id":"1401.6832","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1401.6832","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"arxiv_version","alias_value":"1401.6832v2","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1401.6832","created_at":"2026-05-18T02:37:58Z"},{"alias_kind":"pith_short_12","alias_value":"6BHTJ2DMNC7G","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_16","alias_value":"6BHTJ2DMNC7GF2VQ","created_at":"2026-05-18T12:28:16Z"},{"alias_kind":"pith_short_8","alias_value":"6BHTJ2DM","created_at":"2026-05-18T12:28:16Z"}],"graph_snapshots":[{"event_id":"sha256:8f9b13e3eb895a78e6c6d9e8ab383e8d351f3f27634f9f11286e307a41c444b4","target":"graph","created_at":"2026-05-18T02:37:58Z","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":"In this paper, we present perturbation analysis and randomized algorithms for the total least squares (TLS) problems. We derive the perturbation bound and check its sharpness by numerical experiments. Motivated by the recently popular probabilistic algorithms for low-rank approximations, we develop randomized algorithms for the TLS and the truncated total least squares (TTLS) solutions of large-scale discrete ill-posed problems, which can greatly reduce the computational time and still keep good accuracy.","authors_text":"Hua Xiang, Pengpeng Xie, Yimin Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-01-27T12:56:42Z","title":"Perturbation Analysis and Randomized Algorithms for Large-Scale Total Least Squares Problems"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1401.6832","kind":"arxiv","version":2},"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:97f73dafa47a832ab163917c921b66651ed778b4c36934884330b4a48d2e9ec9","target":"record","created_at":"2026-05-18T02:37:58Z","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":"0345c07a0b136894889204ced0ade707d986d7fb4f25a5d436136573769366e4","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.NA","submitted_at":"2014-01-27T12:56:42Z","title_canon_sha256":"11c979f91206fc2c9d28557f0a4825a5035f7cdea364f53b606d91d9b758e2b1"},"schema_version":"1.0","source":{"id":"1401.6832","kind":"arxiv","version":2}},"canonical_sha256":"f04f34e86c68be62eab0236e5f5d5dd238be4cc4c5b5d0fdf7ba275d6031928b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f04f34e86c68be62eab0236e5f5d5dd238be4cc4c5b5d0fdf7ba275d6031928b","first_computed_at":"2026-05-18T02:37:58.834956Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:37:58.834956Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"p857MIYSLEpM8KKqPPHyGBRNPsfuoVEWYC/RRrpLKMrSSXMFUEb+j/ekgl8tLe6FIGvZhSmxxUyWTMWSG3M5Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:37:58.835499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1401.6832","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:97f73dafa47a832ab163917c921b66651ed778b4c36934884330b4a48d2e9ec9","sha256:8f9b13e3eb895a78e6c6d9e8ab383e8d351f3f27634f9f11286e307a41c444b4"],"state_sha256":"82ae783f0eec75b0265c9e92dfecacfabe5bdc2120b7e982f959fb47dda087cf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AzIsNWO/Q/XrsP88Lb/ucYs4Rhea7yT0SAzu7W8Dig6JEqIwUc+a7hQ+wyt1BSt0Y0R2NUXt+WPhrfYfY9FiBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-23T00:27:02.487035Z","bundle_sha256":"ba867f838b85222a23f6c4af3a6c1b25636ae41e3b6b780feb835cd15e07a808"}}