{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:NVSSHNZOOSJSZKAPBSOZUYCDGR","short_pith_number":"pith:NVSSHNZO","canonical_record":{"source":{"id":"1204.0147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-31T23:25:53Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"79658311572703f13134121404779a2644cd83208dd17f2f0729a19c938c866c","abstract_canon_sha256":"376d3b3897e5ad77c5c9944a5a4ddf27f753923fb3d2f101b7f3b61bf2248fcf"},"schema_version":"1.0"},"canonical_sha256":"6d6523b72e74932ca80f0c9d9a60433477d3cf89cf90652b3918e5b857fc872b","source":{"kind":"arxiv","id":"1204.0147","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0147","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0147v1","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0147","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"NVSSHNZOOSJS","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NVSSHNZOOSJSZKAP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NVSSHNZO","created_at":"2026-05-18T12:27:16Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:NVSSHNZOOSJSZKAPBSOZUYCDGR","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0147","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-31T23:25:53Z","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"title_canon_sha256":"79658311572703f13134121404779a2644cd83208dd17f2f0729a19c938c866c","abstract_canon_sha256":"376d3b3897e5ad77c5c9944a5a4ddf27f753923fb3d2f101b7f3b61bf2248fcf"},"schema_version":"1.0"},"canonical_sha256":"6d6523b72e74932ca80f0c9d9a60433477d3cf89cf90652b3918e5b857fc872b","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:50.237154Z","signature_b64":"48ZJ6C0PQdYVXZ/9cwuictFhF8k+IlQWdFMNJUjpf7frvIpClykGN/kSN4dsoHVxBGwG24gWjPu+RQMD8v9bCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6d6523b72e74932ca80f0c9d9a60433477d3cf89cf90652b3918e5b857fc872b","last_reissued_at":"2026-05-18T03:58:50.236587Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:50.236587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0147","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PJ619S7ifU+v5MaKDFVMT+jPwL4XH4oM1qhFdB841m71VQZ8pDAqgt6b1s78IbJnyn1C4GyW+3OvHNMOKrTjCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:28.371562Z"},"content_sha256":"ea635ddfe245e86f638d26e011ad94355e1c401b950c886843ab273a08b0d7eb","schema_version":"1.0","event_id":"sha256:ea635ddfe245e86f638d26e011ad94355e1c401b950c886843ab273a08b0d7eb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:NVSSHNZOOSJSZKAPBSOZUYCDGR","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Covering Numbers for Convex Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"primary_cat":"cs.IT","authors_text":"Adityanand Guntuboyina, Bodhisattva Sen","submitted_at":"2012-03-31T23:25:53Z","abstract_excerpt":"In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\\epsilon$-covering number of $\\C([a, b]^d, B)$, in the $L_p$-metric, $1 \\le p < \\infty$, in terms of the relevant constants, where $d \\geq 1$, $a < b \\in \\mathbb{R}$, $B>0$, and $\\C([a,b]^d, B)$ denotes the set of all convex functions on $[a, b]^d$ that are uniformly bounded by $B$. We summarize previously known results on covering numbers for convex functions and also provide alternate proofs of some known results. Our results h"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0147","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":""},"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-18T03:58:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SOnYNOJUAVsFOIN2526nQb3Q7PLdMQQMQvze46We4IIbhF8g5wMJrY0iTmxEdDuX5SmtFW4rI5mf+CBUsc3+Bw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T01:09:28.371907Z"},"content_sha256":"40994ec3a730a2b81a8b4d986d24dc2f6337fda5359e2706dbf4aea1ba0c65da","schema_version":"1.0","event_id":"sha256:40994ec3a730a2b81a8b4d986d24dc2f6337fda5359e2706dbf4aea1ba0c65da"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/NVSSHNZOOSJSZKAPBSOZUYCDGR/bundle.json","state_url":"https://pith.science/pith/NVSSHNZOOSJSZKAPBSOZUYCDGR/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/NVSSHNZOOSJSZKAPBSOZUYCDGR/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-05-30T01:09:28Z","links":{"resolver":"https://pith.science/pith/NVSSHNZOOSJSZKAPBSOZUYCDGR","bundle":"https://pith.science/pith/NVSSHNZOOSJSZKAPBSOZUYCDGR/bundle.json","state":"https://pith.science/pith/NVSSHNZOOSJSZKAPBSOZUYCDGR/state.json","well_known_bundle":"https://pith.science/.well-known/pith/NVSSHNZOOSJSZKAPBSOZUYCDGR/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:NVSSHNZOOSJSZKAPBSOZUYCDGR","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"376d3b3897e5ad77c5c9944a5a4ddf27f753923fb3d2f101b7f3b61bf2248fcf","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-31T23:25:53Z","title_canon_sha256":"79658311572703f13134121404779a2644cd83208dd17f2f0729a19c938c866c"},"schema_version":"1.0","source":{"id":"1204.0147","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0147","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0147v1","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0147","created_at":"2026-05-18T03:58:50Z"},{"alias_kind":"pith_short_12","alias_value":"NVSSHNZOOSJS","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_16","alias_value":"NVSSHNZOOSJSZKAP","created_at":"2026-05-18T12:27:16Z"},{"alias_kind":"pith_short_8","alias_value":"NVSSHNZO","created_at":"2026-05-18T12:27:16Z"}],"graph_snapshots":[{"event_id":"sha256:40994ec3a730a2b81a8b4d986d24dc2f6337fda5359e2706dbf4aea1ba0c65da","target":"graph","created_at":"2026-05-18T03:58:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"abstract_excerpt":"In this paper we study the covering numbers of the space of convex and uniformly bounded functions in multi-dimension. We find optimal upper and lower bounds for the $\\epsilon$-covering number of $\\C([a, b]^d, B)$, in the $L_p$-metric, $1 \\le p < \\infty$, in terms of the relevant constants, where $d \\geq 1$, $a < b \\in \\mathbb{R}$, $B>0$, and $\\C([a,b]^d, B)$ denotes the set of all convex functions on $[a, b]^d$ that are uniformly bounded by $B$. We summarize previously known results on covering numbers for convex functions and also provide alternate proofs of some known results. Our results h","authors_text":"Adityanand Guntuboyina, Bodhisattva Sen","cross_cats":["math.IT","math.ST","stat.ML","stat.TH"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-31T23:25:53Z","title":"Covering Numbers for Convex Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0147","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:ea635ddfe245e86f638d26e011ad94355e1c401b950c886843ab273a08b0d7eb","target":"record","created_at":"2026-05-18T03:58:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"376d3b3897e5ad77c5c9944a5a4ddf27f753923fb3d2f101b7f3b61bf2248fcf","cross_cats_sorted":["math.IT","math.ST","stat.ML","stat.TH"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.IT","submitted_at":"2012-03-31T23:25:53Z","title_canon_sha256":"79658311572703f13134121404779a2644cd83208dd17f2f0729a19c938c866c"},"schema_version":"1.0","source":{"id":"1204.0147","kind":"arxiv","version":1}},"canonical_sha256":"6d6523b72e74932ca80f0c9d9a60433477d3cf89cf90652b3918e5b857fc872b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"6d6523b72e74932ca80f0c9d9a60433477d3cf89cf90652b3918e5b857fc872b","first_computed_at":"2026-05-18T03:58:50.236587Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:58:50.236587Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"48ZJ6C0PQdYVXZ/9cwuictFhF8k+IlQWdFMNJUjpf7frvIpClykGN/kSN4dsoHVxBGwG24gWjPu+RQMD8v9bCQ==","signature_status":"signed_v1","signed_at":"2026-05-18T03:58:50.237154Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0147","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ea635ddfe245e86f638d26e011ad94355e1c401b950c886843ab273a08b0d7eb","sha256:40994ec3a730a2b81a8b4d986d24dc2f6337fda5359e2706dbf4aea1ba0c65da"],"state_sha256":"11dc19a3f8dab2999bdf713b41d2fd1070967f41044837a167e7e146c1ff00db"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"7uFa8sK70RXZXNfNVpRnL/YNleLyexZ2njvilNGLg3F26RQLV3PxCGC54aTQTD0ZX2K2O8rzLGaR6bkR6+B+BA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T01:09:28.374111Z","bundle_sha256":"6a607f067cc9623e838e3a085946eac18b4a5c934d41484248f248662882b0e5"}}