{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:PEVB2DA7I4XOBX2QGVDYOWL44B","short_pith_number":"pith:PEVB2DA7","schema_version":"1.0","canonical_sha256":"792a1d0c1f472ee0df50354787597ce0681fcb759e0b2c2812ccd64189a85332","source":{"kind":"arxiv","id":"1404.4702","version":3},"attestation_state":"computed","paper":{"title":"Tight Bounds on $\\ell_1$ Approximation and Learning of Self-Bounding Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Jan Vondr\\'ak, Pravesh Kothari, Vitaly Feldman","submitted_at":"2014-04-18T06:49:49Z","abstract_excerpt":"We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \\rightarrow \\mathbb{R}$ is self-bounding if for every $x \\in {0,1}^n$, $f(x)$ upper bounds the sum of all the $n$ marginal decreases in the value of the function at $x$. Self-bounding functions include such well-known classes of functions as submodular and fractionally-subadditive (XOS) functions. They were introduced by Boucheron et al. (2000) in the context of concentration of measure inequalities. Our main result"},"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":"1404.4702","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-18T06:49:49Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"8c8d1471825f287ba955e347a8591bdda1501fad5d6d319facc157ad41bc4946","abstract_canon_sha256":"9989e36ecde83381a12620d2b51fb590bfb7912523472de0280d22417757bbf7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:44:33.346720Z","signature_b64":"3wdHN6SO+zCD+wXjgMUPLczDeVSmoJ7YslGpqzbc8m3thyASlvihOyglxnADDdI0eUigQAKDj+HgasjPgMaJAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"792a1d0c1f472ee0df50354787597ce0681fcb759e0b2c2812ccd64189a85332","last_reissued_at":"2026-05-17T23:44:33.345914Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:44:33.345914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Tight Bounds on $\\ell_1$ Approximation and Learning of Self-Bounding Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.LG","authors_text":"Jan Vondr\\'ak, Pravesh Kothari, Vitaly Feldman","submitted_at":"2014-04-18T06:49:49Z","abstract_excerpt":"We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube ${0,1}^n$. Informally, a function $f:{0,1}^n \\rightarrow \\mathbb{R}$ is self-bounding if for every $x \\in {0,1}^n$, $f(x)$ upper bounds the sum of all the $n$ marginal decreases in the value of the function at $x$. Self-bounding functions include such well-known classes of functions as submodular and fractionally-subadditive (XOS) functions. They were introduced by Boucheron et al. (2000) in the context of concentration of measure inequalities. Our main result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4702","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":"1404.4702","created_at":"2026-05-17T23:44:33.346035+00:00"},{"alias_kind":"arxiv_version","alias_value":"1404.4702v3","created_at":"2026-05-17T23:44:33.346035+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4702","created_at":"2026-05-17T23:44:33.346035+00:00"},{"alias_kind":"pith_short_12","alias_value":"PEVB2DA7I4XO","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_16","alias_value":"PEVB2DA7I4XOBX2Q","created_at":"2026-05-18T12:28:43.426989+00:00"},{"alias_kind":"pith_short_8","alias_value":"PEVB2DA7","created_at":"2026-05-18T12:28:43.426989+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/PEVB2DA7I4XOBX2QGVDYOWL44B","json":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B.json","graph_json":"https://pith.science/api/pith-number/PEVB2DA7I4XOBX2QGVDYOWL44B/graph.json","events_json":"https://pith.science/api/pith-number/PEVB2DA7I4XOBX2QGVDYOWL44B/events.json","paper":"https://pith.science/paper/PEVB2DA7"},"agent_actions":{"view_html":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B","download_json":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B.json","view_paper":"https://pith.science/paper/PEVB2DA7","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1404.4702&json=true","fetch_graph":"https://pith.science/api/pith-number/PEVB2DA7I4XOBX2QGVDYOWL44B/graph.json","fetch_events":"https://pith.science/api/pith-number/PEVB2DA7I4XOBX2QGVDYOWL44B/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/action/timestamp_anchor","attest_storage":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/action/storage_attestation","attest_author":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/action/author_attestation","sign_citation":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/action/citation_signature","submit_replication":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/action/replication_record"}},"created_at":"2026-05-17T23:44:33.346035+00:00","updated_at":"2026-05-17T23:44:33.346035+00:00"}