{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2009:DOQ6YGTWNEUSVTE3ASVHGWNTIG","short_pith_number":"pith:DOQ6YGTW","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"},"canonical_sha256":"1ba1ec1a7669292acc9b04aa7359b341b84f9fb7e427b71425ca9a367245ee3f","source":{"kind":"arxiv","id":"0912.0322","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0322","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0322v4","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0322","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"DOQ6YGTWNEUS","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DOQ6YGTWNEUSVTE3","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DOQ6YGTW","created_at":"2026-05-18T12:25:59Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2009:DOQ6YGTWNEUSVTE3ASVHGWNTIG","target":"record","payload":{"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"},"canonical_sha256":"1ba1ec1a7669292acc9b04aa7359b341b84f9fb7e427b71425ca9a367245ee3f","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"},"source_kind":"arxiv","source_id":"0912.0322","source_version":4,"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-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JvzhsF1+3Oj105xpkLKs2FFPQuUh8KhI5sbKJuem0xQZhMrbcsC4VENZt2gUO2SYZqD3lAXS4ZA30oz4d+V2Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:02:34.015345Z"},"content_sha256":"759d705945447ed924874bdb72b0a262500c7dbe4aafc36d84363ba449e306c7","schema_version":"1.0","event_id":"sha256:759d705945447ed924874bdb72b0a262500c7dbe4aafc36d84363ba449e306c7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2009:DOQ6YGTWNEUSVTE3ASVHGWNTIG","target":"graph","payload":{"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"},"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-18T04:09:35Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"krHFl1mG1ualTZ+WyZn2GUIq5YWONaIrfc5aO84x8k4S4m5Sxdg93wIcjxlQpAaS12jTTNPxmyz10+MDETkmDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T06:02:34.016049Z"},"content_sha256":"c56d5134026e006e8440376f37f74cd82531ae4b81d1e4da3e56275c1231298e","schema_version":"1.0","event_id":"sha256:c56d5134026e006e8440376f37f74cd82531ae4b81d1e4da3e56275c1231298e"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/bundle.json","state_url":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/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-26T06:02:34Z","links":{"resolver":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG","bundle":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/bundle.json","state":"https://pith.science/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DOQ6YGTWNEUSVTE3ASVHGWNTIG/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2009:DOQ6YGTWNEUSVTE3ASVHGWNTIG","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":"b40fdc6c62f8339b3b3d4d3ffa0d7e8842b52c8343d326a484fd129523dcd354","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-02T02:02:27Z","title_canon_sha256":"9f229b826a05ae517715ba218ae542fb55c3d52cda3a6f0a9b1797f718187dcd"},"schema_version":"1.0","source":{"id":"0912.0322","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"0912.0322","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"arxiv_version","alias_value":"0912.0322v4","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.0912.0322","created_at":"2026-05-18T04:09:35Z"},{"alias_kind":"pith_short_12","alias_value":"DOQ6YGTWNEUS","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_16","alias_value":"DOQ6YGTWNEUSVTE3","created_at":"2026-05-18T12:25:59Z"},{"alias_kind":"pith_short_8","alias_value":"DOQ6YGTW","created_at":"2026-05-18T12:25:59Z"}],"graph_snapshots":[{"event_id":"sha256:c56d5134026e006e8440376f37f74cd82531ae4b81d1e4da3e56275c1231298e","target":"graph","created_at":"2026-05-18T04:09:35Z","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":"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 ","authors_text":"Shaddin Dughmi","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-02T02:02:27Z","title":"Submodular Functions: Extensions, Distributions, and Algorithms. A Survey"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"0912.0322","kind":"arxiv","version":4},"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:759d705945447ed924874bdb72b0a262500c7dbe4aafc36d84363ba449e306c7","target":"record","created_at":"2026-05-18T04:09:35Z","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":"b40fdc6c62f8339b3b3d4d3ffa0d7e8842b52c8343d326a484fd129523dcd354","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2009-12-02T02:02:27Z","title_canon_sha256":"9f229b826a05ae517715ba218ae542fb55c3d52cda3a6f0a9b1797f718187dcd"},"schema_version":"1.0","source":{"id":"0912.0322","kind":"arxiv","version":4}},"canonical_sha256":"1ba1ec1a7669292acc9b04aa7359b341b84f9fb7e427b71425ca9a367245ee3f","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ba1ec1a7669292acc9b04aa7359b341b84f9fb7e427b71425ca9a367245ee3f","first_computed_at":"2026-05-18T04:09:35.275614Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:09:35.275614Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"D8zLh1yIDyFmC6qzPU6xKp2YV9No51Qba2lztECTCKVw9FhhKHz8PFxhu/fY5IWiHbPhufuy+4MrgdIpx7BrBQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:09:35.276066Z","signed_message":"canonical_sha256_bytes"},"source_id":"0912.0322","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:759d705945447ed924874bdb72b0a262500c7dbe4aafc36d84363ba449e306c7","sha256:c56d5134026e006e8440376f37f74cd82531ae4b81d1e4da3e56275c1231298e"],"state_sha256":"2ed5602461a4ccd606277e6a3490a9257e5e6edddb8bde8b2a38df97cddfadb5"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"6fnKhoApaBi7Le81PJ9WYawCwM/CV3vUcSC/FuXaLEmilYID2XLcKpkxpIXgtn3bxrWOyt9yuo+EqErgby5CDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T06:02:34.020185Z","bundle_sha256":"acb9d178f8baac1f9be8319f4a2eae640c72e44ccc4426dcddcd98e54044259e"}}