{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:LQT3JIKQ36GCXFWXP6MCP7LHQT","short_pith_number":"pith:LQT3JIKQ","schema_version":"1.0","canonical_sha256":"5c27b4a150df8c2b96d77f9827fd6784d0487d4ba3ce23e8a04e6fd1ab14f360","source":{"kind":"arxiv","id":"1801.02303","version":1},"attestation_state":"computed","paper":{"title":"Joint Estimation of Low-Rank Components and Connectivity Graph in High-Dimensional Graph Signals: Application to Brain Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"eess.IV","authors_text":"Hossein Nejati, Ngai-Man Cheung, Rui Liu","submitted_at":"2018-01-08T03:53:38Z","abstract_excerpt":"This paper presents a graph signal processing algorithm to uncover the intrinsic low-rank components and the underlying graph of a high-dimensional, graph-smooth and grossly-corrupted dataset. In our problem formulation, we assume that the perturbation on the low-rank components is sparse and the signal is smooth on the graph. We propose an algorithm to estimate the low-rank components with the help of the graph and refine the graph with better estimated low-rank components. We propose to perform the low-rank estimation and graph refinement jointly so that low-rank estimation can benefit from "},"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":"1801.02303","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-01-08T03:53:38Z","cross_cats_sorted":["eess.SP"],"title_canon_sha256":"04e4ee31476ce6c9da01e3eb805c3d0457eba3de9e6870dd9155156cad537fae","abstract_canon_sha256":"1b46d3db37712c0e9114a23a11ae56ef422ede901e6f50206e4ec4163f5e173a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:26:32.106121Z","signature_b64":"Fy3/AGVEDlst7CyLVWVe9RuTPAZ0RrfLcpf3Sfbsnc3UiIkgcczuhk57iMD1eAvTRMuZz8FT9RboO+/s0g7zAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5c27b4a150df8c2b96d77f9827fd6784d0487d4ba3ce23e8a04e6fd1ab14f360","last_reissued_at":"2026-05-18T00:26:32.105593Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:26:32.105593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Joint Estimation of Low-Rank Components and Connectivity Graph in High-Dimensional Graph Signals: Application to Brain Imaging","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["eess.SP"],"primary_cat":"eess.IV","authors_text":"Hossein Nejati, Ngai-Man Cheung, Rui Liu","submitted_at":"2018-01-08T03:53:38Z","abstract_excerpt":"This paper presents a graph signal processing algorithm to uncover the intrinsic low-rank components and the underlying graph of a high-dimensional, graph-smooth and grossly-corrupted dataset. In our problem formulation, we assume that the perturbation on the low-rank components is sparse and the signal is smooth on the graph. We propose an algorithm to estimate the low-rank components with the help of the graph and refine the graph with better estimated low-rank components. We propose to perform the low-rank estimation and graph refinement jointly so that low-rank estimation can benefit from "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02303","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1801.02303","created_at":"2026-05-18T00:26:32.105679+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.02303v1","created_at":"2026-05-18T00:26:32.105679+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02303","created_at":"2026-05-18T00:26:32.105679+00:00"},{"alias_kind":"pith_short_12","alias_value":"LQT3JIKQ36GC","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_16","alias_value":"LQT3JIKQ36GCXFWX","created_at":"2026-05-18T12:32:37.024351+00:00"},{"alias_kind":"pith_short_8","alias_value":"LQT3JIKQ","created_at":"2026-05-18T12:32:37.024351+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/LQT3JIKQ36GCXFWXP6MCP7LHQT","json":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT.json","graph_json":"https://pith.science/api/pith-number/LQT3JIKQ36GCXFWXP6MCP7LHQT/graph.json","events_json":"https://pith.science/api/pith-number/LQT3JIKQ36GCXFWXP6MCP7LHQT/events.json","paper":"https://pith.science/paper/LQT3JIKQ"},"agent_actions":{"view_html":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT","download_json":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT.json","view_paper":"https://pith.science/paper/LQT3JIKQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.02303&json=true","fetch_graph":"https://pith.science/api/pith-number/LQT3JIKQ36GCXFWXP6MCP7LHQT/graph.json","fetch_events":"https://pith.science/api/pith-number/LQT3JIKQ36GCXFWXP6MCP7LHQT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/action/storage_attestation","attest_author":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/action/author_attestation","sign_citation":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/action/citation_signature","submit_replication":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/action/replication_record"}},"created_at":"2026-05-18T00:26:32.105679+00:00","updated_at":"2026-05-18T00:26:32.105679+00:00"}