{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6JGE42K5SMC5WSZ2MEZS7ELJRS","short_pith_number":"pith:6JGE42K5","canonical_record":{"source":{"id":"1811.10778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-11-27T02:31:29Z","cross_cats_sorted":[],"title_canon_sha256":"04b268a90f177361abb8618d9da52185955d6839fb4c20ecd34a4e10d0e7bc12","abstract_canon_sha256":"0d4aba1133a57d9d487f4a1b0c5517fe02ede59131e82310c8dcbb07f3ae040e"},"schema_version":"1.0"},"canonical_sha256":"f24c4e695d9305db4b3a61332f91698cac14e424f46440092638a3067ddb4e3e","source":{"kind":"arxiv","id":"1811.10778","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10778","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10778v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10778","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"6JGE42K5SMC5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6JGE42K5SMC5WSZ2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6JGE42K5","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6JGE42K5SMC5WSZ2MEZS7ELJRS","target":"record","payload":{"canonical_record":{"source":{"id":"1811.10778","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-11-27T02:31:29Z","cross_cats_sorted":[],"title_canon_sha256":"04b268a90f177361abb8618d9da52185955d6839fb4c20ecd34a4e10d0e7bc12","abstract_canon_sha256":"0d4aba1133a57d9d487f4a1b0c5517fe02ede59131e82310c8dcbb07f3ae040e"},"schema_version":"1.0"},"canonical_sha256":"f24c4e695d9305db4b3a61332f91698cac14e424f46440092638a3067ddb4e3e","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:59:47.559265Z","signature_b64":"3Yh0dBzBaAHRsgFbrmzqoGZRzNqNgA2Z/FwWLyMkWELWNGR6QmNBsALUuPcegaBDzVffMisepRNgwBjIX+1VBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f24c4e695d9305db4b3a61332f91698cac14e424f46440092638a3067ddb4e3e","last_reissued_at":"2026-05-17T23:59:47.558879Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:59:47.558879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.10778","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-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"QF52iVzgMkqqIXuYQ+4KqClgBjeSD2FihCVlDGXIyy9iazbr8bOU6VNOLo/J1y9coemRojtJk9jygnkJ5QnjDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:48:19.610400Z"},"content_sha256":"f33bbfcafc3639a8ac2847ba4f0434cdf308b32c90ad09d42999a7590a62dd3d","schema_version":"1.0","event_id":"sha256:f33bbfcafc3639a8ac2847ba4f0434cdf308b32c90ad09d42999a7590a62dd3d"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6JGE42K5SMC5WSZ2MEZS7ELJRS","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Generalized Structured Low-Rank Matrix Completion Algorithm for MR Image Recovery","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.IV","authors_text":"Mathews Jacob, Xiaohan Liu, Yue Hu","submitted_at":"2018-11-27T02:31:29Z","abstract_excerpt":"Recent theory of mapping an image into a structured low-rank Toeplitz or Hankel matrix has become an effective method to restore images. In this paper, we introduce a generalized structured low-rank algorithm to recover images from their undersampled Fourier coefficients using infimal convolution regularizations. The image is modeled as the superposition of a piecewise constant component and a piecewise linear component. The Fourier coefficients of each component satisfy an annihilation relation, which results in a structured Toeplitz matrix, respectively. We exploit the low-rank property of t"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10778","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-17T23:59:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zof1poLbL4RMYQVDaYOXbWZnKqW8mukyYFksWuRTWlOsw/sASOgNjvsn/kGaCZ/Bh40t/WhDBCyBqr/iWMK/CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T11:48:19.611101Z"},"content_sha256":"ada18dc8ff0b580c184bd9afc5fb65558998e37c79ad593d89a2192791c0dd6c","schema_version":"1.0","event_id":"sha256:ada18dc8ff0b580c184bd9afc5fb65558998e37c79ad593d89a2192791c0dd6c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6JGE42K5SMC5WSZ2MEZS7ELJRS/bundle.json","state_url":"https://pith.science/pith/6JGE42K5SMC5WSZ2MEZS7ELJRS/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6JGE42K5SMC5WSZ2MEZS7ELJRS/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-07T11:48:19Z","links":{"resolver":"https://pith.science/pith/6JGE42K5SMC5WSZ2MEZS7ELJRS","bundle":"https://pith.science/pith/6JGE42K5SMC5WSZ2MEZS7ELJRS/bundle.json","state":"https://pith.science/pith/6JGE42K5SMC5WSZ2MEZS7ELJRS/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6JGE42K5SMC5WSZ2MEZS7ELJRS/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6JGE42K5SMC5WSZ2MEZS7ELJRS","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":"0d4aba1133a57d9d487f4a1b0c5517fe02ede59131e82310c8dcbb07f3ae040e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-11-27T02:31:29Z","title_canon_sha256":"04b268a90f177361abb8618d9da52185955d6839fb4c20ecd34a4e10d0e7bc12"},"schema_version":"1.0","source":{"id":"1811.10778","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.10778","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"arxiv_version","alias_value":"1811.10778v1","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.10778","created_at":"2026-05-17T23:59:47Z"},{"alias_kind":"pith_short_12","alias_value":"6JGE42K5SMC5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6JGE42K5SMC5WSZ2","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6JGE42K5","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:ada18dc8ff0b580c184bd9afc5fb65558998e37c79ad593d89a2192791c0dd6c","target":"graph","created_at":"2026-05-17T23:59:47Z","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":"Recent theory of mapping an image into a structured low-rank Toeplitz or Hankel matrix has become an effective method to restore images. In this paper, we introduce a generalized structured low-rank algorithm to recover images from their undersampled Fourier coefficients using infimal convolution regularizations. The image is modeled as the superposition of a piecewise constant component and a piecewise linear component. The Fourier coefficients of each component satisfy an annihilation relation, which results in a structured Toeplitz matrix, respectively. We exploit the low-rank property of t","authors_text":"Mathews Jacob, Xiaohan Liu, Yue Hu","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-11-27T02:31:29Z","title":"A Generalized Structured Low-Rank Matrix Completion Algorithm for MR Image Recovery"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.10778","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:f33bbfcafc3639a8ac2847ba4f0434cdf308b32c90ad09d42999a7590a62dd3d","target":"record","created_at":"2026-05-17T23:59:47Z","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":"0d4aba1133a57d9d487f4a1b0c5517fe02ede59131e82310c8dcbb07f3ae040e","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.IV","submitted_at":"2018-11-27T02:31:29Z","title_canon_sha256":"04b268a90f177361abb8618d9da52185955d6839fb4c20ecd34a4e10d0e7bc12"},"schema_version":"1.0","source":{"id":"1811.10778","kind":"arxiv","version":1}},"canonical_sha256":"f24c4e695d9305db4b3a61332f91698cac14e424f46440092638a3067ddb4e3e","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f24c4e695d9305db4b3a61332f91698cac14e424f46440092638a3067ddb4e3e","first_computed_at":"2026-05-17T23:59:47.558879Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:59:47.558879Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3Yh0dBzBaAHRsgFbrmzqoGZRzNqNgA2Z/FwWLyMkWELWNGR6QmNBsALUuPcegaBDzVffMisepRNgwBjIX+1VBg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:59:47.559265Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.10778","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f33bbfcafc3639a8ac2847ba4f0434cdf308b32c90ad09d42999a7590a62dd3d","sha256:ada18dc8ff0b580c184bd9afc5fb65558998e37c79ad593d89a2192791c0dd6c"],"state_sha256":"d8e287da7a08f7dad8895fbe991d4c96a98500fcb750617fd0a3e8ffc6843608"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"66kEi2K9gsFXD0hVqaoa1yiJtncP5w5hK+e1rcMSwfaHJLmVF/geEKXoDTw2OCFaGsqX52g/DlKQSZLWjm+vCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T11:48:19.614621Z","bundle_sha256":"0f8f4c314527ed02064d34fdbb3beba671dd1f5ba629bab86cf8c9cf37417d8b"}}