{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:XVPKQHYE3AQBBZWP3MZ244D6DM","short_pith_number":"pith:XVPKQHYE","canonical_record":{"source":{"id":"1505.06524","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-25T02:14:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7169e63fd79b57a33222e9811d4931abd27060e096be2d7d2a1ec3efd27a27da","abstract_canon_sha256":"f1283c0c0a1589c3d9b5a4eaee83d9cca8a41e512604a0de075386d34d0117b5"},"schema_version":"1.0"},"canonical_sha256":"bd5ea81f04d82010e6cfdb33ae707e1b2bea75c6d134c6abb1bc3695de7d4c64","source":{"kind":"arxiv","id":"1505.06524","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06524","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06524v4","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06524","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"XVPKQHYE3AQB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XVPKQHYE3AQBBZWP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XVPKQHYE","created_at":"2026-05-18T12:29:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:XVPKQHYE3AQBBZWP3MZ244D6DM","target":"record","payload":{"canonical_record":{"source":{"id":"1505.06524","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-25T02:14:47Z","cross_cats_sorted":["math.IT"],"title_canon_sha256":"7169e63fd79b57a33222e9811d4931abd27060e096be2d7d2a1ec3efd27a27da","abstract_canon_sha256":"f1283c0c0a1589c3d9b5a4eaee83d9cca8a41e512604a0de075386d34d0117b5"},"schema_version":"1.0"},"canonical_sha256":"bd5ea81f04d82010e6cfdb33ae707e1b2bea75c6d134c6abb1bc3695de7d4c64","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:35:38.018643Z","signature_b64":"1tp7N2QRi7rz3qsXrKy4fBd0Ul73Lz5jefHf+maqHn53IFt0ByIU5vCUK2fvQmvTyUs3mAEWWjXfyDJvYqP1Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bd5ea81f04d82010e6cfdb33ae707e1b2bea75c6d134c6abb1bc3695de7d4c64","last_reissued_at":"2026-05-18T01:35:38.018004Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:35:38.018004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1505.06524","source_version":4,"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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i2c4gIY7edlSRdDOk3lTQqSBifRurZpc5xOhxObJF6IUWx9Ccra9Ne49wXwYucH4TEfjPzAPguPfVIf0N7baDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:51:19.114570Z"},"content_sha256":"9e4ff78b60ff6d1418523225e4890c90ed00c961aa5ca6373c43dfa154d492c2","schema_version":"1.0","event_id":"sha256:9e4ff78b60ff6d1418523225e4890c90ed00c961aa5ca6373c43dfa154d492c2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:XVPKQHYE3AQBBZWP3MZ244D6DM","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"New Explicit Binary Constant Weight Codes from Reed-Solomon Codes","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT"],"primary_cat":"cs.IT","authors_text":"Hao Chen, Liqing Xu","submitted_at":"2015-05-25T02:14:47Z","abstract_excerpt":"Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from $q$-ary Reed-Solomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant weight codes $A(64, 10, 8) \\geq 4108$ and $A(64, 12, 8) \\geq 522$ are constructed. We also give explicitly constructed binary constant weight codes which improve Gilbert and Graham-Sloane lower bounds"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06524","kind":"arxiv","version":4},"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-18T01:35:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"iB6wBO3kUEsKHezOeC8hkbDudWVN9CoNoK5ZKZl7bPTAz1qy/fkzLniq+TRAJWCjkpXZ1ov1SNApiSlL6x/cAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T09:51:19.114917Z"},"content_sha256":"843a1df5144e5faffb7797ff774a9b43eff0939c21eadae9ff88e3dd34aeb298","schema_version":"1.0","event_id":"sha256:843a1df5144e5faffb7797ff774a9b43eff0939c21eadae9ff88e3dd34aeb298"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XVPKQHYE3AQBBZWP3MZ244D6DM/bundle.json","state_url":"https://pith.science/pith/XVPKQHYE3AQBBZWP3MZ244D6DM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XVPKQHYE3AQBBZWP3MZ244D6DM/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-07T09:51:19Z","links":{"resolver":"https://pith.science/pith/XVPKQHYE3AQBBZWP3MZ244D6DM","bundle":"https://pith.science/pith/XVPKQHYE3AQBBZWP3MZ244D6DM/bundle.json","state":"https://pith.science/pith/XVPKQHYE3AQBBZWP3MZ244D6DM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XVPKQHYE3AQBBZWP3MZ244D6DM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:XVPKQHYE3AQBBZWP3MZ244D6DM","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":"f1283c0c0a1589c3d9b5a4eaee83d9cca8a41e512604a0de075386d34d0117b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-25T02:14:47Z","title_canon_sha256":"7169e63fd79b57a33222e9811d4931abd27060e096be2d7d2a1ec3efd27a27da"},"schema_version":"1.0","source":{"id":"1505.06524","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1505.06524","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"arxiv_version","alias_value":"1505.06524v4","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1505.06524","created_at":"2026-05-18T01:35:38Z"},{"alias_kind":"pith_short_12","alias_value":"XVPKQHYE3AQB","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_16","alias_value":"XVPKQHYE3AQBBZWP","created_at":"2026-05-18T12:29:50Z"},{"alias_kind":"pith_short_8","alias_value":"XVPKQHYE","created_at":"2026-05-18T12:29:50Z"}],"graph_snapshots":[{"event_id":"sha256:843a1df5144e5faffb7797ff774a9b43eff0939c21eadae9ff88e3dd34aeb298","target":"graph","created_at":"2026-05-18T01:35:38Z","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":"Binary constant weight codes have important applications and have been studied for many years. Optimal or near-optimal binary constant weight codes of small lengths have been determined. In this paper we propose a new construction of explicit binary constant weight codes from $q$-ary Reed-Solomon codes. Some of our binary constant weight codes are optimal or new. In particular new binary constant weight codes $A(64, 10, 8) \\geq 4108$ and $A(64, 12, 8) \\geq 522$ are constructed. We also give explicitly constructed binary constant weight codes which improve Gilbert and Graham-Sloane lower bounds","authors_text":"Hao Chen, Liqing Xu","cross_cats":["math.IT"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-25T02:14:47Z","title":"New Explicit Binary Constant Weight Codes from Reed-Solomon Codes"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1505.06524","kind":"arxiv","version":4},"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:9e4ff78b60ff6d1418523225e4890c90ed00c961aa5ca6373c43dfa154d492c2","target":"record","created_at":"2026-05-18T01:35:38Z","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":"f1283c0c0a1589c3d9b5a4eaee83d9cca8a41e512604a0de075386d34d0117b5","cross_cats_sorted":["math.IT"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2015-05-25T02:14:47Z","title_canon_sha256":"7169e63fd79b57a33222e9811d4931abd27060e096be2d7d2a1ec3efd27a27da"},"schema_version":"1.0","source":{"id":"1505.06524","kind":"arxiv","version":4}},"canonical_sha256":"bd5ea81f04d82010e6cfdb33ae707e1b2bea75c6d134c6abb1bc3695de7d4c64","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bd5ea81f04d82010e6cfdb33ae707e1b2bea75c6d134c6abb1bc3695de7d4c64","first_computed_at":"2026-05-18T01:35:38.018004Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:35:38.018004Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1tp7N2QRi7rz3qsXrKy4fBd0Ul73Lz5jefHf+maqHn53IFt0ByIU5vCUK2fvQmvTyUs3mAEWWjXfyDJvYqP1Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:35:38.018643Z","signed_message":"canonical_sha256_bytes"},"source_id":"1505.06524","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9e4ff78b60ff6d1418523225e4890c90ed00c961aa5ca6373c43dfa154d492c2","sha256:843a1df5144e5faffb7797ff774a9b43eff0939c21eadae9ff88e3dd34aeb298"],"state_sha256":"852d9dd4a110976d8de7c1586bf5aa6378e1a09d3e5fa08d2f4d105ebd39a43e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"i6ZXIDlqwKgNMoai11bDj/0JI77wM/Y4o9BeC3DPZU1E+hJAfdNndhmx9fUN/bh0OYyCbWMh3zsZosiWmfIlDw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T09:51:19.116760Z","bundle_sha256":"e680fd3a44eb40fa90a81f942e7f18603eac2e9d8f055e8de4b36d77ef00bc58"}}