{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:66EU7BGBMGIJ2JHEZ3U35U5IQK","short_pith_number":"pith:66EU7BGB","canonical_record":{"source":{"id":"1609.05277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-17T03:39:32Z","cross_cats_sorted":["cs.DM","math.CO","math.IT","math.MG"],"title_canon_sha256":"fb46fdcc86de85ca0ea9ca2b284b4147be0852c2d9526b63aef60c4180d161e0","abstract_canon_sha256":"449615da4fa3ef68a4b5525c1a2e3458d374bba82999bf6fbdd0fd1781baed44"},"schema_version":"1.0"},"canonical_sha256":"f7894f84c161909d24e4cee9bed3a882a089f61d9feb6e2db819e4be103ea413","source":{"kind":"arxiv","id":"1609.05277","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05277","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05277v2","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05277","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"66EU7BGBMGIJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"66EU7BGBMGIJ2JHE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"66EU7BGB","created_at":"2026-05-18T12:30:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:66EU7BGBMGIJ2JHEZ3U35U5IQK","target":"record","payload":{"canonical_record":{"source":{"id":"1609.05277","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-17T03:39:32Z","cross_cats_sorted":["cs.DM","math.CO","math.IT","math.MG"],"title_canon_sha256":"fb46fdcc86de85ca0ea9ca2b284b4147be0852c2d9526b63aef60c4180d161e0","abstract_canon_sha256":"449615da4fa3ef68a4b5525c1a2e3458d374bba82999bf6fbdd0fd1781baed44"},"schema_version":"1.0"},"canonical_sha256":"f7894f84c161909d24e4cee9bed3a882a089f61d9feb6e2db819e4be103ea413","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:46:04.336988Z","signature_b64":"S+DO5zYx6P+E0eRz3muw6pj0zc4sBaevcoSS3ANwoaDMhDjjsf59LB+OXTRvAdcQGrUlpcTcHpuO+gTfCMNUCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f7894f84c161909d24e4cee9bed3a882a089f61d9feb6e2db819e4be103ea413","last_reissued_at":"2026-05-18T00:46:04.336624Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:46:04.336624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1609.05277","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-18T00:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"NyxLXhd5vxRzqNxQINqcX0hRF3iw3/Xupuqx1DLLR8dkGagKwsWZn71U1QRueDzAffc7XcYDlGTlSvemJSKzAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:21:39.650380Z"},"content_sha256":"9eb801b67748583a810d82c41fede7a6c282956d751112019125032029dcbd1a","schema_version":"1.0","event_id":"sha256:9eb801b67748583a810d82c41fede7a6c282956d751112019125032029dcbd1a"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:66EU7BGBMGIJ2JHEZ3U35U5IQK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Improved Lower Bounds on the Size of Balls over Permutations with the Infinity Metric","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","math.CO","math.IT","math.MG"],"primary_cat":"cs.IT","authors_text":"Moshe Schwartz, Pascal O. Vontobel","submitted_at":"2016-09-17T03:39:32Z","abstract_excerpt":"We study the size (or volume) of balls in the metric space of permutations, $S_n$, under the infinity metric. We focus on the regime of balls with radius $r = \\rho \\cdot (n\\!-\\!1)$, $\\rho \\in [0,1]$, i.e., a radius that is a constant fraction of the maximum possible distance. We provide new lower bounds on the size of such balls. These new lower bounds reduce the asymptotic gap to the known upper bounds to at most $0.029$ bits per symbol. Additionally, they imply an improved ball-packing bound for error-correcting codes, and an improved upper bound on the size of optimal covering codes."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05277","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-18T00:46:04Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bBQKqR2tIzCSfVPiGF5pOK3pd0OzDdusCtEgd4cd0nIkqLeuu326x9Du0jrB0K+OzT57rtNX3H74Tgf7yzdRCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-08T05:21:39.650772Z"},"content_sha256":"2ef8d83f30c48ce05a20f0b61e4f477e60a088a64da1fead25f5fa7df771b8c3","schema_version":"1.0","event_id":"sha256:2ef8d83f30c48ce05a20f0b61e4f477e60a088a64da1fead25f5fa7df771b8c3"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/66EU7BGBMGIJ2JHEZ3U35U5IQK/bundle.json","state_url":"https://pith.science/pith/66EU7BGBMGIJ2JHEZ3U35U5IQK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/66EU7BGBMGIJ2JHEZ3U35U5IQK/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-08T05:21:39Z","links":{"resolver":"https://pith.science/pith/66EU7BGBMGIJ2JHEZ3U35U5IQK","bundle":"https://pith.science/pith/66EU7BGBMGIJ2JHEZ3U35U5IQK/bundle.json","state":"https://pith.science/pith/66EU7BGBMGIJ2JHEZ3U35U5IQK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/66EU7BGBMGIJ2JHEZ3U35U5IQK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:66EU7BGBMGIJ2JHEZ3U35U5IQK","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":"449615da4fa3ef68a4b5525c1a2e3458d374bba82999bf6fbdd0fd1781baed44","cross_cats_sorted":["cs.DM","math.CO","math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-17T03:39:32Z","title_canon_sha256":"fb46fdcc86de85ca0ea9ca2b284b4147be0852c2d9526b63aef60c4180d161e0"},"schema_version":"1.0","source":{"id":"1609.05277","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1609.05277","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"arxiv_version","alias_value":"1609.05277v2","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1609.05277","created_at":"2026-05-18T00:46:04Z"},{"alias_kind":"pith_short_12","alias_value":"66EU7BGBMGIJ","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_16","alias_value":"66EU7BGBMGIJ2JHE","created_at":"2026-05-18T12:30:01Z"},{"alias_kind":"pith_short_8","alias_value":"66EU7BGB","created_at":"2026-05-18T12:30:01Z"}],"graph_snapshots":[{"event_id":"sha256:2ef8d83f30c48ce05a20f0b61e4f477e60a088a64da1fead25f5fa7df771b8c3","target":"graph","created_at":"2026-05-18T00:46: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 study the size (or volume) of balls in the metric space of permutations, $S_n$, under the infinity metric. We focus on the regime of balls with radius $r = \\rho \\cdot (n\\!-\\!1)$, $\\rho \\in [0,1]$, i.e., a radius that is a constant fraction of the maximum possible distance. We provide new lower bounds on the size of such balls. These new lower bounds reduce the asymptotic gap to the known upper bounds to at most $0.029$ bits per symbol. Additionally, they imply an improved ball-packing bound for error-correcting codes, and an improved upper bound on the size of optimal covering codes.","authors_text":"Moshe Schwartz, Pascal O. Vontobel","cross_cats":["cs.DM","math.CO","math.IT","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-17T03:39:32Z","title":"Improved Lower Bounds on the Size of Balls over Permutations with the Infinity Metric"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1609.05277","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:9eb801b67748583a810d82c41fede7a6c282956d751112019125032029dcbd1a","target":"record","created_at":"2026-05-18T00:46: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":"449615da4fa3ef68a4b5525c1a2e3458d374bba82999bf6fbdd0fd1781baed44","cross_cats_sorted":["cs.DM","math.CO","math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2016-09-17T03:39:32Z","title_canon_sha256":"fb46fdcc86de85ca0ea9ca2b284b4147be0852c2d9526b63aef60c4180d161e0"},"schema_version":"1.0","source":{"id":"1609.05277","kind":"arxiv","version":2}},"canonical_sha256":"f7894f84c161909d24e4cee9bed3a882a089f61d9feb6e2db819e4be103ea413","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f7894f84c161909d24e4cee9bed3a882a089f61d9feb6e2db819e4be103ea413","first_computed_at":"2026-05-18T00:46:04.336624Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:46:04.336624Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S+DO5zYx6P+E0eRz3muw6pj0zc4sBaevcoSS3ANwoaDMhDjjsf59LB+OXTRvAdcQGrUlpcTcHpuO+gTfCMNUCA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:46:04.336988Z","signed_message":"canonical_sha256_bytes"},"source_id":"1609.05277","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9eb801b67748583a810d82c41fede7a6c282956d751112019125032029dcbd1a","sha256:2ef8d83f30c48ce05a20f0b61e4f477e60a088a64da1fead25f5fa7df771b8c3"],"state_sha256":"8436490e777b9aa000fd272584db2b0ede7ff15a60df98e7acfa6ddfe8967e15"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"KowlAjAhr7Q9zM6ccHqd3UVVVNKrzDj5sPbg0RiObA5CuZB1W7XTtNhkEQ0M8wxRypYLv7jQ2OuyJQG/Ou2AAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-08T05:21:39.653179Z","bundle_sha256":"df6dc15f853b89c61b81aba6bdba504116656f69d95f94342feea25e30e179d5"}}