{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2006:EAIFXKAPNRFFO6DCYNOQCEVVT5","short_pith_number":"pith:EAIFXKAP","schema_version":"1.0","canonical_sha256":"20105ba80f6c4a577862c35d0112b59f4be66a2d553a4f30be2109830d6e9c5b","source":{"kind":"arxiv","id":"math/0606002","version":2},"attestation_state":"computed","paper":{"title":"Covering spheres with spheres","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Ilya Dumer","submitted_at":"2006-05-31T20:28:16Z","abstract_excerpt":"Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average number of solid spheres covering a point in a bigger sphere. For a growing dimension $n,$ we design a covering that has covering density of order $(n\\ln n)/2$ for the full Euclidean space or for a sphere of any radius $r>1.$ This new upper bound reduces two times the asymptotic order of $n\\ln n$ established in the classical Rogers bound."},"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":"math/0606002","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.MG","submitted_at":"2006-05-31T20:28:16Z","cross_cats_sorted":[],"title_canon_sha256":"9f8da8ba999a2d0436fa0e2fac198d66c59617a8c901a6a184ec39f6c8a5a67c","abstract_canon_sha256":"f8a945c713e48e7b95bdf4207ec24f86ca8d8f4d2082375e325a5d828d15ebf2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:15:31.419581Z","signature_b64":"yx/D728KnJh4rssYyso1RPG8wdsJrXPiHmbj6YkfS3NJuYcGpF7GwAwiH1juPPUaQQ7Wtcmepc73adlNK6VFCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"20105ba80f6c4a577862c35d0112b59f4be66a2d553a4f30be2109830d6e9c5b","last_reissued_at":"2026-05-18T00:15:31.418764Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:15:31.418764Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Covering spheres with spheres","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Ilya Dumer","submitted_at":"2006-05-31T20:28:16Z","abstract_excerpt":"Given a sphere of any radius $r$ in an $n$-dimensional Euclidean space, we study the coverings of this sphere with solid spheres of radius one. Our goal is to design a covering of the lowest covering density, which defines the average number of solid spheres covering a point in a bigger sphere. For a growing dimension $n,$ we design a covering that has covering density of order $(n\\ln n)/2$ for the full Euclidean space or for a sphere of any radius $r>1.$ This new upper bound reduces two times the asymptotic order of $n\\ln n$ established in the classical Rogers bound."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/0606002","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":"math/0606002","created_at":"2026-05-18T00:15:31.418911+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/0606002v2","created_at":"2026-05-18T00:15:31.418911+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/0606002","created_at":"2026-05-18T00:15:31.418911+00:00"},{"alias_kind":"pith_short_12","alias_value":"EAIFXKAPNRFF","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_16","alias_value":"EAIFXKAPNRFFO6DC","created_at":"2026-05-18T12:25:53.939244+00:00"},{"alias_kind":"pith_short_8","alias_value":"EAIFXKAP","created_at":"2026-05-18T12:25:53.939244+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/EAIFXKAPNRFFO6DCYNOQCEVVT5","json":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5.json","graph_json":"https://pith.science/api/pith-number/EAIFXKAPNRFFO6DCYNOQCEVVT5/graph.json","events_json":"https://pith.science/api/pith-number/EAIFXKAPNRFFO6DCYNOQCEVVT5/events.json","paper":"https://pith.science/paper/EAIFXKAP"},"agent_actions":{"view_html":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5","download_json":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5.json","view_paper":"https://pith.science/paper/EAIFXKAP","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/0606002&json=true","fetch_graph":"https://pith.science/api/pith-number/EAIFXKAPNRFFO6DCYNOQCEVVT5/graph.json","fetch_events":"https://pith.science/api/pith-number/EAIFXKAPNRFFO6DCYNOQCEVVT5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5/action/storage_attestation","attest_author":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5/action/author_attestation","sign_citation":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5/action/citation_signature","submit_replication":"https://pith.science/pith/EAIFXKAPNRFFO6DCYNOQCEVVT5/action/replication_record"}},"created_at":"2026-05-18T00:15:31.418911+00:00","updated_at":"2026-05-18T00:15:31.418911+00:00"}