{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:RRHGTJTQA4CFDCJJZUGRCV5OVT","short_pith_number":"pith:RRHGTJTQ","schema_version":"1.0","canonical_sha256":"8c4e69a6700704518929cd0d1157aeacd02f22f605480d55151b41b9e7120c0a","source":{"kind":"arxiv","id":"0905.2423","version":2},"attestation_state":"computed","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."},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"0905.2423","created_at":"2026-05-18T04:23:22.294880+00:00"},{"alias_kind":"arxiv_version","alias_value":"0905.2423v2","created_at":"2026-05-18T04:23:22.294880+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0905.2423","created_at":"2026-05-18T04:23:22.294880+00:00"},{"alias_kind":"pith_short_12","alias_value":"RRHGTJTQA4CF","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_16","alias_value":"RRHGTJTQA4CFDCJJ","created_at":"2026-05-18T12:26:01.383474+00:00"},{"alias_kind":"pith_short_8","alias_value":"RRHGTJTQ","created_at":"2026-05-18T12:26:01.383474+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT","json":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT.json","graph_json":"https://pith.science/api/pith-number/RRHGTJTQA4CFDCJJZUGRCV5OVT/graph.json","events_json":"https://pith.science/api/pith-number/RRHGTJTQA4CFDCJJZUGRCV5OVT/events.json","paper":"https://pith.science/paper/RRHGTJTQ"},"agent_actions":{"view_html":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT","download_json":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT.json","view_paper":"https://pith.science/paper/RRHGTJTQ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0905.2423&json=true","fetch_graph":"https://pith.science/api/pith-number/RRHGTJTQA4CFDCJJZUGRCV5OVT/graph.json","fetch_events":"https://pith.science/api/pith-number/RRHGTJTQA4CFDCJJZUGRCV5OVT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/action/storage_attestation","attest_author":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/action/author_attestation","sign_citation":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/action/citation_signature","submit_replication":"https://pith.science/pith/RRHGTJTQA4CFDCJJZUGRCV5OVT/action/replication_record"}},"created_at":"2026-05-18T04:23:22.294880+00:00","updated_at":"2026-05-18T04:23:22.294880+00:00"}