{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:YOABL4XHHPESLG24ALWQ6CWETW","short_pith_number":"pith:YOABL4XH","schema_version":"1.0","canonical_sha256":"c38015f2e73bc9259b5c02ed0f0ac49dae6fb7d5302b6e3e46a55475c93cb6e7","source":{"kind":"arxiv","id":"2010.04684","version":3},"attestation_state":"computed","paper":{"title":"$L_1$-norm regularized $L_1$-norm best-fit line problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. Paul Brooks, Xiao Ling","submitted_at":"2020-10-09T17:07:52Z","abstract_excerpt":"This work develops a sparse and outlier-insensitive method to fit a one-dimensional subspace that can be used as a replacement for eigenvector methods such as principal component analysis (PCA). The method is insensitive to outlier observations by formulating procedures as optimization problems that seek the best-fit line according to the $\\ell^1$ norm. It is also capable of producing sparse principal components by leveraging an additional penalty term induce sparsity. The algorithm has a worst-case time complexity of $O{(m^2n \\log n)}$ and, under certain conditions, produces a globally optima"},"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":"2010.04684","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2020-10-09T17:07:52Z","cross_cats_sorted":[],"title_canon_sha256":"abcb24533b961f1cac49af5726bb5d7f7b7b528b2cebd380927e449668565193","abstract_canon_sha256":"7a3e05ed7d763e165d87184176e9d3f738d30818559bd8001119a34a085d5a6d"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T05:35:40.701595Z","signature_b64":"E5tbklK2vAA6g6oAMQ3BFIoBRtg5MnI6QSU6Fw4PlWX5PgsE41vgszSbmRYrWPuVw6JPYgpbur3dZz8WP/aKBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c38015f2e73bc9259b5c02ed0f0ac49dae6fb7d5302b6e3e46a55475c93cb6e7","last_reissued_at":"2026-07-05T05:35:40.701128Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T05:35:40.701128Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"$L_1$-norm regularized $L_1$-norm best-fit line problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.OC","authors_text":"J. Paul Brooks, Xiao Ling","submitted_at":"2020-10-09T17:07:52Z","abstract_excerpt":"This work develops a sparse and outlier-insensitive method to fit a one-dimensional subspace that can be used as a replacement for eigenvector methods such as principal component analysis (PCA). The method is insensitive to outlier observations by formulating procedures as optimization problems that seek the best-fit line according to the $\\ell^1$ norm. It is also capable of producing sparse principal components by leveraging an additional penalty term induce sparsity. The algorithm has a worst-case time complexity of $O{(m^2n \\log n)}$ and, under certain conditions, produces a globally optima"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2010.04684","kind":"arxiv","version":3},"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/2010.04684/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":"2010.04684","created_at":"2026-07-05T05:35:40.701181+00:00"},{"alias_kind":"arxiv_version","alias_value":"2010.04684v3","created_at":"2026-07-05T05:35:40.701181+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2010.04684","created_at":"2026-07-05T05:35:40.701181+00:00"},{"alias_kind":"pith_short_12","alias_value":"YOABL4XHHPES","created_at":"2026-07-05T05:35:40.701181+00:00"},{"alias_kind":"pith_short_16","alias_value":"YOABL4XHHPESLG24","created_at":"2026-07-05T05:35:40.701181+00:00"},{"alias_kind":"pith_short_8","alias_value":"YOABL4XH","created_at":"2026-07-05T05:35:40.701181+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/YOABL4XHHPESLG24ALWQ6CWETW","json":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW.json","graph_json":"https://pith.science/api/pith-number/YOABL4XHHPESLG24ALWQ6CWETW/graph.json","events_json":"https://pith.science/api/pith-number/YOABL4XHHPESLG24ALWQ6CWETW/events.json","paper":"https://pith.science/paper/YOABL4XH"},"agent_actions":{"view_html":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW","download_json":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW.json","view_paper":"https://pith.science/paper/YOABL4XH","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2010.04684&json=true","fetch_graph":"https://pith.science/api/pith-number/YOABL4XHHPESLG24ALWQ6CWETW/graph.json","fetch_events":"https://pith.science/api/pith-number/YOABL4XHHPESLG24ALWQ6CWETW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW/action/storage_attestation","attest_author":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW/action/author_attestation","sign_citation":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW/action/citation_signature","submit_replication":"https://pith.science/pith/YOABL4XHHPESLG24ALWQ6CWETW/action/replication_record"}},"created_at":"2026-07-05T05:35:40.701181+00:00","updated_at":"2026-07-05T05:35:40.701181+00:00"}