{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2014:PEVB2DA7I4XOBX2QGVDYOWL44B","short_pith_number":"pith:PEVB2DA7","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"},"canonical_sha256":"792a1d0c1f472ee0df50354787597ce0681fcb759e0b2c2812ccd64189a85332","source":{"kind":"arxiv","id":"1404.4702","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4702","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4702v3","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4702","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"PEVB2DA7I4XO","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PEVB2DA7I4XOBX2Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PEVB2DA7","created_at":"2026-05-18T12:28:43Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2014:PEVB2DA7I4XOBX2QGVDYOWL44B","target":"record","payload":{"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"},"canonical_sha256":"792a1d0c1f472ee0df50354787597ce0681fcb759e0b2c2812ccd64189a85332","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"},"source_kind":"arxiv","source_id":"1404.4702","source_version":3,"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-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"SgKZD9vqNTzULgM5CDwrDzvr7/DGt4sJgIL/qDdGKJFlileS6+2RcTYO/HqQiTTPbdLcg4gemJgAe4E77nrEDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:07:00.782671Z"},"content_sha256":"1a6c633c8de6c03f993410dbda73364cdb98550e26e27ab30d797d723a3b9068","schema_version":"1.0","event_id":"sha256:1a6c633c8de6c03f993410dbda73364cdb98550e26e27ab30d797d723a3b9068"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2014:PEVB2DA7I4XOBX2QGVDYOWL44B","target":"graph","payload":{"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"},"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-17T23:44:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MI+8X+QbYqOLj10DbLITaQ6sZdA3d6r32nXSYWNgDJn9SGRlTrwocjLzIXeMAn9Qb9ZwYDFM35i+uocqsmpADg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-27T13:07:00.783349Z"},"content_sha256":"aaba194154be23f2e9ef098bfbb09c10fa67c08f2ff1779d68e21413d082822a","schema_version":"1.0","event_id":"sha256:aaba194154be23f2e9ef098bfbb09c10fa67c08f2ff1779d68e21413d082822a"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/bundle.json","state_url":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/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-27T13:07:00Z","links":{"resolver":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B","bundle":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/bundle.json","state":"https://pith.science/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/state.json","well_known_bundle":"https://pith.science/.well-known/pith/PEVB2DA7I4XOBX2QGVDYOWL44B/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2014:PEVB2DA7I4XOBX2QGVDYOWL44B","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":"9989e36ecde83381a12620d2b51fb590bfb7912523472de0280d22417757bbf7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-18T06:49:49Z","title_canon_sha256":"8c8d1471825f287ba955e347a8591bdda1501fad5d6d319facc157ad41bc4946"},"schema_version":"1.0","source":{"id":"1404.4702","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1404.4702","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"arxiv_version","alias_value":"1404.4702v3","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1404.4702","created_at":"2026-05-17T23:44:33Z"},{"alias_kind":"pith_short_12","alias_value":"PEVB2DA7I4XO","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_16","alias_value":"PEVB2DA7I4XOBX2Q","created_at":"2026-05-18T12:28:43Z"},{"alias_kind":"pith_short_8","alias_value":"PEVB2DA7","created_at":"2026-05-18T12:28:43Z"}],"graph_snapshots":[{"event_id":"sha256:aaba194154be23f2e9ef098bfbb09c10fa67c08f2ff1779d68e21413d082822a","target":"graph","created_at":"2026-05-17T23:44:33Z","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":"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","authors_text":"Jan Vondr\\'ak, Pravesh Kothari, Vitaly Feldman","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-18T06:49:49Z","title":"Tight Bounds on $\\ell_1$ Approximation and Learning of Self-Bounding Functions"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1404.4702","kind":"arxiv","version":3},"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:1a6c633c8de6c03f993410dbda73364cdb98550e26e27ab30d797d723a3b9068","target":"record","created_at":"2026-05-17T23:44:33Z","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":"9989e36ecde83381a12620d2b51fb590bfb7912523472de0280d22417757bbf7","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.LG","submitted_at":"2014-04-18T06:49:49Z","title_canon_sha256":"8c8d1471825f287ba955e347a8591bdda1501fad5d6d319facc157ad41bc4946"},"schema_version":"1.0","source":{"id":"1404.4702","kind":"arxiv","version":3}},"canonical_sha256":"792a1d0c1f472ee0df50354787597ce0681fcb759e0b2c2812ccd64189a85332","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"792a1d0c1f472ee0df50354787597ce0681fcb759e0b2c2812ccd64189a85332","first_computed_at":"2026-05-17T23:44:33.345914Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:44:33.345914Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"3wdHN6SO+zCD+wXjgMUPLczDeVSmoJ7YslGpqzbc8m3thyASlvihOyglxnADDdI0eUigQAKDj+HgasjPgMaJAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:44:33.346720Z","signed_message":"canonical_sha256_bytes"},"source_id":"1404.4702","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:1a6c633c8de6c03f993410dbda73364cdb98550e26e27ab30d797d723a3b9068","sha256:aaba194154be23f2e9ef098bfbb09c10fa67c08f2ff1779d68e21413d082822a"],"state_sha256":"2860e1f36ec6532364ccb981858ec4f572d87591a9e0ea67cf984e4bf92711a1"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"x60Ch3YWjqsAgz4u1xFgheKc1+xjAo6aApohDJ5NDlvFlb0eP+7iIVURbXg7IX0/+0RezOVX3RGsIoNuoeFnAw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-27T13:07:00.787437Z","bundle_sha256":"24b8e80b15524b719c1e8374ced8b55630604e1924883b66fcc2b013ee39c4d4"}}