{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:DPC56GYWLSXUHIA7RSD35CZRCZ","short_pith_number":"pith:DPC56GYW","schema_version":"1.0","canonical_sha256":"1bc5df1b165caf43a01f8c87be8b31166f82a33950fa60034db82b859d8b91dc","source":{"kind":"arxiv","id":"1311.3219","version":3},"attestation_state":"computed","paper":{"title":"New bounds for equiangular lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Alexander Barg, Wei-Hsuan Yu","submitted_at":"2013-11-13T17:16:18Z","abstract_excerpt":"A set of lines in $\\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\\mathbb{R}^n$, using semidefinite programming to improve the upper bounds on this quantity. Improvements are obtained in dimensions $24 \\leq n \\leq 136$. In particular, we show that the maximum number of equiangular lines in $\\mathbb{R}^n$ is $276$ for all $24 \\leq n \\leq 41$ and is 344 for $n=43.$ This provides a partial resolution of the conjecture set forth by Lemmens and Seidel (1973)."},"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":"1311.3219","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2013-11-13T17:16:18Z","cross_cats_sorted":[],"title_canon_sha256":"1eeb14050feb66a3a0636ec4c0bb5557a942e00e3f6a72c4410c5a380b7b2333","abstract_canon_sha256":"89ac59aa1cc8aaa6afd294da5e875b7ad6ae84e111c746bf4df3f1f942e564eb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:51:08.292771Z","signature_b64":"LsAWfWkl4vELv5671W3FSzL65qDeMsDRLiCt5naES+Ez6KPgvuBhYYLnJAdW7w4m/3I7QG4thmgWJhRCpJeeAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bc5df1b165caf43a01f8c87be8b31166f82a33950fa60034db82b859d8b91dc","last_reissued_at":"2026-05-18T02:51:08.292413Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:51:08.292413Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"New bounds for equiangular lines","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Alexander Barg, Wei-Hsuan Yu","submitted_at":"2013-11-13T17:16:18Z","abstract_excerpt":"A set of lines in $\\mathbb{R}^n$ is called equiangular if the angle between each pair of lines is the same. We address the question of determining the maximum size of equiangular line sets in $\\mathbb{R}^n$, using semidefinite programming to improve the upper bounds on this quantity. Improvements are obtained in dimensions $24 \\leq n \\leq 136$. In particular, we show that the maximum number of equiangular lines in $\\mathbb{R}^n$ is $276$ for all $24 \\leq n \\leq 41$ and is 344 for $n=43.$ This provides a partial resolution of the conjecture set forth by Lemmens and Seidel (1973)."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.3219","kind":"arxiv","version":3},"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":"1311.3219","created_at":"2026-05-18T02:51:08.292467+00:00"},{"alias_kind":"arxiv_version","alias_value":"1311.3219v3","created_at":"2026-05-18T02:51:08.292467+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.3219","created_at":"2026-05-18T02:51:08.292467+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPC56GYWLSXU","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPC56GYWLSXUHIA7","created_at":"2026-05-18T12:27:43.054852+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPC56GYW","created_at":"2026-05-18T12:27:43.054852+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/DPC56GYWLSXUHIA7RSD35CZRCZ","json":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ.json","graph_json":"https://pith.science/api/pith-number/DPC56GYWLSXUHIA7RSD35CZRCZ/graph.json","events_json":"https://pith.science/api/pith-number/DPC56GYWLSXUHIA7RSD35CZRCZ/events.json","paper":"https://pith.science/paper/DPC56GYW"},"agent_actions":{"view_html":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ","download_json":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ.json","view_paper":"https://pith.science/paper/DPC56GYW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1311.3219&json=true","fetch_graph":"https://pith.science/api/pith-number/DPC56GYWLSXUHIA7RSD35CZRCZ/graph.json","fetch_events":"https://pith.science/api/pith-number/DPC56GYWLSXUHIA7RSD35CZRCZ/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ/action/storage_attestation","attest_author":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ/action/author_attestation","sign_citation":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ/action/citation_signature","submit_replication":"https://pith.science/pith/DPC56GYWLSXUHIA7RSD35CZRCZ/action/replication_record"}},"created_at":"2026-05-18T02:51:08.292467+00:00","updated_at":"2026-05-18T02:51:08.292467+00:00"}