{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:FUDHBWHBR53UZ4DFL2FYYYLPJY","short_pith_number":"pith:FUDHBWHB","schema_version":"1.0","canonical_sha256":"2d0670d8e18f774cf0655e8b8c616f4e14559c7fd09315de2a0e82f929ef66be","source":{"kind":"arxiv","id":"1407.7269","version":1},"attestation_state":"computed","paper":{"title":"Faster and Simpler Sketches of Valuation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Keren Cohavi, Shahar Dobzinski","submitted_at":"2014-07-27T18:15:23Z","abstract_excerpt":"We present fast algorithms for sketching valuation functions. Let $N$ ($|N|=n$) be some ground set and $v:2^N\\rightarrow \\mathbb R$ be a function. We say that $\\tilde v:2^N\\rightarrow \\mathbb R$ is an $\\alpha$-sketch of $v$ if for every set $S$ we have that $\\frac {v(S)} {\\alpha} \\leq \\tilde v(S) \\leq v(S)$ and $\\tilde v$ can be described in $poly(n)$ bits.\n  Goemans et al. [SODA'09] showed that if $v$ is submodular then there exists an $\\tilde O(\\sqrt n)$-sketch that can be constructed using polynomially many value queries (this is the best possible, as Balcan and Harvey [STOC'11] show that n"},"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":"1407.7269","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.GT","submitted_at":"2014-07-27T18:15:23Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"7942d53616739dded9f00e5a0bbb07a496078c99df460364a4c57a5091f5cda6","abstract_canon_sha256":"d8a99e0376e06042f9635b30bc39776cc95536eb25dae96b52ecbdeeec5a5661"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:46:23.479073Z","signature_b64":"PvQxCIihFDVVoFlZW0xdsnUMIYAunEOKD3Uvw2/b3ifdb2TlMdKkihydCeoxdKvHWh27gL7Je1jik0c2Jnj2DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2d0670d8e18f774cf0655e8b8c616f4e14559c7fd09315de2a0e82f929ef66be","last_reissued_at":"2026-05-18T02:46:23.478658Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:46:23.478658Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Faster and Simpler Sketches of Valuation Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.GT","authors_text":"Keren Cohavi, Shahar Dobzinski","submitted_at":"2014-07-27T18:15:23Z","abstract_excerpt":"We present fast algorithms for sketching valuation functions. Let $N$ ($|N|=n$) be some ground set and $v:2^N\\rightarrow \\mathbb R$ be a function. We say that $\\tilde v:2^N\\rightarrow \\mathbb R$ is an $\\alpha$-sketch of $v$ if for every set $S$ we have that $\\frac {v(S)} {\\alpha} \\leq \\tilde v(S) \\leq v(S)$ and $\\tilde v$ can be described in $poly(n)$ bits.\n  Goemans et al. [SODA'09] showed that if $v$ is submodular then there exists an $\\tilde O(\\sqrt n)$-sketch that can be constructed using polynomially many value queries (this is the best possible, as Balcan and Harvey [STOC'11] show that n"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1407.7269","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1407.7269","created_at":"2026-05-18T02:46:23.478717+00:00"},{"alias_kind":"arxiv_version","alias_value":"1407.7269v1","created_at":"2026-05-18T02:46:23.478717+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1407.7269","created_at":"2026-05-18T02:46:23.478717+00:00"},{"alias_kind":"pith_short_12","alias_value":"FUDHBWHBR53U","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_16","alias_value":"FUDHBWHBR53UZ4DF","created_at":"2026-05-18T12:28:28.263976+00:00"},{"alias_kind":"pith_short_8","alias_value":"FUDHBWHB","created_at":"2026-05-18T12:28:28.263976+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/FUDHBWHBR53UZ4DFL2FYYYLPJY","json":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY.json","graph_json":"https://pith.science/api/pith-number/FUDHBWHBR53UZ4DFL2FYYYLPJY/graph.json","events_json":"https://pith.science/api/pith-number/FUDHBWHBR53UZ4DFL2FYYYLPJY/events.json","paper":"https://pith.science/paper/FUDHBWHB"},"agent_actions":{"view_html":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY","download_json":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY.json","view_paper":"https://pith.science/paper/FUDHBWHB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1407.7269&json=true","fetch_graph":"https://pith.science/api/pith-number/FUDHBWHBR53UZ4DFL2FYYYLPJY/graph.json","fetch_events":"https://pith.science/api/pith-number/FUDHBWHBR53UZ4DFL2FYYYLPJY/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY/action/timestamp_anchor","attest_storage":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY/action/storage_attestation","attest_author":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY/action/author_attestation","sign_citation":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY/action/citation_signature","submit_replication":"https://pith.science/pith/FUDHBWHBR53UZ4DFL2FYYYLPJY/action/replication_record"}},"created_at":"2026-05-18T02:46:23.478717+00:00","updated_at":"2026-05-18T02:46:23.478717+00:00"}