{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:PP5FWDVIE56VVDEHBLGXHCWRL3","short_pith_number":"pith:PP5FWDVI","canonical_record":{"source":{"id":"2411.16028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T01:06:14Z","cross_cats_sorted":[],"title_canon_sha256":"82ee525cacfcaefafb0e8bb403577d781c79b3508b6846bab5eb46dff7f6fd2d","abstract_canon_sha256":"e5eafbea57ec050f14b558ccd85b7570fbd7f65ab76a78106f6f5d93c003d0c5"},"schema_version":"1.0"},"canonical_sha256":"7bfa5b0ea8277d5a8c870acd738ad15efa3f035ed5da0fb9d61c8269c37e3586","source":{"kind":"arxiv","id":"2411.16028","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16028","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16028v1","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16028","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"PP5FWDVIE56V","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"pith_short_16","alias_value":"PP5FWDVIE56VVDEH","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"pith_short_8","alias_value":"PP5FWDVI","created_at":"2026-07-05T09:40:02Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:PP5FWDVIE56VVDEHBLGXHCWRL3","target":"record","payload":{"canonical_record":{"source":{"id":"2411.16028","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T01:06:14Z","cross_cats_sorted":[],"title_canon_sha256":"82ee525cacfcaefafb0e8bb403577d781c79b3508b6846bab5eb46dff7f6fd2d","abstract_canon_sha256":"e5eafbea57ec050f14b558ccd85b7570fbd7f65ab76a78106f6f5d93c003d0c5"},"schema_version":"1.0"},"canonical_sha256":"7bfa5b0ea8277d5a8c870acd738ad15efa3f035ed5da0fb9d61c8269c37e3586","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:02.784766Z","signature_b64":"SMS5zS3V4SK1q2Setaut6Jaee0Eu53RLdFjg4e3tLptIos+JDKFVUN/nqDp3IlWTIGOrYComY0QWk0A7RIkNAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7bfa5b0ea8277d5a8c870acd738ad15efa3f035ed5da0fb9d61c8269c37e3586","last_reissued_at":"2026-07-05T09:40:02.784257Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:02.784257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.16028","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-07-05T09:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FPBGx7O3sBdLmP2H4suYj/7OsOn67YKecx849ZC/D2SoJSJuv+Pu9YtsV3+0u/suQr7Fdx2NG9ltfu0thcmiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:07:07.840306Z"},"content_sha256":"4371d0fa449b40054224ba490a547091c8f10a41f780d3e0c68d9d4d096818bb","schema_version":"1.0","event_id":"sha256:4371d0fa449b40054224ba490a547091c8f10a41f780d3e0c68d9d4d096818bb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:PP5FWDVIE56VVDEHBLGXHCWRL3","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Asymptotically optimal constant weight codes with even distance","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Patrick Bennett","submitted_at":"2024-11-25T01:06:14Z","abstract_excerpt":"A $q$-ary code $C$ of length $n$ is a set of $n$-dimensional vectors (code words) with entries in $\\{0, \\ldots, q-1\\}$. We say $C$ has constant weight $w$ if each code word has exactly $w$ nonzero entries. We say $C$ has minimum distance $d$ if any two distinct code words in $C$ differ in at least $d$ entries. We let $A_q(n, d, w)$ be the largest possible cardinality of any $q$-ary code of length $n$ with constant weight $w$ and minimum distance $d$. Very recently, Liu and Shangguan gave an asymptotically sharp estimate for $A_q(n, d, w)$ where $q, d, w$ are fixed, $d$ is odd and $n \\rightarro"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16028","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2411.16028/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T09:40:02Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/xJTO/oFYBNjSQrjAuN+R0LnlHsMk8LMjg26vRF78vBMa5Y6MfO37LpMyvU3CCm9FS2i4jT4JGVoMUODwADLBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T22:07:07.840689Z"},"content_sha256":"46bd99d90e9e683a42481085bda7f5e076a309e1639d2ec66643dcc21691ce62","schema_version":"1.0","event_id":"sha256:46bd99d90e9e683a42481085bda7f5e076a309e1639d2ec66643dcc21691ce62"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PP5FWDVIE56VVDEHBLGXHCWRL3/bundle.json","state_url":"https://pith.science/pith/PP5FWDVIE56VVDEHBLGXHCWRL3/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PP5FWDVIE56VVDEHBLGXHCWRL3/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-08-12T22:07:07Z","links":{"resolver":"https://pith.science/pith/PP5FWDVIE56VVDEHBLGXHCWRL3","bundle":"https://pith.science/pith/PP5FWDVIE56VVDEHBLGXHCWRL3/bundle.json","state":"https://pith.science/pith/PP5FWDVIE56VVDEHBLGXHCWRL3/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PP5FWDVIE56VVDEHBLGXHCWRL3/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:PP5FWDVIE56VVDEHBLGXHCWRL3","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":"e5eafbea57ec050f14b558ccd85b7570fbd7f65ab76a78106f6f5d93c003d0c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T01:06:14Z","title_canon_sha256":"82ee525cacfcaefafb0e8bb403577d781c79b3508b6846bab5eb46dff7f6fd2d"},"schema_version":"1.0","source":{"id":"2411.16028","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.16028","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"arxiv_version","alias_value":"2411.16028v1","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16028","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"pith_short_12","alias_value":"PP5FWDVIE56V","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"pith_short_16","alias_value":"PP5FWDVIE56VVDEH","created_at":"2026-07-05T09:40:02Z"},{"alias_kind":"pith_short_8","alias_value":"PP5FWDVI","created_at":"2026-07-05T09:40:02Z"}],"graph_snapshots":[{"event_id":"sha256:46bd99d90e9e683a42481085bda7f5e076a309e1639d2ec66643dcc21691ce62","target":"graph","created_at":"2026-07-05T09:40:02Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2411.16028/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A $q$-ary code $C$ of length $n$ is a set of $n$-dimensional vectors (code words) with entries in $\\{0, \\ldots, q-1\\}$. We say $C$ has constant weight $w$ if each code word has exactly $w$ nonzero entries. We say $C$ has minimum distance $d$ if any two distinct code words in $C$ differ in at least $d$ entries. We let $A_q(n, d, w)$ be the largest possible cardinality of any $q$-ary code of length $n$ with constant weight $w$ and minimum distance $d$. Very recently, Liu and Shangguan gave an asymptotically sharp estimate for $A_q(n, d, w)$ where $q, d, w$ are fixed, $d$ is odd and $n \\rightarro","authors_text":"Patrick Bennett","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T01:06:14Z","title":"Asymptotically optimal constant weight codes with even distance"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16028","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:4371d0fa449b40054224ba490a547091c8f10a41f780d3e0c68d9d4d096818bb","target":"record","created_at":"2026-07-05T09:40:02Z","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":"e5eafbea57ec050f14b558ccd85b7570fbd7f65ab76a78106f6f5d93c003d0c5","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"math.CO","submitted_at":"2024-11-25T01:06:14Z","title_canon_sha256":"82ee525cacfcaefafb0e8bb403577d781c79b3508b6846bab5eb46dff7f6fd2d"},"schema_version":"1.0","source":{"id":"2411.16028","kind":"arxiv","version":1}},"canonical_sha256":"7bfa5b0ea8277d5a8c870acd738ad15efa3f035ed5da0fb9d61c8269c37e3586","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7bfa5b0ea8277d5a8c870acd738ad15efa3f035ed5da0fb9d61c8269c37e3586","first_computed_at":"2026-07-05T09:40:02.784257Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:40:02.784257Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SMS5zS3V4SK1q2Setaut6Jaee0Eu53RLdFjg4e3tLptIos+JDKFVUN/nqDp3IlWTIGOrYComY0QWk0A7RIkNAw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:40:02.784766Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.16028","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:4371d0fa449b40054224ba490a547091c8f10a41f780d3e0c68d9d4d096818bb","sha256:46bd99d90e9e683a42481085bda7f5e076a309e1639d2ec66643dcc21691ce62"],"state_sha256":"f11abf272b0ce23181d2fbdda4a5295563a6f7b58a8f8f88e38ddb07e9b2d876"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zP+LsVdhzxGN+Em3KVAwZELMVzCoPxOhbfRL7wsx2253ooekc3e5L5Wr2zoJTUlWGk6iW1KFScnIEYa374I3Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T22:07:07.843139Z","bundle_sha256":"d7dcb77e4e2dc392d4443d21a5e2daf547245a48596fb3cd3cb6f4380502524d"}}