{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2007:TKPZELTBQIXDWLVMHLAIHOYKJ5","short_pith_number":"pith:TKPZELTB","canonical_record":{"source":{"id":"0704.2505","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-19T11:05:31Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"24fbcae45103c367718c9c9fc6f318c94d18e4936a177d1f33a1755d5034c08e","abstract_canon_sha256":"b9860d618368c45b52a467072c1e6d49468a0a01bdab4b126c893e5e86a7d52f"},"schema_version":"1.0"},"canonical_sha256":"9a9f922e61822e3b2eac3ac083bb0a4f73bea1d73b1149f59c961f7c7f26e27d","source":{"kind":"arxiv","id":"0704.2505","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.2505","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"0704.2505v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.2505","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"TKPZELTBQIXD","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"TKPZELTBQIXDWLVM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"TKPZELTB","created_at":"2026-05-18T12:25:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2007:TKPZELTBQIXDWLVMHLAIHOYKJ5","target":"record","payload":{"canonical_record":{"source":{"id":"0704.2505","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-19T11:05:31Z","cross_cats_sorted":["cs.DM","math.IT"],"title_canon_sha256":"24fbcae45103c367718c9c9fc6f318c94d18e4936a177d1f33a1755d5034c08e","abstract_canon_sha256":"b9860d618368c45b52a467072c1e6d49468a0a01bdab4b126c893e5e86a7d52f"},"schema_version":"1.0"},"canonical_sha256":"9a9f922e61822e3b2eac3ac083bb0a4f73bea1d73b1149f59c961f7c7f26e27d","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:58:26.248591Z","signature_b64":"CuFkJpDUmVQtfSz8F444wYV/TaQoSbnm0owJBob6VlsJvdkWEPNvJXibEvAbePxCBQprrgQwwcdnJZhlIGglBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9a9f922e61822e3b2eac3ac083bb0a4f73bea1d73b1149f59c961f7c7f26e27d","last_reissued_at":"2026-05-18T00:58:26.248085Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:58:26.248085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0704.2505","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gDW9AFGe8ByrteW/EkHctr1sdT9SIoetjiPWWQqN2EorZXYN+TyEMjdNKL4TRSObeRauS11YTtVzNBcZQSqmAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:54:08.364877Z"},"content_sha256":"275b04ed7fd2229c5e848f1ef2d65e500853d0921551937d2e1391a3d72298cd","schema_version":"1.0","event_id":"sha256:275b04ed7fd2229c5e848f1ef2d65e500853d0921551937d2e1391a3d72298cd"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2007:TKPZELTBQIXDWLVMHLAIHOYKJ5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity","license":"","headline":"","cross_cats":["cs.DM","math.IT"],"primary_cat":"cs.IT","authors_text":"B. Sundar Rajan, G. Susinder Rajan","submitted_at":"2007-04-19T11:05:31Z","abstract_excerpt":"\"Extended Clifford algebras\" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decodin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.2505","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:26Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"eamsxu+62DzXp8tuFW6ZsZ0NQ+gOO0inqbEVMMo7CCWwJUpultUR9cmWnuXyqVnIsTTqq5+3sqmQE+O7NRfQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T01:54:08.365522Z"},"content_sha256":"28a5a91e67b90eed991f05ac1ee02367d0c09fe5d96d3f4bac0d0d6ae096b3ee","schema_version":"1.0","event_id":"sha256:28a5a91e67b90eed991f05ac1ee02367d0c09fe5d96d3f4bac0d0d6ae096b3ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/bundle.json","state_url":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/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-05T01:54:08Z","links":{"resolver":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5","bundle":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/bundle.json","state":"https://pith.science/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TKPZELTBQIXDWLVMHLAIHOYKJ5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2007:TKPZELTBQIXDWLVMHLAIHOYKJ5","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":"b9860d618368c45b52a467072c1e6d49468a0a01bdab4b126c893e5e86a7d52f","cross_cats_sorted":["cs.DM","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-19T11:05:31Z","title_canon_sha256":"24fbcae45103c367718c9c9fc6f318c94d18e4936a177d1f33a1755d5034c08e"},"schema_version":"1.0","source":{"id":"0704.2505","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0704.2505","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"arxiv_version","alias_value":"0704.2505v1","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0704.2505","created_at":"2026-05-18T00:58:26Z"},{"alias_kind":"pith_short_12","alias_value":"TKPZELTBQIXD","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_16","alias_value":"TKPZELTBQIXDWLVM","created_at":"2026-05-18T12:25:56Z"},{"alias_kind":"pith_short_8","alias_value":"TKPZELTB","created_at":"2026-05-18T12:25:56Z"}],"graph_snapshots":[{"event_id":"sha256:28a5a91e67b90eed991f05ac1ee02367d0c09fe5d96d3f4bac0d0d6ae096b3ee","target":"graph","created_at":"2026-05-18T00:58:26Z","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":"\"Extended Clifford algebras\" are introduced as a means to obtain low ML decoding complexity space-time block codes. Using left regular matrix representations of two specific classes of extended Clifford algebras, two systematic algebraic constructions of full diversity Distributed Space-Time Codes (DSTCs) are provided for any power of two number of relays. The left regular matrix representation has been shown to naturally result in space-time codes meeting the additional constraints required for DSTCs. The DSTCs so constructed have the salient feature of reduced Maximum Likelihood (ML) decodin","authors_text":"B. Sundar Rajan, G. Susinder Rajan","cross_cats":["cs.DM","math.IT"],"headline":"","license":"","primary_cat":"cs.IT","submitted_at":"2007-04-19T11:05:31Z","title":"Algebraic Distributed Space-Time Codes with Low ML Decoding Complexity"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0704.2505","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:275b04ed7fd2229c5e848f1ef2d65e500853d0921551937d2e1391a3d72298cd","target":"record","created_at":"2026-05-18T00:58:26Z","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":"b9860d618368c45b52a467072c1e6d49468a0a01bdab4b126c893e5e86a7d52f","cross_cats_sorted":["cs.DM","math.IT"],"license":"","primary_cat":"cs.IT","submitted_at":"2007-04-19T11:05:31Z","title_canon_sha256":"24fbcae45103c367718c9c9fc6f318c94d18e4936a177d1f33a1755d5034c08e"},"schema_version":"1.0","source":{"id":"0704.2505","kind":"arxiv","version":1}},"canonical_sha256":"9a9f922e61822e3b2eac3ac083bb0a4f73bea1d73b1149f59c961f7c7f26e27d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9a9f922e61822e3b2eac3ac083bb0a4f73bea1d73b1149f59c961f7c7f26e27d","first_computed_at":"2026-05-18T00:58:26.248085Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:58:26.248085Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"CuFkJpDUmVQtfSz8F444wYV/TaQoSbnm0owJBob6VlsJvdkWEPNvJXibEvAbePxCBQprrgQwwcdnJZhlIGglBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:58:26.248591Z","signed_message":"canonical_sha256_bytes"},"source_id":"0704.2505","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:275b04ed7fd2229c5e848f1ef2d65e500853d0921551937d2e1391a3d72298cd","sha256:28a5a91e67b90eed991f05ac1ee02367d0c09fe5d96d3f4bac0d0d6ae096b3ee"],"state_sha256":"f9df610eae0d44048fa4cdfe4f5093158d3df1f30753bda53dccd22b0823282a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Imd+xnDgTcGyv/vjtMgLwk3Rxjo0+aoJErCXUO/liWhsNVkq+pmRqCtldvyiqJ/4DlMGQ0Wb8fog8FUDh9MECg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T01:54:08.368945Z","bundle_sha256":"8a1773530ed644f7fd4853206e6bf7f512f7603c9591a37596b9ed023f47b5f0"}}