{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:JEH6WJ33UGZZ4FNTDCAEFE5AUW","short_pith_number":"pith:JEH6WJ33","canonical_record":{"source":{"id":"1311.7038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-27T16:55:47Z","cross_cats_sorted":["cs.IT","math.IT","math.RT"],"title_canon_sha256":"cd977f3b668545bc6c3ffda345ccb68bca96ab4176688175c88123cd9eb7f083","abstract_canon_sha256":"222b94681128256f13dabf5e2d1591886a2e34cf4c3f89527f31e8ddc48229cd"},"schema_version":"1.0"},"canonical_sha256":"490feb277ba1b39e15b318804293a0a586cc5ab12d29f8b875b070525b882f23","source":{"kind":"arxiv","id":"1311.7038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7038","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7038v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7038","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"JEH6WJ33UGZZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JEH6WJ33UGZZ4FNT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JEH6WJ33","created_at":"2026-05-18T12:27:49Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:JEH6WJ33UGZZ4FNTDCAEFE5AUW","target":"record","payload":{"canonical_record":{"source":{"id":"1311.7038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-27T16:55:47Z","cross_cats_sorted":["cs.IT","math.IT","math.RT"],"title_canon_sha256":"cd977f3b668545bc6c3ffda345ccb68bca96ab4176688175c88123cd9eb7f083","abstract_canon_sha256":"222b94681128256f13dabf5e2d1591886a2e34cf4c3f89527f31e8ddc48229cd"},"schema_version":"1.0"},"canonical_sha256":"490feb277ba1b39e15b318804293a0a586cc5ab12d29f8b875b070525b882f23","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:06:04.293475Z","signature_b64":"GFuvt0G2BTO84K50tFEHwx9rjDnVjoqec289JixRJkSZJoSlWwybdbLaQdUuXFLJV2/WkbFsA2U07sBFuKvwDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"490feb277ba1b39e15b318804293a0a586cc5ab12d29f8b875b070525b882f23","last_reissued_at":"2026-05-18T03:06:04.292907Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:06:04.292907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.7038","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:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xxMMe34KMbZhEV6cR1YL1SyEPTud60D3jUV7Xw3nlSttPFA/Yp9uawmF1SkwnzH25eRUH/AJ7tw2Hjug/qWyAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:49:45.562122Z"},"content_sha256":"f86927c64ac2e33c9e5a507245f6642c5544470ff38264e08a58b423cb74bb71","schema_version":"1.0","event_id":"sha256:f86927c64ac2e33c9e5a507245f6642c5544470ff38264e08a58b423cb74bb71"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:JEH6WJ33UGZZ4FNTDCAEFE5AUW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Group Coding with Complex Isometries","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.RT"],"primary_cat":"math.CO","authors_text":"Anne V. Shepler, Hye Jung Kim, J.B. Nation","submitted_at":"2013-11-27T16:55:47Z","abstract_excerpt":"We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using geometric notions of minimal length coset representatives. The infinite family of complex reflection groups G(r,1,n) produces effective codes of arbitrarily large size that can be decoded in relatively few steps."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7038","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:06:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"84kCLSU03O0lctjepR0+jlwDdRAeOpuEKzCLrfQoc5h9hfoJE/S/EhrXpgjvO0MaYdB5KhLYTvM8GvzOOqYRBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T09:49:45.562473Z"},"content_sha256":"d45ebbf4c72e8f8055260d6a9d40c1dd6ff1a02734a9818047db22f2e6a3b62c","schema_version":"1.0","event_id":"sha256:d45ebbf4c72e8f8055260d6a9d40c1dd6ff1a02734a9818047db22f2e6a3b62c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/JEH6WJ33UGZZ4FNTDCAEFE5AUW/bundle.json","state_url":"https://pith.science/pith/JEH6WJ33UGZZ4FNTDCAEFE5AUW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/JEH6WJ33UGZZ4FNTDCAEFE5AUW/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-05T09:49:45Z","links":{"resolver":"https://pith.science/pith/JEH6WJ33UGZZ4FNTDCAEFE5AUW","bundle":"https://pith.science/pith/JEH6WJ33UGZZ4FNTDCAEFE5AUW/bundle.json","state":"https://pith.science/pith/JEH6WJ33UGZZ4FNTDCAEFE5AUW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/JEH6WJ33UGZZ4FNTDCAEFE5AUW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:JEH6WJ33UGZZ4FNTDCAEFE5AUW","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":"222b94681128256f13dabf5e2d1591886a2e34cf4c3f89527f31e8ddc48229cd","cross_cats_sorted":["cs.IT","math.IT","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-27T16:55:47Z","title_canon_sha256":"cd977f3b668545bc6c3ffda345ccb68bca96ab4176688175c88123cd9eb7f083"},"schema_version":"1.0","source":{"id":"1311.7038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.7038","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"arxiv_version","alias_value":"1311.7038v1","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.7038","created_at":"2026-05-18T03:06:04Z"},{"alias_kind":"pith_short_12","alias_value":"JEH6WJ33UGZZ","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_16","alias_value":"JEH6WJ33UGZZ4FNT","created_at":"2026-05-18T12:27:49Z"},{"alias_kind":"pith_short_8","alias_value":"JEH6WJ33","created_at":"2026-05-18T12:27:49Z"}],"graph_snapshots":[{"event_id":"sha256:d45ebbf4c72e8f8055260d6a9d40c1dd6ff1a02734a9818047db22f2e6a3b62c","target":"graph","created_at":"2026-05-18T03:06: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":"We investigate group coding for arbitrary finite groups acting linearly on a vector space. These yield robust codes based on real or complex matrix groups. We give necessary and sufficient conditions for correct subgroup decoding using geometric notions of minimal length coset representatives. The infinite family of complex reflection groups G(r,1,n) produces effective codes of arbitrarily large size that can be decoded in relatively few steps.","authors_text":"Anne V. Shepler, Hye Jung Kim, J.B. Nation","cross_cats":["cs.IT","math.IT","math.RT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-27T16:55:47Z","title":"Group Coding with Complex Isometries"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.7038","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:f86927c64ac2e33c9e5a507245f6642c5544470ff38264e08a58b423cb74bb71","target":"record","created_at":"2026-05-18T03:06: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":"222b94681128256f13dabf5e2d1591886a2e34cf4c3f89527f31e8ddc48229cd","cross_cats_sorted":["cs.IT","math.IT","math.RT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2013-11-27T16:55:47Z","title_canon_sha256":"cd977f3b668545bc6c3ffda345ccb68bca96ab4176688175c88123cd9eb7f083"},"schema_version":"1.0","source":{"id":"1311.7038","kind":"arxiv","version":1}},"canonical_sha256":"490feb277ba1b39e15b318804293a0a586cc5ab12d29f8b875b070525b882f23","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"490feb277ba1b39e15b318804293a0a586cc5ab12d29f8b875b070525b882f23","first_computed_at":"2026-05-18T03:06:04.292907Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:06:04.292907Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"GFuvt0G2BTO84K50tFEHwx9rjDnVjoqec289JixRJkSZJoSlWwybdbLaQdUuXFLJV2/WkbFsA2U07sBFuKvwDA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:06:04.293475Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.7038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f86927c64ac2e33c9e5a507245f6642c5544470ff38264e08a58b423cb74bb71","sha256:d45ebbf4c72e8f8055260d6a9d40c1dd6ff1a02734a9818047db22f2e6a3b62c"],"state_sha256":"8ff53e2912c272c5396edeed6d9016ce850cc181abd9168f71cc344482886bbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VIVLB7wOlB8bfnLlFAmFSuqryARpXx3wbEL/+V/xmzTx8yJhq2HliiV57qCuAA5YFT210NpFPg8QFztUsKwHCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T09:49:45.564622Z","bundle_sha256":"933684bce5fdeeebe8fe4315cb86d9341ccfe289e619d073e92e412775634ccd"}}