{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2010:2HTNCC7UOH7LEUQ4RA4BEGD6UC","short_pith_number":"pith:2HTNCC7U","canonical_record":{"source":{"id":"1007.4152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-23T15:17:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2070ec3e863268ca8cf38eb9eaff37e8781d732894675bdef60c0d0107ad8d92","abstract_canon_sha256":"f4b5837b9c84a23e3baf7ee6ce2b28445cc37965602c377df6dc63b02437dec5"},"schema_version":"1.0"},"canonical_sha256":"d1e6d10bf471feb2521c883812187ea0ad28248537e139482d80a4a6f7f48e88","source":{"kind":"arxiv","id":"1007.4152","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4152","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4152v2","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4152","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"2HTNCC7UOH7L","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2HTNCC7UOH7LEUQ4","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2HTNCC7U","created_at":"2026-05-18T12:26:03Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2010:2HTNCC7UOH7LEUQ4RA4BEGD6UC","target":"record","payload":{"canonical_record":{"source":{"id":"1007.4152","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-23T15:17:57Z","cross_cats_sorted":["math.CO"],"title_canon_sha256":"2070ec3e863268ca8cf38eb9eaff37e8781d732894675bdef60c0d0107ad8d92","abstract_canon_sha256":"f4b5837b9c84a23e3baf7ee6ce2b28445cc37965602c377df6dc63b02437dec5"},"schema_version":"1.0"},"canonical_sha256":"d1e6d10bf471feb2521c883812187ea0ad28248537e139482d80a4a6f7f48e88","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:07:05.449006Z","signature_b64":"LQ/xpufz0agS4Dg/G5o0PyiaStsX1LBqa3n4GdJaln7hFKOHXXE7eUbjf0ZH/xESLlWYlXT7yNl2pToHJZtkAQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d1e6d10bf471feb2521c883812187ea0ad28248537e139482d80a4a6f7f48e88","last_reissued_at":"2026-05-18T04:07:05.448353Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:07:05.448353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1007.4152","source_version":2,"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:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Lnebjm6KRZgqjdM480LlscIEhWAAtVf/K0nwAKPGABPrbVL5u0lbICO++S34B+KT79+sj44if7V5nrip0/XQDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:24:10.193386Z"},"content_sha256":"ff0ba58fdc48dfe8df08445fa6904681aa15613f0418ca6339d227fbac5bd215","schema_version":"1.0","event_id":"sha256:ff0ba58fdc48dfe8df08445fa6904681aa15613f0418ca6339d227fbac5bd215"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2010:2HTNCC7UOH7LEUQ4RA4BEGD6UC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Approximation of a Maximum-Submodular-Coverage problem involving spectral functions, with application to Experimental Design","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.CO"],"primary_cat":"math.OC","authors_text":"Guillaume Sagnol","submitted_at":"2010-07-23T15:17:57Z","abstract_excerpt":"We study a family of combinatorial optimization problems defined by a parameter $p\\in[0,1]$, which involves spectral functions applied to positive semidefinite matrices, and has some application in the theory of optimal experimental design. This family of problems tends to a generalization of the classical maximum coverage problem as $p$ goes to 0, and to a trivial instance of the knapsack problem as $p$ goes to 1.\n  In this article, we establish a matrix inequality which shows that the objective function is submodular for all $p\\in[0,1]$, from which it follows that the greedy approach, which "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4152","kind":"arxiv","version":2},"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:07:05Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"XQvxn78/iL+DlobC64Cx5yCv00/XV/Wpw2nhf7iPf4USMk7j04xgL7V1RgGfig4CQD1gU070ZmRYMFx7QursDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T09:24:10.193739Z"},"content_sha256":"f0b98a116e54c32def232e84b5b2cd1d341b07a09f8e24a3c94763c4497fc214","schema_version":"1.0","event_id":"sha256:f0b98a116e54c32def232e84b5b2cd1d341b07a09f8e24a3c94763c4497fc214"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2HTNCC7UOH7LEUQ4RA4BEGD6UC/bundle.json","state_url":"https://pith.science/pith/2HTNCC7UOH7LEUQ4RA4BEGD6UC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2HTNCC7UOH7LEUQ4RA4BEGD6UC/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-28T09:24:10Z","links":{"resolver":"https://pith.science/pith/2HTNCC7UOH7LEUQ4RA4BEGD6UC","bundle":"https://pith.science/pith/2HTNCC7UOH7LEUQ4RA4BEGD6UC/bundle.json","state":"https://pith.science/pith/2HTNCC7UOH7LEUQ4RA4BEGD6UC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2HTNCC7UOH7LEUQ4RA4BEGD6UC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2010:2HTNCC7UOH7LEUQ4RA4BEGD6UC","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":"f4b5837b9c84a23e3baf7ee6ce2b28445cc37965602c377df6dc63b02437dec5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-23T15:17:57Z","title_canon_sha256":"2070ec3e863268ca8cf38eb9eaff37e8781d732894675bdef60c0d0107ad8d92"},"schema_version":"1.0","source":{"id":"1007.4152","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1007.4152","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"arxiv_version","alias_value":"1007.4152v2","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1007.4152","created_at":"2026-05-18T04:07:05Z"},{"alias_kind":"pith_short_12","alias_value":"2HTNCC7UOH7L","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_16","alias_value":"2HTNCC7UOH7LEUQ4","created_at":"2026-05-18T12:26:03Z"},{"alias_kind":"pith_short_8","alias_value":"2HTNCC7U","created_at":"2026-05-18T12:26:03Z"}],"graph_snapshots":[{"event_id":"sha256:f0b98a116e54c32def232e84b5b2cd1d341b07a09f8e24a3c94763c4497fc214","target":"graph","created_at":"2026-05-18T04:07:05Z","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 study a family of combinatorial optimization problems defined by a parameter $p\\in[0,1]$, which involves spectral functions applied to positive semidefinite matrices, and has some application in the theory of optimal experimental design. This family of problems tends to a generalization of the classical maximum coverage problem as $p$ goes to 0, and to a trivial instance of the knapsack problem as $p$ goes to 1.\n  In this article, we establish a matrix inequality which shows that the objective function is submodular for all $p\\in[0,1]$, from which it follows that the greedy approach, which ","authors_text":"Guillaume Sagnol","cross_cats":["math.CO"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-23T15:17:57Z","title":"Approximation of a Maximum-Submodular-Coverage problem involving spectral functions, with application to Experimental Design"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1007.4152","kind":"arxiv","version":2},"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:ff0ba58fdc48dfe8df08445fa6904681aa15613f0418ca6339d227fbac5bd215","target":"record","created_at":"2026-05-18T04:07:05Z","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":"f4b5837b9c84a23e3baf7ee6ce2b28445cc37965602c377df6dc63b02437dec5","cross_cats_sorted":["math.CO"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.OC","submitted_at":"2010-07-23T15:17:57Z","title_canon_sha256":"2070ec3e863268ca8cf38eb9eaff37e8781d732894675bdef60c0d0107ad8d92"},"schema_version":"1.0","source":{"id":"1007.4152","kind":"arxiv","version":2}},"canonical_sha256":"d1e6d10bf471feb2521c883812187ea0ad28248537e139482d80a4a6f7f48e88","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d1e6d10bf471feb2521c883812187ea0ad28248537e139482d80a4a6f7f48e88","first_computed_at":"2026-05-18T04:07:05.448353Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T04:07:05.448353Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"LQ/xpufz0agS4Dg/G5o0PyiaStsX1LBqa3n4GdJaln7hFKOHXXE7eUbjf0ZH/xESLlWYlXT7yNl2pToHJZtkAQ==","signature_status":"signed_v1","signed_at":"2026-05-18T04:07:05.449006Z","signed_message":"canonical_sha256_bytes"},"source_id":"1007.4152","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:ff0ba58fdc48dfe8df08445fa6904681aa15613f0418ca6339d227fbac5bd215","sha256:f0b98a116e54c32def232e84b5b2cd1d341b07a09f8e24a3c94763c4497fc214"],"state_sha256":"277a08d7d61798604e4c56f9474c7fa8856f9bccdf7019d2f88023e1b6d88776"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"uyjtZM3NAuc6FmxBIZJuAZOY/bQ3Sp4v79PgjBKIpa9NbHHGxn5lUOTPiYspNQV0eCpfOLvtfSyW1QSXhzNgBw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T09:24:10.195847Z","bundle_sha256":"369c45bcc858ac907cda42cd68fc1a25d30ffae782b7163d126a8bf295d264fd"}}