{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:VUUEKND3CX4KMUIQIX7HC7B6AO","short_pith_number":"pith:VUUEKND3","schema_version":"1.0","canonical_sha256":"ad2845347b15f8a6511045fe717c3e0386b40b61128f99b6a7ca4896a8086e5b","source":{"kind":"arxiv","id":"1304.4948","version":1},"attestation_state":"computed","paper":{"title":"On the Approximation of Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankit Sharma, Mohit Singh, Nikhil R. Devanur, Roy Schwartz, Shaddin Dughmi","submitted_at":"2013-04-17T20:02:32Z","abstract_excerpt":"Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and these subclasses widely vary in their complexity. Our motivation is to understand the relative complexity of these classes of functions. Towards this, we consider the question of how well can one class of submodular functions be approximated by another (simpler) class of submodular functions. Such approximations naturally allow algorithms designed for the simple"},"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":"1304.4948","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-04-17T20:02:32Z","cross_cats_sorted":[],"title_canon_sha256":"6f2ba4ddff1a8e3a8c09d6d4b1e3291d2fd690245d0ce62eb0c48a3dc3570132","abstract_canon_sha256":"04e680be189a0706a7221177c590554362a2d5631b82ed437ad1677de6ca76f8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:27:42.172470Z","signature_b64":"cnk/oVQx/hpi/Tl2UyOKF3jVQUxdgZlqiCEVEv0o6XGrHlJXj8SYHSijOCIHv50u3NRbQzTPAJRBxkyw6dicCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ad2845347b15f8a6511045fe717c3e0386b40b61128f99b6a7ca4896a8086e5b","last_reissued_at":"2026-05-18T03:27:42.171720Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:27:42.171720Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the Approximation of Submodular Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Ankit Sharma, Mohit Singh, Nikhil R. Devanur, Roy Schwartz, Shaddin Dughmi","submitted_at":"2013-04-17T20:02:32Z","abstract_excerpt":"Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and these subclasses widely vary in their complexity. Our motivation is to understand the relative complexity of these classes of functions. Towards this, we consider the question of how well can one class of submodular functions be approximated by another (simpler) class of submodular functions. Such approximations naturally allow algorithms designed for the simple"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.4948","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":"1304.4948","created_at":"2026-05-18T03:27:42.171816+00:00"},{"alias_kind":"arxiv_version","alias_value":"1304.4948v1","created_at":"2026-05-18T03:27:42.171816+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1304.4948","created_at":"2026-05-18T03:27:42.171816+00:00"},{"alias_kind":"pith_short_12","alias_value":"VUUEKND3CX4K","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_16","alias_value":"VUUEKND3CX4KMUIQ","created_at":"2026-05-18T12:28:04.890932+00:00"},{"alias_kind":"pith_short_8","alias_value":"VUUEKND3","created_at":"2026-05-18T12:28:04.890932+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/VUUEKND3CX4KMUIQIX7HC7B6AO","json":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO.json","graph_json":"https://pith.science/api/pith-number/VUUEKND3CX4KMUIQIX7HC7B6AO/graph.json","events_json":"https://pith.science/api/pith-number/VUUEKND3CX4KMUIQIX7HC7B6AO/events.json","paper":"https://pith.science/paper/VUUEKND3"},"agent_actions":{"view_html":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO","download_json":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO.json","view_paper":"https://pith.science/paper/VUUEKND3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1304.4948&json=true","fetch_graph":"https://pith.science/api/pith-number/VUUEKND3CX4KMUIQIX7HC7B6AO/graph.json","fetch_events":"https://pith.science/api/pith-number/VUUEKND3CX4KMUIQIX7HC7B6AO/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO/action/timestamp_anchor","attest_storage":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO/action/storage_attestation","attest_author":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO/action/author_attestation","sign_citation":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO/action/citation_signature","submit_replication":"https://pith.science/pith/VUUEKND3CX4KMUIQIX7HC7B6AO/action/replication_record"}},"created_at":"2026-05-18T03:27:42.171816+00:00","updated_at":"2026-05-18T03:27:42.171816+00:00"}