{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:AHQQLESLWTUFIES2HZHDR2KUZT","short_pith_number":"pith:AHQQLESL","schema_version":"1.0","canonical_sha256":"01e105924bb4e854125a3e4e38e954ccecead1251fcb305bddd44163b5a30d2d","source":{"kind":"arxiv","id":"1710.00783","version":1},"attestation_state":"computed","paper":{"title":"Steepest Descent Multimodulus Algorithm for Blind Signal Retrieval in QAM Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Shafayat Abrar","submitted_at":"2017-08-05T07:57:24Z","abstract_excerpt":"We present steepest descent (SD) implementation of multimodulus algorithm (MMA2-2) for blind signal retrieval in digital communication systems. In comparison to stochastic approximate (gradient descent) realization, the proposed SD implementation of MMA2-2 equalizer mitigates inter-symbol interference with relatively smooth convergence and superior steady-state performance."},"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":"1710.00783","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"eess.SP","submitted_at":"2017-08-05T07:57:24Z","cross_cats_sorted":[],"title_canon_sha256":"262db54c2a598f787759349291e4d5cdfcb790008aac8e6e82e581c9311fcf6c","abstract_canon_sha256":"78453f47e8fabe0492da22da02eca9759ff408be1c8454ad27a8126f343b5cbd"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:33:53.794825Z","signature_b64":"HQu44f0YOqkIjRIlw1QhG+5sETKbdF72oyQQJFCjbwofFNM7iyBBXfZT92KyJWUXQsitCh69lqUiZzvg6aCoDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"01e105924bb4e854125a3e4e38e954ccecead1251fcb305bddd44163b5a30d2d","last_reissued_at":"2026-05-18T00:33:53.794139Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:33:53.794139Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Steepest Descent Multimodulus Algorithm for Blind Signal Retrieval in QAM Systems","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"eess.SP","authors_text":"Shafayat Abrar","submitted_at":"2017-08-05T07:57:24Z","abstract_excerpt":"We present steepest descent (SD) implementation of multimodulus algorithm (MMA2-2) for blind signal retrieval in digital communication systems. In comparison to stochastic approximate (gradient descent) realization, the proposed SD implementation of MMA2-2 equalizer mitigates inter-symbol interference with relatively smooth convergence and superior steady-state performance."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.00783","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":"1710.00783","created_at":"2026-05-18T00:33:53.794237+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.00783v1","created_at":"2026-05-18T00:33:53.794237+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.00783","created_at":"2026-05-18T00:33:53.794237+00:00"},{"alias_kind":"pith_short_12","alias_value":"AHQQLESLWTUF","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_16","alias_value":"AHQQLESLWTUFIES2","created_at":"2026-05-18T12:31:05.417338+00:00"},{"alias_kind":"pith_short_8","alias_value":"AHQQLESL","created_at":"2026-05-18T12:31:05.417338+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/AHQQLESLWTUFIES2HZHDR2KUZT","json":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT.json","graph_json":"https://pith.science/api/pith-number/AHQQLESLWTUFIES2HZHDR2KUZT/graph.json","events_json":"https://pith.science/api/pith-number/AHQQLESLWTUFIES2HZHDR2KUZT/events.json","paper":"https://pith.science/paper/AHQQLESL"},"agent_actions":{"view_html":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT","download_json":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT.json","view_paper":"https://pith.science/paper/AHQQLESL","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.00783&json=true","fetch_graph":"https://pith.science/api/pith-number/AHQQLESLWTUFIES2HZHDR2KUZT/graph.json","fetch_events":"https://pith.science/api/pith-number/AHQQLESLWTUFIES2HZHDR2KUZT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT/action/storage_attestation","attest_author":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT/action/author_attestation","sign_citation":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT/action/citation_signature","submit_replication":"https://pith.science/pith/AHQQLESLWTUFIES2HZHDR2KUZT/action/replication_record"}},"created_at":"2026-05-18T00:33:53.794237+00:00","updated_at":"2026-05-18T00:33:53.794237+00:00"}