{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:MDQYJZ6HHEDWVRSLBKZZNI5BBE","short_pith_number":"pith:MDQYJZ6H","canonical_record":{"source":{"id":"1804.08252","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-23T06:25:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"474bad36023e4e424029d13769bb3d6f7981446b5207400af2075fc2e620177f","abstract_canon_sha256":"25eeed9aff04bf066c2634c79dc6b2f7e31f7a4fb24cafdbe46468b77ce84516"},"schema_version":"1.0"},"canonical_sha256":"60e184e7c739076ac64b0ab396a3a1091e13a70a87a6de408a537654b44ce4a9","source":{"kind":"arxiv","id":"1804.08252","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08252","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08252v2","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08252","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"MDQYJZ6HHEDW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MDQYJZ6HHEDWVRSL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MDQYJZ6H","created_at":"2026-05-18T12:32:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:MDQYJZ6HHEDWVRSLBKZZNI5BBE","target":"record","payload":{"canonical_record":{"source":{"id":"1804.08252","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-23T06:25:30Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"474bad36023e4e424029d13769bb3d6f7981446b5207400af2075fc2e620177f","abstract_canon_sha256":"25eeed9aff04bf066c2634c79dc6b2f7e31f7a4fb24cafdbe46468b77ce84516"},"schema_version":"1.0"},"canonical_sha256":"60e184e7c739076ac64b0ab396a3a1091e13a70a87a6de408a537654b44ce4a9","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:39:58.653667Z","signature_b64":"1YRCyMYuZaEnHyibGXsgOm2D5/tNK5J7Dp81wcP6urp0x4ZwFe6/2C1VQDGwhUfBpVu3ghvuuQMSgXmVa0a9DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"60e184e7c739076ac64b0ab396a3a1091e13a70a87a6de408a537654b44ce4a9","last_reissued_at":"2026-05-17T23:39:58.653074Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:39:58.653074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.08252","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-17T23:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"1u/Bf7jFsaTOtjJcGpqj3K49m92smFP9SE9OGtcoe8lHannjt5QIzXNvYL0DHlWyVKaFSKeeb0CWN6nQQ+XvBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:59:23.332031Z"},"content_sha256":"e3ed428ee819fa974d16a9d890a37990ab3bd153d3e3a244d304e1711cdbbfb5","schema_version":"1.0","event_id":"sha256:e3ed428ee819fa974d16a9d890a37990ab3bd153d3e3a244d304e1711cdbbfb5"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:MDQYJZ6HHEDWVRSLBKZZNI5BBE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Constructing Permutation Arrays using Partition and Extension","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hal Sudborough, Linda Morales, Luis Gerardo Mojica, Sergey Bereg","submitted_at":"2018-04-23T06:25:30Z","abstract_excerpt":"We give new lower bounds for $M(n,d)$, for various positive integers $n$ and $d$ with $n>d$, where $M(n,d)$ is the largest number of permutations on $n$ symbols with pairwise Hamming distance at least $d$. Large sets of permutations on $n$ symbols with pairwise Hamming distance $d$ is a necessary component of constructing error correcting permutation codes, which have been proposed for power-line communications. Our technique, {\\em partition and extension}, is universally applicable to constructing such sets for all $n$ and all $d$, $d<n$. We describe three new techniques, {\\em sequential part"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08252","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-17T23:39:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"LF7TpHWo3Vw4/wX0sSDxlxZG0I/L+qAKWkeAv0Jmub4our/mSUDfMons2Ncb3ARFXdO3x08BxiS4+uEMmUgAAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T10:59:23.332389Z"},"content_sha256":"3fc25c334a7ae097186de58b7370b9e489efb750d55c9f06442619782ef06e31","schema_version":"1.0","event_id":"sha256:3fc25c334a7ae097186de58b7370b9e489efb750d55c9f06442619782ef06e31"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/MDQYJZ6HHEDWVRSLBKZZNI5BBE/bundle.json","state_url":"https://pith.science/pith/MDQYJZ6HHEDWVRSLBKZZNI5BBE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/MDQYJZ6HHEDWVRSLBKZZNI5BBE/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-09T10:59:23Z","links":{"resolver":"https://pith.science/pith/MDQYJZ6HHEDWVRSLBKZZNI5BBE","bundle":"https://pith.science/pith/MDQYJZ6HHEDWVRSLBKZZNI5BBE/bundle.json","state":"https://pith.science/pith/MDQYJZ6HHEDWVRSLBKZZNI5BBE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/MDQYJZ6HHEDWVRSLBKZZNI5BBE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:MDQYJZ6HHEDWVRSLBKZZNI5BBE","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":"25eeed9aff04bf066c2634c79dc6b2f7e31f7a4fb24cafdbe46468b77ce84516","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-23T06:25:30Z","title_canon_sha256":"474bad36023e4e424029d13769bb3d6f7981446b5207400af2075fc2e620177f"},"schema_version":"1.0","source":{"id":"1804.08252","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.08252","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"arxiv_version","alias_value":"1804.08252v2","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.08252","created_at":"2026-05-17T23:39:58Z"},{"alias_kind":"pith_short_12","alias_value":"MDQYJZ6HHEDW","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_16","alias_value":"MDQYJZ6HHEDWVRSL","created_at":"2026-05-18T12:32:37Z"},{"alias_kind":"pith_short_8","alias_value":"MDQYJZ6H","created_at":"2026-05-18T12:32:37Z"}],"graph_snapshots":[{"event_id":"sha256:3fc25c334a7ae097186de58b7370b9e489efb750d55c9f06442619782ef06e31","target":"graph","created_at":"2026-05-17T23:39:58Z","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 give new lower bounds for $M(n,d)$, for various positive integers $n$ and $d$ with $n>d$, where $M(n,d)$ is the largest number of permutations on $n$ symbols with pairwise Hamming distance at least $d$. Large sets of permutations on $n$ symbols with pairwise Hamming distance $d$ is a necessary component of constructing error correcting permutation codes, which have been proposed for power-line communications. Our technique, {\\em partition and extension}, is universally applicable to constructing such sets for all $n$ and all $d$, $d<n$. We describe three new techniques, {\\em sequential part","authors_text":"Hal Sudborough, Linda Morales, Luis Gerardo Mojica, Sergey Bereg","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-23T06:25:30Z","title":"Constructing Permutation Arrays using Partition and Extension"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.08252","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:e3ed428ee819fa974d16a9d890a37990ab3bd153d3e3a244d304e1711cdbbfb5","target":"record","created_at":"2026-05-17T23:39:58Z","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":"25eeed9aff04bf066c2634c79dc6b2f7e31f7a4fb24cafdbe46468b77ce84516","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2018-04-23T06:25:30Z","title_canon_sha256":"474bad36023e4e424029d13769bb3d6f7981446b5207400af2075fc2e620177f"},"schema_version":"1.0","source":{"id":"1804.08252","kind":"arxiv","version":2}},"canonical_sha256":"60e184e7c739076ac64b0ab396a3a1091e13a70a87a6de408a537654b44ce4a9","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"60e184e7c739076ac64b0ab396a3a1091e13a70a87a6de408a537654b44ce4a9","first_computed_at":"2026-05-17T23:39:58.653074Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:39:58.653074Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1YRCyMYuZaEnHyibGXsgOm2D5/tNK5J7Dp81wcP6urp0x4ZwFe6/2C1VQDGwhUfBpVu3ghvuuQMSgXmVa0a9DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:39:58.653667Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.08252","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e3ed428ee819fa974d16a9d890a37990ab3bd153d3e3a244d304e1711cdbbfb5","sha256:3fc25c334a7ae097186de58b7370b9e489efb750d55c9f06442619782ef06e31"],"state_sha256":"18e01534b826d4dc43d3136427d4bc130297126b7e5fb728ab78b06a91ee975a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qDvdrd7ULRaZ8pqgcZx5CpToo4H9jyfWUWnYPm0LEyuoW7YnN/azABMCw9WfhsVki9SvrqNgg6AuOZnnEA+vAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T10:59:23.334212Z","bundle_sha256":"9c66c6239f2bfba14e97ad9c2347d3d61db723725c70cd16a05bc4c88263f087"}}