{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2011:SU2C2VFRY3R6KHVDDDKVD3Z3QQ","short_pith_number":"pith:SU2C2VFR","canonical_record":{"source":{"id":"1111.3163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T10:05:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"73bf18b94974f0973671649767263629f9470ee7b613a0b7f810e4e377c10155","abstract_canon_sha256":"ccb2c6edef744b1a4f7034bc9f24dd2e9809cdbdac98bcc877666158229fc7ad"},"schema_version":"1.0"},"canonical_sha256":"95342d54b1c6e3e51ea318d551ef3b84207c9966c7f020dc3b6f80aad80b34f1","source":{"kind":"arxiv","id":"1111.3163","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3163","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3163v2","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3163","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"SU2C2VFRY3R6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SU2C2VFRY3R6KHVD","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SU2C2VFR","created_at":"2026-05-18T12:26:41Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2011:SU2C2VFRY3R6KHVDDDKVD3Z3QQ","target":"record","payload":{"canonical_record":{"source":{"id":"1111.3163","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T10:05:43Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"73bf18b94974f0973671649767263629f9470ee7b613a0b7f810e4e377c10155","abstract_canon_sha256":"ccb2c6edef744b1a4f7034bc9f24dd2e9809cdbdac98bcc877666158229fc7ad"},"schema_version":"1.0"},"canonical_sha256":"95342d54b1c6e3e51ea318d551ef3b84207c9966c7f020dc3b6f80aad80b34f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:18.616499Z","signature_b64":"+ylZqS9GQWG/M2kGVFNcGbBuU8OJObMy8V56fXMaHxeDlASi09eYWz8XyrDLxVb1nlcECOToaVdgTwMxiUQ5Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"95342d54b1c6e3e51ea318d551ef3b84207c9966c7f020dc3b6f80aad80b34f1","last_reissued_at":"2026-05-18T00:58:18.615632Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:18.615632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1111.3163","source_version":2,"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-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kcmMZeiKCpu4oWgK+72e9AeRHGWW/bhY//VmmD1/eYL4QxebRs+ftA5FLTDGJZa7gIPpzBp6lO5IHDm4SgPECg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:31:49.256003Z"},"content_sha256":"b27313f6d222b71313883efd9676a26cc4d6bc59e6e4f9b3ac3389563a5d9d2a","schema_version":"1.0","event_id":"sha256:b27313f6d222b71313883efd9676a26cc4d6bc59e6e4f9b3ac3389563a5d9d2a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2011:SU2C2VFRY3R6KHVDDDKVD3Z3QQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"On the Derivation of Optimal Partial Successive Interference Cancellation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Francesco Rossetto, Francisco Lazaro Blasco","submitted_at":"2011-11-14T10:05:43Z","abstract_excerpt":"The necessity of accurate channel estimation for Successive and Parallel Interference Cancellation is well known. Iterative channel estimation and channel decoding (for instance by means of the Expectation-Maximization algorithm) is particularly important for these multiuser detection schemes in the presence of time varying channels, where a high density of pilots is necessary to track the channel. This paper designs a method to analytically derive a weighting factor $\\alpha$, necessary to improve the efficiency of interference cancellation in the presence of poor channel estimates. Moreover, "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3163","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":""},"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-18T00:58:18Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"8rYg3DrwfNDxhelYkqL1jEvXaHS78yS9gCj+bLU/SQfVAwq7Mn7XbMXQvohQun0pd710H60QfyaGhipo8a64AA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T08:31:49.256527Z"},"content_sha256":"0c72398acf4382ac28e71ee47221afd06d82a0b4d998230da0734ed5c1270819","schema_version":"1.0","event_id":"sha256:0c72398acf4382ac28e71ee47221afd06d82a0b4d998230da0734ed5c1270819"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/SU2C2VFRY3R6KHVDDDKVD3Z3QQ/bundle.json","state_url":"https://pith.science/pith/SU2C2VFRY3R6KHVDDDKVD3Z3QQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/SU2C2VFRY3R6KHVDDDKVD3Z3QQ/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-01T08:31:49Z","links":{"resolver":"https://pith.science/pith/SU2C2VFRY3R6KHVDDDKVD3Z3QQ","bundle":"https://pith.science/pith/SU2C2VFRY3R6KHVDDDKVD3Z3QQ/bundle.json","state":"https://pith.science/pith/SU2C2VFRY3R6KHVDDDKVD3Z3QQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/SU2C2VFRY3R6KHVDDDKVD3Z3QQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2011:SU2C2VFRY3R6KHVDDDKVD3Z3QQ","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":"ccb2c6edef744b1a4f7034bc9f24dd2e9809cdbdac98bcc877666158229fc7ad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T10:05:43Z","title_canon_sha256":"73bf18b94974f0973671649767263629f9470ee7b613a0b7f810e4e377c10155"},"schema_version":"1.0","source":{"id":"1111.3163","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1111.3163","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"arxiv_version","alias_value":"1111.3163v2","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1111.3163","created_at":"2026-05-18T00:58:18Z"},{"alias_kind":"pith_short_12","alias_value":"SU2C2VFRY3R6","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_16","alias_value":"SU2C2VFRY3R6KHVD","created_at":"2026-05-18T12:26:41Z"},{"alias_kind":"pith_short_8","alias_value":"SU2C2VFR","created_at":"2026-05-18T12:26:41Z"}],"graph_snapshots":[{"event_id":"sha256:0c72398acf4382ac28e71ee47221afd06d82a0b4d998230da0734ed5c1270819","target":"graph","created_at":"2026-05-18T00:58:18Z","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 necessity of accurate channel estimation for Successive and Parallel Interference Cancellation is well known. Iterative channel estimation and channel decoding (for instance by means of the Expectation-Maximization algorithm) is particularly important for these multiuser detection schemes in the presence of time varying channels, where a high density of pilots is necessary to track the channel. This paper designs a method to analytically derive a weighting factor $\\alpha$, necessary to improve the efficiency of interference cancellation in the presence of poor channel estimates. Moreover, ","authors_text":"Francesco Rossetto, Francisco Lazaro Blasco","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T10:05:43Z","title":"On the Derivation of Optimal Partial Successive Interference Cancellation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1111.3163","kind":"arxiv","version":2},"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:b27313f6d222b71313883efd9676a26cc4d6bc59e6e4f9b3ac3389563a5d9d2a","target":"record","created_at":"2026-05-18T00:58:18Z","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":"ccb2c6edef744b1a4f7034bc9f24dd2e9809cdbdac98bcc877666158229fc7ad","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2011-11-14T10:05:43Z","title_canon_sha256":"73bf18b94974f0973671649767263629f9470ee7b613a0b7f810e4e377c10155"},"schema_version":"1.0","source":{"id":"1111.3163","kind":"arxiv","version":2}},"canonical_sha256":"95342d54b1c6e3e51ea318d551ef3b84207c9966c7f020dc3b6f80aad80b34f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"95342d54b1c6e3e51ea318d551ef3b84207c9966c7f020dc3b6f80aad80b34f1","first_computed_at":"2026-05-18T00:58:18.615632Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:18.615632Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"+ylZqS9GQWG/M2kGVFNcGbBuU8OJObMy8V56fXMaHxeDlASi09eYWz8XyrDLxVb1nlcECOToaVdgTwMxiUQ5Bw==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:18.616499Z","signed_message":"canonical_sha256_bytes"},"source_id":"1111.3163","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b27313f6d222b71313883efd9676a26cc4d6bc59e6e4f9b3ac3389563a5d9d2a","sha256:0c72398acf4382ac28e71ee47221afd06d82a0b4d998230da0734ed5c1270819"],"state_sha256":"33bc397f49414792d5fb7154ce94c95136b9e6fc8e92dc4dbaf0443be1ff5b0c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7hlGj8qNnmH9TwyhjX4C4WCpPl45+rYW8vAr1VXo6rUhZbnVF4FG2I7qScnYxyFf7w7L7VhCP24S5dx4RaidCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T08:31:49.258937Z","bundle_sha256":"037b12bd96a40eeea6b111f475a6ec22f485438159e452753a6002e3d2021da7"}}