{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:X5Z5P2HKQNJNU7LQBBWQXGO3GC","short_pith_number":"pith:X5Z5P2HK","schema_version":"1.0","canonical_sha256":"bf73d7e8ea8352da7d70086d0b99db30b38fd61e30204179bf3045275e47c050","source":{"kind":"arxiv","id":"2411.16038","version":1},"attestation_state":"computed","paper":{"title":"The Tammes Problem in $\\mathbb{R}^{n}$ and Linear Programming Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Qun Mo, Yanlu Lian, Yu Xia","submitted_at":"2024-11-25T02:02:41Z","abstract_excerpt":"The Tammes problem delves into the optimal arrangement of $N$ points on the surface of the $n$-dimensional unit sphere (denoted as $\\mathbb{S}^{n-1}$), aiming to maximize the minimum distance between any two points. In this paper, we articulate the sufficient conditions requisite for attaining the optimal value of the Tammes problem for arbitrary $n, N \\in \\mathbb{N}^{+}$, employing the linear programming framework pioneered by Delsarte et al. Furthermore, we showcase several illustrative examples across various dimensions $n$ and select values of $N$ that yield optimal configurations. The fin"},"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":"2411.16038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2024-11-25T02:02:41Z","cross_cats_sorted":[],"title_canon_sha256":"022509a7cbad0cb2b2148a391b7b640eeb5ea0fb328b08fdb8f05f7da628614c","abstract_canon_sha256":"66d8658f344f8a05db66ab6b7e3418a6eaa021e4227331a0b6f74a7de1171396"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:40:02.952138Z","signature_b64":"BZgogS5NtIPhN8M9HfinjOx99lSCJAGVI3Z0i+XEtZ90MN7gc1Gj67XPoP73adJRVO24JKEm9JOINYJK3HjCDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bf73d7e8ea8352da7d70086d0b99db30b38fd61e30204179bf3045275e47c050","last_reissued_at":"2026-07-05T09:40:02.951554Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:40:02.951554Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Tammes Problem in $\\mathbb{R}^{n}$ and Linear Programming Method","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Qun Mo, Yanlu Lian, Yu Xia","submitted_at":"2024-11-25T02:02:41Z","abstract_excerpt":"The Tammes problem delves into the optimal arrangement of $N$ points on the surface of the $n$-dimensional unit sphere (denoted as $\\mathbb{S}^{n-1}$), aiming to maximize the minimum distance between any two points. In this paper, we articulate the sufficient conditions requisite for attaining the optimal value of the Tammes problem for arbitrary $n, N \\in \\mathbb{N}^{+}$, employing the linear programming framework pioneered by Delsarte et al. Furthermore, we showcase several illustrative examples across various dimensions $n$ and select values of $N$ that yield optimal configurations. The fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.16038","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.16038/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2411.16038","created_at":"2026-07-05T09:40:02.951623+00:00"},{"alias_kind":"arxiv_version","alias_value":"2411.16038v1","created_at":"2026-07-05T09:40:02.951623+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.16038","created_at":"2026-07-05T09:40:02.951623+00:00"},{"alias_kind":"pith_short_12","alias_value":"X5Z5P2HKQNJN","created_at":"2026-07-05T09:40:02.951623+00:00"},{"alias_kind":"pith_short_16","alias_value":"X5Z5P2HKQNJNU7LQ","created_at":"2026-07-05T09:40:02.951623+00:00"},{"alias_kind":"pith_short_8","alias_value":"X5Z5P2HK","created_at":"2026-07-05T09:40:02.951623+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/X5Z5P2HKQNJNU7LQBBWQXGO3GC","json":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC.json","graph_json":"https://pith.science/api/pith-number/X5Z5P2HKQNJNU7LQBBWQXGO3GC/graph.json","events_json":"https://pith.science/api/pith-number/X5Z5P2HKQNJNU7LQBBWQXGO3GC/events.json","paper":"https://pith.science/paper/X5Z5P2HK"},"agent_actions":{"view_html":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC","download_json":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC.json","view_paper":"https://pith.science/paper/X5Z5P2HK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2411.16038&json=true","fetch_graph":"https://pith.science/api/pith-number/X5Z5P2HKQNJNU7LQBBWQXGO3GC/graph.json","fetch_events":"https://pith.science/api/pith-number/X5Z5P2HKQNJNU7LQBBWQXGO3GC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC/action/storage_attestation","attest_author":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC/action/author_attestation","sign_citation":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC/action/citation_signature","submit_replication":"https://pith.science/pith/X5Z5P2HKQNJNU7LQBBWQXGO3GC/action/replication_record"}},"created_at":"2026-07-05T09:40:02.951623+00:00","updated_at":"2026-07-05T09:40:02.951623+00:00"}