{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2013:HZ6HLVH7PGMNCOENDKSRIYXFNH","short_pith_number":"pith:HZ6HLVH7","canonical_record":{"source":{"id":"1311.4728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T13:04:46Z","cross_cats_sorted":[],"title_canon_sha256":"6cfdd9acf045b7fed3bd7404d57246748b3e128fc0e1fd4abb2b91f25bf87f9d","abstract_canon_sha256":"001fb76c56609fee83e02502c4e7ede641e8e0235e2dce0c1d324769de6750ce"},"schema_version":"1.0"},"canonical_sha256":"3e7c75d4ff7998d1388d1aa51462e569d4e62ff9b37c6653b36a53a37364599c","source":{"kind":"arxiv","id":"1311.4728","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4728","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4728v3","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4728","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"HZ6HLVH7PGMN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HZ6HLVH7PGMNCOEN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HZ6HLVH7","created_at":"2026-05-18T12:27:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2013:HZ6HLVH7PGMNCOENDKSRIYXFNH","target":"record","payload":{"canonical_record":{"source":{"id":"1311.4728","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T13:04:46Z","cross_cats_sorted":[],"title_canon_sha256":"6cfdd9acf045b7fed3bd7404d57246748b3e128fc0e1fd4abb2b91f25bf87f9d","abstract_canon_sha256":"001fb76c56609fee83e02502c4e7ede641e8e0235e2dce0c1d324769de6750ce"},"schema_version":"1.0"},"canonical_sha256":"3e7c75d4ff7998d1388d1aa51462e569d4e62ff9b37c6653b36a53a37364599c","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:31:30.122103Z","signature_b64":"PsbroBi49hjTkKmNHVyFZzW3YtX1pTx9LxGybKBMXXaF140ZFoj6OnQmSzYlz9gN6sjS2H0BRET+55n71/96Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3e7c75d4ff7998d1388d1aa51462e569d4e62ff9b37c6653b36a53a37364599c","last_reissued_at":"2026-05-18T02:31:30.121606Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:31:30.121606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1311.4728","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-18T02:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cgCeLs82vR7dQxeKtO5ko2DaF1rV96EsXqqgCyYdUjC7kPLHlco5aj6r5GLKFPA9mES+7Q+eOYucjbcdD7IZCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:16:12.721476Z"},"content_sha256":"25d4bc0503b3e21adf3cfeca766dd1115df3a26f1213f165a2ecad646c49f8cc","schema_version":"1.0","event_id":"sha256:25d4bc0503b3e21adf3cfeca766dd1115df3a26f1213f165a2ecad646c49f8cc"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2013:HZ6HLVH7PGMNCOENDKSRIYXFNH","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal approximation for submodular and supermodular optimization with bounded curvature","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Jan Vondr\\'ak, Justin Ward, Maxim Sviridenko","submitted_at":"2013-11-19T13:04:46Z","abstract_excerpt":"We design new approximation algorithms for the problems of optimizing submodular and supermodular functions subject to a single matroid constraint. Specifically, we consider the case in which we wish to maximize a nondecreasing submodular function or minimize a nonincreasing supermodular function in the setting of bounded total curvature $c$. In the case of submodular maximization with curvature $c$, we obtain a $(1-c/e)$-approximation --- the first improvement over the greedy $(1-e^{-c})/c$-approximation of Conforti and Cornuejols from 1984, which holds for a cardinality constraint, as well a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4728","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-18T02:31:30Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"zqA3lwMkp/MKCLUCvqG3pm51v1s3fd5DnTG7m/M3sypRvTSRuLeWwk9N/h0EJumys+TOBJb2YXfPFhLvPbyPAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-06T04:16:12.722187Z"},"content_sha256":"c6e257004e7c16e0a517d45d09d8fc40f69052cb99789b76ad674b3512d1b7cf","schema_version":"1.0","event_id":"sha256:c6e257004e7c16e0a517d45d09d8fc40f69052cb99789b76ad674b3512d1b7cf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HZ6HLVH7PGMNCOENDKSRIYXFNH/bundle.json","state_url":"https://pith.science/pith/HZ6HLVH7PGMNCOENDKSRIYXFNH/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HZ6HLVH7PGMNCOENDKSRIYXFNH/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-06-06T04:16:12Z","links":{"resolver":"https://pith.science/pith/HZ6HLVH7PGMNCOENDKSRIYXFNH","bundle":"https://pith.science/pith/HZ6HLVH7PGMNCOENDKSRIYXFNH/bundle.json","state":"https://pith.science/pith/HZ6HLVH7PGMNCOENDKSRIYXFNH/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HZ6HLVH7PGMNCOENDKSRIYXFNH/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2013:HZ6HLVH7PGMNCOENDKSRIYXFNH","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":"001fb76c56609fee83e02502c4e7ede641e8e0235e2dce0c1d324769de6750ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T13:04:46Z","title_canon_sha256":"6cfdd9acf045b7fed3bd7404d57246748b3e128fc0e1fd4abb2b91f25bf87f9d"},"schema_version":"1.0","source":{"id":"1311.4728","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1311.4728","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"arxiv_version","alias_value":"1311.4728v3","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1311.4728","created_at":"2026-05-18T02:31:30Z"},{"alias_kind":"pith_short_12","alias_value":"HZ6HLVH7PGMN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_16","alias_value":"HZ6HLVH7PGMNCOEN","created_at":"2026-05-18T12:27:46Z"},{"alias_kind":"pith_short_8","alias_value":"HZ6HLVH7","created_at":"2026-05-18T12:27:46Z"}],"graph_snapshots":[{"event_id":"sha256:c6e257004e7c16e0a517d45d09d8fc40f69052cb99789b76ad674b3512d1b7cf","target":"graph","created_at":"2026-05-18T02:31:30Z","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 design new approximation algorithms for the problems of optimizing submodular and supermodular functions subject to a single matroid constraint. Specifically, we consider the case in which we wish to maximize a nondecreasing submodular function or minimize a nonincreasing supermodular function in the setting of bounded total curvature $c$. In the case of submodular maximization with curvature $c$, we obtain a $(1-c/e)$-approximation --- the first improvement over the greedy $(1-e^{-c})/c$-approximation of Conforti and Cornuejols from 1984, which holds for a cardinality constraint, as well a","authors_text":"Jan Vondr\\'ak, Justin Ward, Maxim Sviridenko","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T13:04:46Z","title":"Optimal approximation for submodular and supermodular optimization with bounded curvature"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1311.4728","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:25d4bc0503b3e21adf3cfeca766dd1115df3a26f1213f165a2ecad646c49f8cc","target":"record","created_at":"2026-05-18T02:31:30Z","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":"001fb76c56609fee83e02502c4e7ede641e8e0235e2dce0c1d324769de6750ce","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2013-11-19T13:04:46Z","title_canon_sha256":"6cfdd9acf045b7fed3bd7404d57246748b3e128fc0e1fd4abb2b91f25bf87f9d"},"schema_version":"1.0","source":{"id":"1311.4728","kind":"arxiv","version":3}},"canonical_sha256":"3e7c75d4ff7998d1388d1aa51462e569d4e62ff9b37c6653b36a53a37364599c","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3e7c75d4ff7998d1388d1aa51462e569d4e62ff9b37c6653b36a53a37364599c","first_computed_at":"2026-05-18T02:31:30.121606Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:31:30.121606Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PsbroBi49hjTkKmNHVyFZzW3YtX1pTx9LxGybKBMXXaF140ZFoj6OnQmSzYlz9gN6sjS2H0BRET+55n71/96Dw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:31:30.122103Z","signed_message":"canonical_sha256_bytes"},"source_id":"1311.4728","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:25d4bc0503b3e21adf3cfeca766dd1115df3a26f1213f165a2ecad646c49f8cc","sha256:c6e257004e7c16e0a517d45d09d8fc40f69052cb99789b76ad674b3512d1b7cf"],"state_sha256":"04cb9593c5ac33a9dd756eb1ccea675025a8233e675d0a76d33223002089aa3d"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"b0d9nUqA7SPMtGc90+NQOaqDtPchfmxIq/Ta+0W6Qe79cDS0cDwT381tXi7uW2j+doi2dD7sDXd8HWwhgsGWAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-06T04:16:12.724918Z","bundle_sha256":"fca7f1a601012bb76c340ce904b66cc4f8821d360a3770b875c8ed01cc354467"}}