{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:LQT3JIKQ36GCXFWXP6MCP7LHQT","short_pith_number":"pith:LQT3JIKQ","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"},"canonical_sha256":"5c27b4a150df8c2b96d77f9827fd6784d0487d4ba3ce23e8a04e6fd1ab14f360","source":{"kind":"arxiv","id":"1801.02303","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02303","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02303v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02303","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"LQT3JIKQ36GC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LQT3JIKQ36GCXFWX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LQT3JIKQ","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:LQT3JIKQ36GCXFWXP6MCP7LHQT","target":"record","payload":{"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"},"canonical_sha256":"5c27b4a150df8c2b96d77f9827fd6784d0487d4ba3ce23e8a04e6fd1ab14f360","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"},"source_kind":"arxiv","source_id":"1801.02303","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-18T00:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"pW7qF1tww1gyEu6kl5Q8F+zV5I6Rpd3w15hpGYyLJORm7Zyp/gRLOhnnqZCDnKRGb42VkJAjtCWJ2auWNFuyDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:04:24.038572Z"},"content_sha256":"d48b93d6b70d9f3e172af4bce72c22735476a5660031059d7fb2ce33b97c586e","schema_version":"1.0","event_id":"sha256:d48b93d6b70d9f3e172af4bce72c22735476a5660031059d7fb2ce33b97c586e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:LQT3JIKQ36GCXFWXP6MCP7LHQT","target":"graph","payload":{"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"},"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-18T00:26:32Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"EJnKg1FulYvb+mBvrIs92NY7+zMIBiZiHnHAAS2e0ChUupjtnDJzV3huHg7q2Ecdfui4jF70Ush1upzHS7eWCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-02T22:04:24.039295Z"},"content_sha256":"e20ee7e2fc8944d719625c382f4f5284cf64e5eb11dd50fa79d7276c6f148658","schema_version":"1.0","event_id":"sha256:e20ee7e2fc8944d719625c382f4f5284cf64e5eb11dd50fa79d7276c6f148658"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/bundle.json","state_url":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/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-06-02T22:04:24Z","links":{"resolver":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT","bundle":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/bundle.json","state":"https://pith.science/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LQT3JIKQ36GCXFWXP6MCP7LHQT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:LQT3JIKQ36GCXFWXP6MCP7LHQT","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":"1b46d3db37712c0e9114a23a11ae56ef422ede901e6f50206e4ec4163f5e173a","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-01-08T03:53:38Z","title_canon_sha256":"04e4ee31476ce6c9da01e3eb805c3d0457eba3de9e6870dd9155156cad537fae"},"schema_version":"1.0","source":{"id":"1801.02303","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1801.02303","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"arxiv_version","alias_value":"1801.02303v1","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.02303","created_at":"2026-05-18T00:26:32Z"},{"alias_kind":"pith_short_12","alias_value":"LQT3JIKQ36GC","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"LQT3JIKQ36GCXFWX","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"LQT3JIKQ","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:e20ee7e2fc8944d719625c382f4f5284cf64e5eb11dd50fa79d7276c6f148658","target":"graph","created_at":"2026-05-18T00:26:32Z","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 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 ","authors_text":"Hossein Nejati, Ngai-Man Cheung, Rui Liu","cross_cats":["eess.SP"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-01-08T03:53:38Z","title":"Joint Estimation of Low-Rank Components and Connectivity Graph in High-Dimensional Graph Signals: Application to Brain Imaging"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.02303","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:d48b93d6b70d9f3e172af4bce72c22735476a5660031059d7fb2ce33b97c586e","target":"record","created_at":"2026-05-18T00:26:32Z","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":"1b46d3db37712c0e9114a23a11ae56ef422ede901e6f50206e4ec4163f5e173a","cross_cats_sorted":["eess.SP"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-01-08T03:53:38Z","title_canon_sha256":"04e4ee31476ce6c9da01e3eb805c3d0457eba3de9e6870dd9155156cad537fae"},"schema_version":"1.0","source":{"id":"1801.02303","kind":"arxiv","version":1}},"canonical_sha256":"5c27b4a150df8c2b96d77f9827fd6784d0487d4ba3ce23e8a04e6fd1ab14f360","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5c27b4a150df8c2b96d77f9827fd6784d0487d4ba3ce23e8a04e6fd1ab14f360","first_computed_at":"2026-05-18T00:26:32.105593Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:26:32.105593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Fy3/AGVEDlst7CyLVWVe9RuTPAZ0RrfLcpf3Sfbsnc3UiIkgcczuhk57iMD1eAvTRMuZz8FT9RboO+/s0g7zAg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:26:32.106121Z","signed_message":"canonical_sha256_bytes"},"source_id":"1801.02303","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d48b93d6b70d9f3e172af4bce72c22735476a5660031059d7fb2ce33b97c586e","sha256:e20ee7e2fc8944d719625c382f4f5284cf64e5eb11dd50fa79d7276c6f148658"],"state_sha256":"e592806f72df3d48e775662ae9d732e156a3d7b0d9363314a46c20a665051566"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"c9sAKABOYI7+f6rx6TbQtOLzWT+qegy1ZVxTIL2WjV8gpSwmxguobWQYAg3lcCA2AtBZWTIqUDAE3c5F7aKcBg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-02T22:04:24.043254Z","bundle_sha256":"b56ab246dad2968df7a05c65ef07fb6eb74c656c68ed85da77108600ca17392b"}}