{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:CNRXRZKXTJEDXL2YMCOPVVSMM3","short_pith_number":"pith:CNRXRZKX","canonical_record":{"source":{"id":"0906.3816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T16:29:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ff2715eaba38716204f56f5567cca7c392b3f562e54fe30b1205e845e5b5bd6","abstract_canon_sha256":"0cf517cfab8be0628a2407be1b87d675768cd3cb8e13fe3cbc3762ade10c6a77"},"schema_version":"1.0"},"canonical_sha256":"136378e5579a483baf58609cfad64c66ecd6befcb0dcf335369b22fb7f840c54","source":{"kind":"arxiv","id":"0906.3816","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3816","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3816v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3816","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"CNRXRZKXTJED","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CNRXRZKXTJEDXL2Y","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CNRXRZKX","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:CNRXRZKXTJEDXL2YMCOPVVSMM3","target":"record","payload":{"canonical_record":{"source":{"id":"0906.3816","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T16:29:53Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"0ff2715eaba38716204f56f5567cca7c392b3f562e54fe30b1205e845e5b5bd6","abstract_canon_sha256":"0cf517cfab8be0628a2407be1b87d675768cd3cb8e13fe3cbc3762ade10c6a77"},"schema_version":"1.0"},"canonical_sha256":"136378e5579a483baf58609cfad64c66ecd6befcb0dcf335369b22fb7f840c54","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:20.099793Z","signature_b64":"ODPkKon3zLYbALpsWQLRtLme40Owfk4QSZ8AaYiACS1tsR4uYBoVotE6WflCYR75WHotqnEYHtUQdrIFp0mwAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"136378e5579a483baf58609cfad64c66ecd6befcb0dcf335369b22fb7f840c54","last_reissued_at":"2026-05-18T00:58:20.099190Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:20.099190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0906.3816","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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5PELtnxG7ychUa0y7rEGRE9uSi+2+yKb8P/YDH3uno80naEwLMRqfGvSk9qBRxN9ToJcNHWRJhWDb9M1RxxCAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:06:24.399761Z"},"content_sha256":"e08bc22737c490b3049977ae309ee924f39defcf266812117571d58f788b2982","schema_version":"1.0","event_id":"sha256:e08bc22737c490b3049977ae309ee924f39defcf266812117571d58f788b2982"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:CNRXRZKXTJEDXL2YMCOPVVSMM3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A Monte-Carlo Implementation of the SAGE Algorithm for Joint Soft Multiuser and Channel Parameter Estimation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"A. Kocian, E. Panayirci, H. V. Poor, M. Ruggieri","submitted_at":"2009-06-20T16:29:53Z","abstract_excerpt":"An efficient, joint transmission delay and channel parameter estimation algorithm is proposed for uplink asynchronous direct-sequence code-division multiple access (DS-CDMA) systems based on the space-alternating generalized expectation maximization (SAGE) framework. The marginal likelihood of the unknown parameters, averaged over the data sequence, as well as the expectation and maximization steps of the SAGE algorithm are derived analytically. To implement the proposed algorithm, a Markov Chain Monte Carlo (MCMC) technique, called Gibbs sampling, is employed to compute the {\\em a posteriori}"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3816","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-18T00:58:20Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jw59O4I2jueCnlot7dEyufmIAqu41eVQGtKymLL/EX3hmv5eNEmK1gfz6e1bXOMSzF06qi0LKoqwmorwyRZZAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T20:06:24.400125Z"},"content_sha256":"6055d0ce4b4b286491b43f8adbbef87f5f756d1bc1ffe7fdab81fa08e49f6d0b","schema_version":"1.0","event_id":"sha256:6055d0ce4b4b286491b43f8adbbef87f5f756d1bc1ffe7fdab81fa08e49f6d0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/CNRXRZKXTJEDXL2YMCOPVVSMM3/bundle.json","state_url":"https://pith.science/pith/CNRXRZKXTJEDXL2YMCOPVVSMM3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/CNRXRZKXTJEDXL2YMCOPVVSMM3/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-01T20:06:24Z","links":{"resolver":"https://pith.science/pith/CNRXRZKXTJEDXL2YMCOPVVSMM3","bundle":"https://pith.science/pith/CNRXRZKXTJEDXL2YMCOPVVSMM3/bundle.json","state":"https://pith.science/pith/CNRXRZKXTJEDXL2YMCOPVVSMM3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/CNRXRZKXTJEDXL2YMCOPVVSMM3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:CNRXRZKXTJEDXL2YMCOPVVSMM3","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":"0cf517cfab8be0628a2407be1b87d675768cd3cb8e13fe3cbc3762ade10c6a77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T16:29:53Z","title_canon_sha256":"0ff2715eaba38716204f56f5567cca7c392b3f562e54fe30b1205e845e5b5bd6"},"schema_version":"1.0","source":{"id":"0906.3816","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0906.3816","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"arxiv_version","alias_value":"0906.3816v1","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0906.3816","created_at":"2026-05-18T00:58:20Z"},{"alias_kind":"pith_short_12","alias_value":"CNRXRZKXTJED","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"CNRXRZKXTJEDXL2Y","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"CNRXRZKX","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:6055d0ce4b4b286491b43f8adbbef87f5f756d1bc1ffe7fdab81fa08e49f6d0b","target":"graph","created_at":"2026-05-18T00:58:20Z","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":"An efficient, joint transmission delay and channel parameter estimation algorithm is proposed for uplink asynchronous direct-sequence code-division multiple access (DS-CDMA) systems based on the space-alternating generalized expectation maximization (SAGE) framework. The marginal likelihood of the unknown parameters, averaged over the data sequence, as well as the expectation and maximization steps of the SAGE algorithm are derived analytically. To implement the proposed algorithm, a Markov Chain Monte Carlo (MCMC) technique, called Gibbs sampling, is employed to compute the {\\em a posteriori}","authors_text":"A. Kocian, E. Panayirci, H. V. Poor, M. Ruggieri","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T16:29:53Z","title":"A Monte-Carlo Implementation of the SAGE Algorithm for Joint Soft Multiuser and Channel Parameter Estimation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0906.3816","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:e08bc22737c490b3049977ae309ee924f39defcf266812117571d58f788b2982","target":"record","created_at":"2026-05-18T00:58:20Z","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":"0cf517cfab8be0628a2407be1b87d675768cd3cb8e13fe3cbc3762ade10c6a77","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2009-06-20T16:29:53Z","title_canon_sha256":"0ff2715eaba38716204f56f5567cca7c392b3f562e54fe30b1205e845e5b5bd6"},"schema_version":"1.0","source":{"id":"0906.3816","kind":"arxiv","version":1}},"canonical_sha256":"136378e5579a483baf58609cfad64c66ecd6befcb0dcf335369b22fb7f840c54","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"136378e5579a483baf58609cfad64c66ecd6befcb0dcf335369b22fb7f840c54","first_computed_at":"2026-05-18T00:58:20.099190Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:20.099190Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ODPkKon3zLYbALpsWQLRtLme40Owfk4QSZ8AaYiACS1tsR4uYBoVotE6WflCYR75WHotqnEYHtUQdrIFp0mwAA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:20.099793Z","signed_message":"canonical_sha256_bytes"},"source_id":"0906.3816","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e08bc22737c490b3049977ae309ee924f39defcf266812117571d58f788b2982","sha256:6055d0ce4b4b286491b43f8adbbef87f5f756d1bc1ffe7fdab81fa08e49f6d0b"],"state_sha256":"c64028bcf30da13dfa94d239a0ef069fe0575ed0ac9f4831bf75c90b766ef4d9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NUFBviNlmNDVyNOJ7rscGsgf7SMkNIsKGhq1DE0neKoHKY89tSkB3NR9PzLvHZ+FDfYckLHB1FejKqVtAqi3DQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T20:06:24.402056Z","bundle_sha256":"a92385eac324bea9f8af093c36e25580b2e39f7e9892bfb7786dfec51c8d24b1"}}