{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:B337KBKP5HZ24MUB7O5FOYDVCF","short_pith_number":"pith:B337KBKP","schema_version":"1.0","canonical_sha256":"0ef7f5054fe9f3ae3281fbba576075116f97c9eb2ca8a337cf37c0bcc88f0a4a","source":{"kind":"arxiv","id":"2501.11229","version":1},"attestation_state":"computed","paper":{"title":"Successive Interference Cancellation-aided Diffusion Models for Joint Channel Estimation and Data Detection in Low Rank Channel Scenarios","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","eess.SP","math.IT"],"primary_cat":"cs.CV","authors_text":"John M. Cioffi, Kamyar Rajabalifardi, Muhammad Ahmed Mohsin, Sagnik Bhattacharya","submitted_at":"2025-01-20T02:29:34Z","abstract_excerpt":"This paper proposes a novel joint channel-estimation and source-detection algorithm using successive interference cancellation (SIC)-aided generative score-based diffusion models. Prior work in this area focuses on massive MIMO scenarios, which are typically characterized by full-rank channels, and fail in low-rank channel scenarios. The proposed algorithm outperforms existing methods in joint source-channel estimation, especially in low-rank scenarios where the number of users exceeds the number of antennas at the access point (AP). The proposed score-based iterative diffusion process estimat"},"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":"2501.11229","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.CV","submitted_at":"2025-01-20T02:29:34Z","cross_cats_sorted":["cs.IT","eess.SP","math.IT"],"title_canon_sha256":"7bfbfb508e2a08e13933ddda296368004e9830fc2485178a618d79ac8556f64b","abstract_canon_sha256":"a4332b8d7094a01cdaf72b3f93763004edbaa603bb4763132474303b52324a17"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:03:05.403142Z","signature_b64":"YKabYBe6d5QtY2KYExXZyp9m1CmndC1NezF5Z2v7blmm6c8Ey6tMNQFLCuK3OIQByyVu/u84/axfyR23s5gFDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0ef7f5054fe9f3ae3281fbba576075116f97c9eb2ca8a337cf37c0bcc88f0a4a","last_reissued_at":"2026-07-05T10:03:05.402681Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:03:05.402681Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Successive Interference Cancellation-aided Diffusion Models for Joint Channel Estimation and Data Detection in Low Rank Channel Scenarios","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.IT","eess.SP","math.IT"],"primary_cat":"cs.CV","authors_text":"John M. Cioffi, Kamyar Rajabalifardi, Muhammad Ahmed Mohsin, Sagnik Bhattacharya","submitted_at":"2025-01-20T02:29:34Z","abstract_excerpt":"This paper proposes a novel joint channel-estimation and source-detection algorithm using successive interference cancellation (SIC)-aided generative score-based diffusion models. Prior work in this area focuses on massive MIMO scenarios, which are typically characterized by full-rank channels, and fail in low-rank channel scenarios. The proposed algorithm outperforms existing methods in joint source-channel estimation, especially in low-rank scenarios where the number of users exceeds the number of antennas at the access point (AP). The proposed score-based iterative diffusion process estimat"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2501.11229","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2501.11229/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":"2501.11229","created_at":"2026-07-05T10:03:05.402734+00:00"},{"alias_kind":"arxiv_version","alias_value":"2501.11229v1","created_at":"2026-07-05T10:03:05.402734+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2501.11229","created_at":"2026-07-05T10:03:05.402734+00:00"},{"alias_kind":"pith_short_12","alias_value":"B337KBKP5HZ2","created_at":"2026-07-05T10:03:05.402734+00:00"},{"alias_kind":"pith_short_16","alias_value":"B337KBKP5HZ24MUB","created_at":"2026-07-05T10:03:05.402734+00:00"},{"alias_kind":"pith_short_8","alias_value":"B337KBKP","created_at":"2026-07-05T10:03:05.402734+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2508.01589","citing_title":"Censored Sampling for Topology Design: Guiding Diffusion with Human Preferences","ref_index":86,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF","json":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF.json","graph_json":"https://pith.science/api/pith-number/B337KBKP5HZ24MUB7O5FOYDVCF/graph.json","events_json":"https://pith.science/api/pith-number/B337KBKP5HZ24MUB7O5FOYDVCF/events.json","paper":"https://pith.science/paper/B337KBKP"},"agent_actions":{"view_html":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF","download_json":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF.json","view_paper":"https://pith.science/paper/B337KBKP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2501.11229&json=true","fetch_graph":"https://pith.science/api/pith-number/B337KBKP5HZ24MUB7O5FOYDVCF/graph.json","fetch_events":"https://pith.science/api/pith-number/B337KBKP5HZ24MUB7O5FOYDVCF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF/action/storage_attestation","attest_author":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF/action/author_attestation","sign_citation":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF/action/citation_signature","submit_replication":"https://pith.science/pith/B337KBKP5HZ24MUB7O5FOYDVCF/action/replication_record"}},"created_at":"2026-07-05T10:03:05.402734+00:00","updated_at":"2026-07-05T10:03:05.402734+00:00"}