{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2009:DOQ6YGTWNEUSVTE3ASVHGWNTIG","short_pith_number":"pith:DOQ6YGTW","schema_version":"1.0","canonical_sha256":"1ba1ec1a7669292acc9b04aa7359b341b84f9fb7e427b71425ca9a367245ee3f","source":{"kind":"arxiv","id":"0912.0322","version":4},"attestation_state":"computed","paper":{"title":"Submodular Functions: Extensions, Distributions, and Algorithms. A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shaddin Dughmi","submitted_at":"2009-12-02T02:02:27Z","abstract_excerpt":"Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of work has been concerned with maximizing or minimizing a submodular function, often subject to combinatorial constraints. Many of these algorithmic results exhibit a common structure. Namely, the function is extended to a continuous, usually non-linear, function on a convex domain. Then, this relaxation is solved, and the fractional solution rounded to yield an "},"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":"0912.0322","kind":"arxiv","version":4},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-02T02:02:27Z","cross_cats_sorted":[],"title_canon_sha256":"9f229b826a05ae517715ba218ae542fb55c3d52cda3a6f0a9b1797f718187dcd","abstract_canon_sha256":"b40fdc6c62f8339b3b3d4d3ffa0d7e8842b52c8343d326a484fd129523dcd354"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:09:35.276066Z","signature_b64":"D8zLh1yIDyFmC6qzPU6xKp2YV9No51Qba2lztECTCKVw9FhhKHz8PFxhu/fY5IWiHbPhufuy+4MrgdIpx7BrBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ba1ec1a7669292acc9b04aa7359b341b84f9fb7e427b71425ca9a367245ee3f","last_reissued_at":"2026-05-18T04:09:35.275614Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:09:35.275614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Submodular Functions: Extensions, Distributions, and Algorithms. A Survey","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Shaddin Dughmi","submitted_at":"2009-12-02T02:02:27Z","abstract_excerpt":"Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of work has been concerned with maximizing or minimizing a submodular function, often subject to combinatorial constraints. Many of these algorithmic results exhibit a common structure. Namely, the function is extended to a continuous, usually non-linear, function on a convex domain. Then, this relaxation is solved, and the fractional solution rounded to yield an "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0322","kind":"arxiv","version":4},"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":"0912.0322","created_at":"2026-05-18T04:09:35.275681+00:00"},{"alias_kind":"arxiv_version","alias_value":"0912.0322v4","created_at":"2026-05-18T04:09:35.275681+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0322","created_at":"2026-05-18T04:09:35.275681+00:00"},{"alias_kind":"pith_short_12","alias_value":"DOQ6YGTWNEUS","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_16","alias_value":"DOQ6YGTWNEUSVTE3","created_at":"2026-05-18T12:25:59.703012+00:00"},{"alias_kind":"pith_short_8","alias_value":"DOQ6YGTW","created_at":"2026-05-18T12:25:59.703012+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.04425","citing_title":"Joint Semantic Token Selection and Prompt Optimization for Interpretable Prompt Learning","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG","json":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG.json","graph_json":"https://pith.science/api/pith-number/DOQ6YGTWNEUSVTE3ASVHGWNTIG/graph.json","events_json":"https://pith.science/api/pith-number/DOQ6YGTWNEUSVTE3ASVHGWNTIG/events.json","paper":"https://pith.science/paper/DOQ6YGTW"},"agent_actions":{"view_html":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG","download_json":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG.json","view_paper":"https://pith.science/paper/DOQ6YGTW","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=0912.0322&json=true","fetch_graph":"https://pith.science/api/pith-number/DOQ6YGTWNEUSVTE3ASVHGWNTIG/graph.json","fetch_events":"https://pith.science/api/pith-number/DOQ6YGTWNEUSVTE3ASVHGWNTIG/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/action/storage_attestation","attest_author":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/action/author_attestation","sign_citation":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/action/citation_signature","submit_replication":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/action/replication_record"}},"created_at":"2026-05-18T04:09:35.275681+00:00","updated_at":"2026-05-18T04:09:35.275681+00:00"}