{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:1997:QFLCXRVDRIBWLBCTSDY4VPW32U","short_pith_number":"pith:QFLCXRVD","schema_version":"1.0","canonical_sha256":"81562bc6a38a0365845390f1cabedbd500283d4c2dfe4f3aaad5c87d60904005","source":{"kind":"arxiv","id":"math/9701213","version":1},"attestation_state":"computed","paper":{"title":"Metric Entropy of Homogeneous Spaces","license":"","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Stanislaw J. Szarek","submitted_at":"1997-01-28T00:00:00Z","abstract_excerpt":"For a (compact) subset $K$ of a metric space and $\\varepsilon > 0$, the {\\em covering number} $N(K , \\varepsilon )$ is defined as the smallest number of balls of radius $\\varepsilon$ whose union covers $K$. Knowledge of the {\\em metric entropy}, i.e., the asymptotic behaviour of covering numbers for (families of) metric spaces is important in many areas of mathematics (geometry, functional analysis, probability, coding theory, to name a few). In this paper we give asymptotically correct estimates for covering numbers for a large class of homogeneous spaces of unitary (or orthogonal) groups wit"},"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/9701213","kind":"arxiv","version":1},"metadata":{"license":"","primary_cat":"math.MG","submitted_at":"1997-01-28T00:00:00Z","cross_cats_sorted":[],"title_canon_sha256":"91f03b77256ecb2ebb7c544b5ea8f609988011f7b91cc412c0016f7764fd32ac","abstract_canon_sha256":"d9d0fe7a6eb28275700c15abaa3413e566950cdaca55c463a31ce78242de73a4"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-04T15:51:30.529810Z","signature_b64":"p9OsMM1TlIxIisoWvvFboM0KxyhmHr6do/no1oDnGkpdSPWhx8G0F8Gnk6nvW/RhDGp45SXbSorRoVGn7IqkBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"81562bc6a38a0365845390f1cabedbd500283d4c2dfe4f3aaad5c87d60904005","last_reissued_at":"2026-07-04T15:51:30.529390Z","signature_status":"signed_v1","first_computed_at":"2026-07-04T15:51:30.529390Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Metric Entropy of Homogeneous Spaces","license":"","headline":"","cross_cats":[],"primary_cat":"math.MG","authors_text":"Stanislaw J. Szarek","submitted_at":"1997-01-28T00:00:00Z","abstract_excerpt":"For a (compact) subset $K$ of a metric space and $\\varepsilon > 0$, the {\\em covering number} $N(K , \\varepsilon )$ is defined as the smallest number of balls of radius $\\varepsilon$ whose union covers $K$. Knowledge of the {\\em metric entropy}, i.e., the asymptotic behaviour of covering numbers for (families of) metric spaces is important in many areas of mathematics (geometry, functional analysis, probability, coding theory, to name a few). In this paper we give asymptotically correct estimates for covering numbers for a large class of homogeneous spaces of unitary (or orthogonal) groups wit"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"math/9701213","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/math/9701213/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":"math/9701213","created_at":"2026-07-04T15:51:30.529454+00:00"},{"alias_kind":"arxiv_version","alias_value":"math/9701213v1","created_at":"2026-07-04T15:51:30.529454+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.math/9701213","created_at":"2026-07-04T15:51:30.529454+00:00"},{"alias_kind":"pith_short_12","alias_value":"QFLCXRVDRIBW","created_at":"2026-07-04T15:51:30.529454+00:00"},{"alias_kind":"pith_short_16","alias_value":"QFLCXRVDRIBWLBCT","created_at":"2026-07-04T15:51:30.529454+00:00"},{"alias_kind":"pith_short_8","alias_value":"QFLCXRVD","created_at":"2026-07-04T15:51:30.529454+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":3,"sample":[{"citing_arxiv_id":"2512.20599","citing_title":"Random Stinespring superchannel: converting channel queries into dilation isometry queries","ref_index":33,"is_internal_anchor":true},{"citing_arxiv_id":"2502.04437","citing_title":"Tripartite Haar random state has no bipartite entanglement","ref_index":38,"is_internal_anchor":true},{"citing_arxiv_id":"2605.18598","citing_title":"Pointwise Generalization in Deep Neural Networks","ref_index":45,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U","json":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U.json","graph_json":"https://pith.science/api/pith-number/QFLCXRVDRIBWLBCTSDY4VPW32U/graph.json","events_json":"https://pith.science/api/pith-number/QFLCXRVDRIBWLBCTSDY4VPW32U/events.json","paper":"https://pith.science/paper/QFLCXRVD"},"agent_actions":{"view_html":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U","download_json":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U.json","view_paper":"https://pith.science/paper/QFLCXRVD","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=math/9701213&json=true","fetch_graph":"https://pith.science/api/pith-number/QFLCXRVDRIBWLBCTSDY4VPW32U/graph.json","fetch_events":"https://pith.science/api/pith-number/QFLCXRVDRIBWLBCTSDY4VPW32U/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U/action/timestamp_anchor","attest_storage":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U/action/storage_attestation","attest_author":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U/action/author_attestation","sign_citation":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U/action/citation_signature","submit_replication":"https://pith.science/pith/QFLCXRVDRIBWLBCTSDY4VPW32U/action/replication_record"}},"created_at":"2026-07-04T15:51:30.529454+00:00","updated_at":"2026-07-04T15:51:30.529454+00:00"}