{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:YVKAHJ5IT3FTWNE35IRL6ORJQ3","short_pith_number":"pith:YVKAHJ5I","schema_version":"1.0","canonical_sha256":"c55403a7a89ecb3b349bea22bf3a2986ce16aaf0602b4f122109745b411f7627","source":{"kind":"arxiv","id":"2308.13777","version":2},"attestation_state":"computed","paper":{"title":"Self-Supervised Scalable Deep Compressed Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"eess.SP","authors_text":"Bin Chen, Jian Zhang, Shuai Liu, Xuanyu Zhang, Yongbing Zhang","submitted_at":"2023-08-26T06:03:06Z","abstract_excerpt":"Compressed sensing (CS) is a promising tool for reducing sampling costs. Current deep neural network (NN)-based CS methods face the challenges of collecting labeled measurement-ground truth (GT) data and generalizing to real applications. This paper proposes a novel $\\mathbf{S}$elf-supervised s$\\mathbf{C}$alable deep CS method, comprising a deep $\\mathbf{L}$earning scheme called $\\mathbf{SCL}$ and a family of $\\mathbf{Net}$works named $\\mathbf{SCNet}$, which does not require GT and can handle arbitrary sampling ratios and matrices once trained on a partial measurement set. Our SCL contains a d"},"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":"2308.13777","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"eess.SP","submitted_at":"2023-08-26T06:03:06Z","cross_cats_sorted":["cs.CV","cs.LG"],"title_canon_sha256":"7d5144c45ca88f9ac697eb02c3c8ecd094c229595d1cfd28b843924283ae9544","abstract_canon_sha256":"2757afc5dcd4317952784f326488bbe8230c0b1834ecf6c35b21f4a165073b12"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:55:06.646056Z","signature_b64":"bt+K/0PegXE6iJAyFu057hJjvoAiu9YgSCheTCOV7AmHYorG94k92XF3nF9gLe6uK0Mj6ux0HFNItrQWiV7WDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c55403a7a89ecb3b349bea22bf3a2986ce16aaf0602b4f122109745b411f7627","last_reissued_at":"2026-07-05T08:55:06.645681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:55:06.645681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Self-Supervised Scalable Deep Compressed Sensing","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.CV","cs.LG"],"primary_cat":"eess.SP","authors_text":"Bin Chen, Jian Zhang, Shuai Liu, Xuanyu Zhang, Yongbing Zhang","submitted_at":"2023-08-26T06:03:06Z","abstract_excerpt":"Compressed sensing (CS) is a promising tool for reducing sampling costs. Current deep neural network (NN)-based CS methods face the challenges of collecting labeled measurement-ground truth (GT) data and generalizing to real applications. This paper proposes a novel $\\mathbf{S}$elf-supervised s$\\mathbf{C}$alable deep CS method, comprising a deep $\\mathbf{L}$earning scheme called $\\mathbf{SCL}$ and a family of $\\mathbf{Net}$works named $\\mathbf{SCNet}$, which does not require GT and can handle arbitrary sampling ratios and matrices once trained on a partial measurement set. Our SCL contains a d"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2308.13777","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2308.13777/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":"2308.13777","created_at":"2026-07-05T08:55:06.645739+00:00"},{"alias_kind":"arxiv_version","alias_value":"2308.13777v2","created_at":"2026-07-05T08:55:06.645739+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2308.13777","created_at":"2026-07-05T08:55:06.645739+00:00"},{"alias_kind":"pith_short_12","alias_value":"YVKAHJ5IT3FT","created_at":"2026-07-05T08:55:06.645739+00:00"},{"alias_kind":"pith_short_16","alias_value":"YVKAHJ5IT3FTWNE3","created_at":"2026-07-05T08:55:06.645739+00:00"},{"alias_kind":"pith_short_8","alias_value":"YVKAHJ5I","created_at":"2026-07-05T08:55:06.645739+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2501.04608","citing_title":"Comprehensive Examination of Unrolled Networks for Solving Linear Inverse Problems","ref_index":36,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3","json":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3.json","graph_json":"https://pith.science/api/pith-number/YVKAHJ5IT3FTWNE35IRL6ORJQ3/graph.json","events_json":"https://pith.science/api/pith-number/YVKAHJ5IT3FTWNE35IRL6ORJQ3/events.json","paper":"https://pith.science/paper/YVKAHJ5I"},"agent_actions":{"view_html":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3","download_json":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3.json","view_paper":"https://pith.science/paper/YVKAHJ5I","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2308.13777&json=true","fetch_graph":"https://pith.science/api/pith-number/YVKAHJ5IT3FTWNE35IRL6ORJQ3/graph.json","fetch_events":"https://pith.science/api/pith-number/YVKAHJ5IT3FTWNE35IRL6ORJQ3/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3/action/storage_attestation","attest_author":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3/action/author_attestation","sign_citation":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3/action/citation_signature","submit_replication":"https://pith.science/pith/YVKAHJ5IT3FTWNE35IRL6ORJQ3/action/replication_record"}},"created_at":"2026-07-05T08:55:06.645739+00:00","updated_at":"2026-07-05T08:55:06.645739+00:00"}