{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:2U2OOF42QD6J3NNOLBH5AVSB3Z","short_pith_number":"pith:2U2OOF42","canonical_record":{"source":{"id":"1308.5597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-26T14:26:23Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"6d93ed1ac5997cf08ef1a2bf15b1f00c186e68e04b0a8ddcd21bb2c48b49151e","abstract_canon_sha256":"0250e0031aaacb55ac249e4ff576ce0a4e52d3088dd3841419b8cd0d8cba7c3c"},"schema_version":"1.0"},"canonical_sha256":"d534e7179a80fc9db5ae584fd05641de650d6c98c074729912698f78213cfc8f","source":{"kind":"arxiv","id":"1308.5597","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5597","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5597v1","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5597","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"2U2OOF42QD6J","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2U2OOF42QD6J3NNO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2U2OOF42","created_at":"2026-05-18T12:27:32Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:2U2OOF42QD6J3NNOLBH5AVSB3Z","target":"record","payload":{"canonical_record":{"source":{"id":"1308.5597","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-26T14:26:23Z","cross_cats_sorted":["cs.SY","math.IT"],"title_canon_sha256":"6d93ed1ac5997cf08ef1a2bf15b1f00c186e68e04b0a8ddcd21bb2c48b49151e","abstract_canon_sha256":"0250e0031aaacb55ac249e4ff576ce0a4e52d3088dd3841419b8cd0d8cba7c3c"},"schema_version":"1.0"},"canonical_sha256":"d534e7179a80fc9db5ae584fd05641de650d6c98c074729912698f78213cfc8f","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:15:04.021837Z","signature_b64":"jpi1yska1L7HhjZ5S1cdzXFLZAwqV2ggL1esBkAPb03f80n3YCzboAOH+XFTqX4W0K52uYXN4CGHzxxZBclTAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d534e7179a80fc9db5ae584fd05641de650d6c98c074729912698f78213cfc8f","last_reissued_at":"2026-05-18T03:15:04.020995Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:15:04.020995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1308.5597","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-18T03:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"4QmyWOIHlrrtoedkqI+G0btZs+tKZytZa5IOhnG9Wrf9BbPt+JAoQrNUjlYPD8H4zvBYltf9a7k0KttCVBuDDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:51:16.709945Z"},"content_sha256":"6c888d1ce2eeaa735830260d75be89cc471e6cf4f8d6d3078efbf2961a74e2bf","schema_version":"1.0","event_id":"sha256:6c888d1ce2eeaa735830260d75be89cc471e6cf4f8d6d3078efbf2961a74e2bf"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:2U2OOF42QD6J3NNOLBH5AVSB3Z","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Sparse Channel Estimation by Factor Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.SY","math.IT"],"primary_cat":"cs.IT","authors_text":"Christian Jutten, Masoud Babaie-Zadeh, Rad Niazadeh","submitted_at":"2013-08-26T14:26:23Z","abstract_excerpt":"The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in various areas of communications. Recently, we have developed an algorithm based on iterative alternating minimization which iteratively detects the location and the value of the taps. This algorithms involves an approximate Maximum A Posteriori (MAP) probability scheme for detection of the location of taps, while a least square method is used for estimating the values at each iteration. In this work, based on the method of factor graphs and message passing algorithms, we will compute an exact soluti"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5597","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-18T03:15:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"C5lY5EaVZZ75Uj1dKCVNIHx+9Dxa6MS5/z6hg6Lkh4q5IoU2jpVvQO+HOQT8JCrDlb2KIQteOXUgtzKb+wliAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T00:51:16.710737Z"},"content_sha256":"d648aad895dfbb2f5101281dd6c76a0b64135f85c1da99cc53ad5942b1c8430f","schema_version":"1.0","event_id":"sha256:d648aad895dfbb2f5101281dd6c76a0b64135f85c1da99cc53ad5942b1c8430f"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2U2OOF42QD6J3NNOLBH5AVSB3Z/bundle.json","state_url":"https://pith.science/pith/2U2OOF42QD6J3NNOLBH5AVSB3Z/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2U2OOF42QD6J3NNOLBH5AVSB3Z/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-11T00:51:16Z","links":{"resolver":"https://pith.science/pith/2U2OOF42QD6J3NNOLBH5AVSB3Z","bundle":"https://pith.science/pith/2U2OOF42QD6J3NNOLBH5AVSB3Z/bundle.json","state":"https://pith.science/pith/2U2OOF42QD6J3NNOLBH5AVSB3Z/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2U2OOF42QD6J3NNOLBH5AVSB3Z/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:2U2OOF42QD6J3NNOLBH5AVSB3Z","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":"0250e0031aaacb55ac249e4ff576ce0a4e52d3088dd3841419b8cd0d8cba7c3c","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-26T14:26:23Z","title_canon_sha256":"6d93ed1ac5997cf08ef1a2bf15b1f00c186e68e04b0a8ddcd21bb2c48b49151e"},"schema_version":"1.0","source":{"id":"1308.5597","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1308.5597","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"arxiv_version","alias_value":"1308.5597v1","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1308.5597","created_at":"2026-05-18T03:15:04Z"},{"alias_kind":"pith_short_12","alias_value":"2U2OOF42QD6J","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_16","alias_value":"2U2OOF42QD6J3NNO","created_at":"2026-05-18T12:27:32Z"},{"alias_kind":"pith_short_8","alias_value":"2U2OOF42","created_at":"2026-05-18T12:27:32Z"}],"graph_snapshots":[{"event_id":"sha256:d648aad895dfbb2f5101281dd6c76a0b64135f85c1da99cc53ad5942b1c8430f","target":"graph","created_at":"2026-05-18T03:15:04Z","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":"The problem of estimating a sparse channel, i.e. a channel with a few non-zero taps, appears in various areas of communications. Recently, we have developed an algorithm based on iterative alternating minimization which iteratively detects the location and the value of the taps. This algorithms involves an approximate Maximum A Posteriori (MAP) probability scheme for detection of the location of taps, while a least square method is used for estimating the values at each iteration. In this work, based on the method of factor graphs and message passing algorithms, we will compute an exact soluti","authors_text":"Christian Jutten, Masoud Babaie-Zadeh, Rad Niazadeh","cross_cats":["cs.SY","math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-26T14:26:23Z","title":"Sparse Channel Estimation by Factor Graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1308.5597","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:6c888d1ce2eeaa735830260d75be89cc471e6cf4f8d6d3078efbf2961a74e2bf","target":"record","created_at":"2026-05-18T03:15:04Z","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":"0250e0031aaacb55ac249e4ff576ce0a4e52d3088dd3841419b8cd0d8cba7c3c","cross_cats_sorted":["cs.SY","math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2013-08-26T14:26:23Z","title_canon_sha256":"6d93ed1ac5997cf08ef1a2bf15b1f00c186e68e04b0a8ddcd21bb2c48b49151e"},"schema_version":"1.0","source":{"id":"1308.5597","kind":"arxiv","version":1}},"canonical_sha256":"d534e7179a80fc9db5ae584fd05641de650d6c98c074729912698f78213cfc8f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d534e7179a80fc9db5ae584fd05641de650d6c98c074729912698f78213cfc8f","first_computed_at":"2026-05-18T03:15:04.020995Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:15:04.020995Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"jpi1yska1L7HhjZ5S1cdzXFLZAwqV2ggL1esBkAPb03f80n3YCzboAOH+XFTqX4W0K52uYXN4CGHzxxZBclTAw==","signature_status":"signed_v1","signed_at":"2026-05-18T03:15:04.021837Z","signed_message":"canonical_sha256_bytes"},"source_id":"1308.5597","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:6c888d1ce2eeaa735830260d75be89cc471e6cf4f8d6d3078efbf2961a74e2bf","sha256:d648aad895dfbb2f5101281dd6c76a0b64135f85c1da99cc53ad5942b1c8430f"],"state_sha256":"a8aeb879600b478e75e0842c78c7af9ef3681fbd0a28403f5a0740b90860c2fd"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NC8iT+tLEYDir00jViRntKsOv/nEOWjwc2oIjp2GGuJ0JmzpgAtTydlV2qNd0P8hI4g2F2OPS9nE1m54OxBeDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T00:51:16.715225Z","bundle_sha256":"d68b56a3979c049c4691659e5531e7326bf6bfa3bfdfdfcaf5e5369764981877"}}