{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:RRHGTJTQA4CFDCJJZUGRCV5OVT","short_pith_number":"pith:RRHGTJTQ","canonical_record":{"source":{"id":"0905.2423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-14T21:12:19Z","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"title_canon_sha256":"e3dd618751b2057ff1df8b64f988cedf2e499f1baeba49c43a1cca3439f9c6b7","abstract_canon_sha256":"333463f245d59029a3a2ac760e58f423f45ecf500f23a2f668aa3015e67b17ed"},"schema_version":"1.0"},"canonical_sha256":"8c4e69a6700704518929cd0d1157aeacd02f22f605480d55151b41b9e7120c0a","source":{"kind":"arxiv","id":"0905.2423","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.2423","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"0905.2423v2","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2423","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"RRHGTJTQA4CF","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RRHGTJTQA4CFDCJJ","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RRHGTJTQ","created_at":"2026-05-18T12:26:01Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:RRHGTJTQA4CFDCJJZUGRCV5OVT","target":"record","payload":{"canonical_record":{"source":{"id":"0905.2423","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-14T21:12:19Z","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"title_canon_sha256":"e3dd618751b2057ff1df8b64f988cedf2e499f1baeba49c43a1cca3439f9c6b7","abstract_canon_sha256":"333463f245d59029a3a2ac760e58f423f45ecf500f23a2f668aa3015e67b17ed"},"schema_version":"1.0"},"canonical_sha256":"8c4e69a6700704518929cd0d1157aeacd02f22f605480d55151b41b9e7120c0a","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:23:22.295362Z","signature_b64":"eQUcuB0WiOzVT6gdrX9WDOGAGRZK9m4kVZKpV3ZocvaKte6S3As1pr6SMb5JG7FyQH6RQcg/f2/qwdSHFoEsCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"8c4e69a6700704518929cd0d1157aeacd02f22f605480d55151b41b9e7120c0a","last_reissued_at":"2026-05-18T04:23:22.294784Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:23:22.294784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"0905.2423","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-18T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qlhdcU0Dcq944D9r4jHkoAC34sZiuMaZSfVm/stzJ0nT0s5rXaBVcHaZFi+vOc1Beoo/5SYR3xUZ1tUG6YdiDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:37:37.078483Z"},"content_sha256":"2f3ac4a1e9c1b44544408e7f51c8510dfcf61d4da4243bc661f0caa0bd8d21ae","schema_version":"1.0","event_id":"sha256:2f3ac4a1e9c1b44544408e7f51c8510dfcf61d4da4243bc661f0caa0bd8d21ae"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:RRHGTJTQA4CFDCJJZUGRCV5OVT","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bounds on sets with few distances","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT","math.MG"],"primary_cat":"math.CO","authors_text":"Alexander Barg, Oleg R. Musin","submitted_at":"2009-05-14T21:12:19Z","abstract_excerpt":"We derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered:\n  (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of subsets;\n  (2) we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances;\n  (3) we prove a new bound on codes with few distances in the Hamming space, improving an earlier result of Delsarte.\n  We also find the size of maximal binary codes and maximal constant-weight codes of small length with 2 and 3 distances."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.2423","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-18T04:23:22Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b4iAKbXJga8Q6xfcDVNTbPyfqNWk7Tq+2N019pJR/upgFXkrA+FFPFtEKtmBMDXvl6k2czzbFH7NhSJnht/xAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-07T07:37:37.079031Z"},"content_sha256":"c19f8b9c38f8841790051b1d53eae50d9ab6951a0c295b97b81e258553f53888","schema_version":"1.0","event_id":"sha256:c19f8b9c38f8841790051b1d53eae50d9ab6951a0c295b97b81e258553f53888"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/bundle.json","state_url":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/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-07T07:37:37Z","links":{"resolver":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT","bundle":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/bundle.json","state":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:RRHGTJTQA4CFDCJJZUGRCV5OVT","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":"333463f245d59029a3a2ac760e58f423f45ecf500f23a2f668aa3015e67b17ed","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-14T21:12:19Z","title_canon_sha256":"e3dd618751b2057ff1df8b64f988cedf2e499f1baeba49c43a1cca3439f9c6b7"},"schema_version":"1.0","source":{"id":"0905.2423","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0905.2423","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"arxiv_version","alias_value":"0905.2423v2","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2423","created_at":"2026-05-18T04:23:22Z"},{"alias_kind":"pith_short_12","alias_value":"RRHGTJTQA4CF","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_16","alias_value":"RRHGTJTQA4CFDCJJ","created_at":"2026-05-18T12:26:01Z"},{"alias_kind":"pith_short_8","alias_value":"RRHGTJTQ","created_at":"2026-05-18T12:26:01Z"}],"graph_snapshots":[{"event_id":"sha256:c19f8b9c38f8841790051b1d53eae50d9ab6951a0c295b97b81e258553f53888","target":"graph","created_at":"2026-05-18T04:23:22Z","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 derive a new estimate of the size of finite sets of points in metric spaces with few distances. The following applications are considered:\n  (1) we improve the Ray-Chaudhuri--Wilson bound of the size of uniform intersecting families of subsets;\n  (2) we refine the bound of Delsarte-Goethals-Seidel on the maximum size of spherical sets with few distances;\n  (3) we prove a new bound on codes with few distances in the Hamming space, improving an earlier result of Delsarte.\n  We also find the size of maximal binary codes and maximal constant-weight codes of small length with 2 and 3 distances.","authors_text":"Alexander Barg, Oleg R. Musin","cross_cats":["cs.IT","math.IT","math.MG"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-14T21:12:19Z","title":"Bounds on sets with few distances"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0905.2423","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:2f3ac4a1e9c1b44544408e7f51c8510dfcf61d4da4243bc661f0caa0bd8d21ae","target":"record","created_at":"2026-05-18T04:23:22Z","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":"333463f245d59029a3a2ac760e58f423f45ecf500f23a2f668aa3015e67b17ed","cross_cats_sorted":["cs.IT","math.IT","math.MG"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2009-05-14T21:12:19Z","title_canon_sha256":"e3dd618751b2057ff1df8b64f988cedf2e499f1baeba49c43a1cca3439f9c6b7"},"schema_version":"1.0","source":{"id":"0905.2423","kind":"arxiv","version":2}},"canonical_sha256":"8c4e69a6700704518929cd0d1157aeacd02f22f605480d55151b41b9e7120c0a","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8c4e69a6700704518929cd0d1157aeacd02f22f605480d55151b41b9e7120c0a","first_computed_at":"2026-05-18T04:23:22.294784Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:23:22.294784Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eQUcuB0WiOzVT6gdrX9WDOGAGRZK9m4kVZKpV3ZocvaKte6S3As1pr6SMb5JG7FyQH6RQcg/f2/qwdSHFoEsCw==","signature_status":"signed_v1","signed_at":"2026-05-18T04:23:22.295362Z","signed_message":"canonical_sha256_bytes"},"source_id":"0905.2423","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:2f3ac4a1e9c1b44544408e7f51c8510dfcf61d4da4243bc661f0caa0bd8d21ae","sha256:c19f8b9c38f8841790051b1d53eae50d9ab6951a0c295b97b81e258553f53888"],"state_sha256":"8ad9b2291aa84866c0c65a443b1ae890be65e9c5305b5f49863a09155de4a391"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uqYgl8l9xuNnHAoohRV8km0Zv52lwA1iqGDveMKPZKVTCyLIxjs4f9cdyyX4MvqzwQffwyfwJzyQZDiYcXTbAg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-07T07:37:37.081664Z","bundle_sha256":"7e6bbc1b66990bd5f3a5929f672e45bc73497bdca2714442330fc97eb5cf2f15"}}