{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:3EIFCX7CMCEAI4XWDXWKQG7HMQ","short_pith_number":"pith:3EIFCX7C","canonical_record":{"source":{"id":"1905.08098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-20T13:25:58Z","cross_cats_sorted":[],"title_canon_sha256":"74701040f961a597bb506a373cbe7babe1ed7fa3772c05b8a7b1464fe43c24f5","abstract_canon_sha256":"3307dc8a24c74f6f684ff9f6d804c2e6909242d1c959ebd40f29b7b3a0255a4a"},"schema_version":"1.0"},"canonical_sha256":"d910515fe260880472f61deca81be7641bdf879bde56c7e74dea340daa47d950","source":{"kind":"arxiv","id":"1905.08098","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08098","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08098v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08098","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"3EIFCX7CMCEA","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3EIFCX7CMCEAI4XW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3EIFCX7C","created_at":"2026-05-18T12:33:07Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:3EIFCX7CMCEAI4XWDXWKQG7HMQ","target":"record","payload":{"canonical_record":{"source":{"id":"1905.08098","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-20T13:25:58Z","cross_cats_sorted":[],"title_canon_sha256":"74701040f961a597bb506a373cbe7babe1ed7fa3772c05b8a7b1464fe43c24f5","abstract_canon_sha256":"3307dc8a24c74f6f684ff9f6d804c2e6909242d1c959ebd40f29b7b3a0255a4a"},"schema_version":"1.0"},"canonical_sha256":"d910515fe260880472f61deca81be7641bdf879bde56c7e74dea340daa47d950","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:45:47.621249Z","signature_b64":"asR9ohnBCE+V3/xl/jkOnKa/c+Xdpj1y3iN77A0X7So9vuOdMcPyIlGh08Kk+Xb61N+hSeuiCKQDWk8xmbz+CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d910515fe260880472f61deca81be7641bdf879bde56c7e74dea340daa47d950","last_reissued_at":"2026-05-17T23:45:47.620588Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:45:47.620588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1905.08098","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x9g7yoSAu6uVNO50ukzotk0djVX4WI2xZHFbccEfGBaSneIBdIGvEsN5ZXhs7lW3uqC76ZJ8ALxZp1t72mMiBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:19:06.417589Z"},"content_sha256":"2f8ee9679a55a71982262d2658d890427a3ba597595d59fe87bfdd035ec067fe","schema_version":"1.0","event_id":"sha256:2f8ee9679a55a71982262d2658d890427a3ba597595d59fe87bfdd035ec067fe"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:3EIFCX7CMCEAI4XWDXWKQG7HMQ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Radius of Permutation Groups with Infinity-Norm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiande Zhang, Xin Wei","submitted_at":"2019-05-20T13:25:58Z","abstract_excerpt":"The covering radius of permutation group codes are studied in this paper with $l_{\\infty}$-metric. We determine the covering radius of the $(p,q)$-type group, which is a direct product of two cyclic transitive groups. We also deduce the maximum covering radius among all the relabelings of this group under conjugation, that is, permutation groups with the same algebraic structure but with relabelled members. Finally, we give a lower bound of the covering radius of the dihedral group code, which differs from the trivial upper bound by a constant at most one. This improves the result of Karni and"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08098","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-17T23:45:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"0noV+Swtnx+jHfACZhgsiD8C8ILE27jcnFcRWiN21sunL1YaJKhFElB+ZCJY0yBtgS1VvsU9c6faJK5ImILLBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-03T02:19:06.417930Z"},"content_sha256":"acf6545b89c4f3777f719c5d88d13eb3cf1e58336f0b5aa16eb7c63e1e9622f7","schema_version":"1.0","event_id":"sha256:acf6545b89c4f3777f719c5d88d13eb3cf1e58336f0b5aa16eb7c63e1e9622f7"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/3EIFCX7CMCEAI4XWDXWKQG7HMQ/bundle.json","state_url":"https://pith.science/pith/3EIFCX7CMCEAI4XWDXWKQG7HMQ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/3EIFCX7CMCEAI4XWDXWKQG7HMQ/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-03T02:19:06Z","links":{"resolver":"https://pith.science/pith/3EIFCX7CMCEAI4XWDXWKQG7HMQ","bundle":"https://pith.science/pith/3EIFCX7CMCEAI4XWDXWKQG7HMQ/bundle.json","state":"https://pith.science/pith/3EIFCX7CMCEAI4XWDXWKQG7HMQ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/3EIFCX7CMCEAI4XWDXWKQG7HMQ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:3EIFCX7CMCEAI4XWDXWKQG7HMQ","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":"3307dc8a24c74f6f684ff9f6d804c2e6909242d1c959ebd40f29b7b3a0255a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-20T13:25:58Z","title_canon_sha256":"74701040f961a597bb506a373cbe7babe1ed7fa3772c05b8a7b1464fe43c24f5"},"schema_version":"1.0","source":{"id":"1905.08098","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1905.08098","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"arxiv_version","alias_value":"1905.08098v1","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1905.08098","created_at":"2026-05-17T23:45:47Z"},{"alias_kind":"pith_short_12","alias_value":"3EIFCX7CMCEA","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_16","alias_value":"3EIFCX7CMCEAI4XW","created_at":"2026-05-18T12:33:07Z"},{"alias_kind":"pith_short_8","alias_value":"3EIFCX7C","created_at":"2026-05-18T12:33:07Z"}],"graph_snapshots":[{"event_id":"sha256:acf6545b89c4f3777f719c5d88d13eb3cf1e58336f0b5aa16eb7c63e1e9622f7","target":"graph","created_at":"2026-05-17T23:45:47Z","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 covering radius of permutation group codes are studied in this paper with $l_{\\infty}$-metric. We determine the covering radius of the $(p,q)$-type group, which is a direct product of two cyclic transitive groups. We also deduce the maximum covering radius among all the relabelings of this group under conjugation, that is, permutation groups with the same algebraic structure but with relabelled members. Finally, we give a lower bound of the covering radius of the dihedral group code, which differs from the trivial upper bound by a constant at most one. This improves the result of Karni and","authors_text":"Xiande Zhang, Xin Wei","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-20T13:25:58Z","title":"Covering Radius of Permutation Groups with Infinity-Norm"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1905.08098","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:2f8ee9679a55a71982262d2658d890427a3ba597595d59fe87bfdd035ec067fe","target":"record","created_at":"2026-05-17T23:45:47Z","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":"3307dc8a24c74f6f684ff9f6d804c2e6909242d1c959ebd40f29b7b3a0255a4a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2019-05-20T13:25:58Z","title_canon_sha256":"74701040f961a597bb506a373cbe7babe1ed7fa3772c05b8a7b1464fe43c24f5"},"schema_version":"1.0","source":{"id":"1905.08098","kind":"arxiv","version":1}},"canonical_sha256":"d910515fe260880472f61deca81be7641bdf879bde56c7e74dea340daa47d950","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d910515fe260880472f61deca81be7641bdf879bde56c7e74dea340daa47d950","first_computed_at":"2026-05-17T23:45:47.620588Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:45:47.620588Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"asR9ohnBCE+V3/xl/jkOnKa/c+Xdpj1y3iN77A0X7So9vuOdMcPyIlGh08Kk+Xb61N+hSeuiCKQDWk8xmbz+CA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:45:47.621249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1905.08098","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f8ee9679a55a71982262d2658d890427a3ba597595d59fe87bfdd035ec067fe","sha256:acf6545b89c4f3777f719c5d88d13eb3cf1e58336f0b5aa16eb7c63e1e9622f7"],"state_sha256":"16d2730b8a727316ce4b726d4b13dba6b25c357dedaa9b995c998704f07edf0e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zeL4RmCMZnTd+P+DCWMVY99hvlJ6N9NzAO900iNRAlFF+Yyvg59vh/jnTJWfMTss273k4/IqchsRv0p7bzF2CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-03T02:19:06.419943Z","bundle_sha256":"ac2c49d230d35c91fe7bf5063fda6cd86937d2f55490d7dbc7c49e147d96f871"}}