{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2025:DTNDIZWTDRX6GRLJ2VDL7Y2H6O","short_pith_number":"pith:DTNDIZWT","canonical_record":{"source":{"id":"2507.10248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-14T13:14:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1a820ed550edce07a3189241c2fd3250412919c1a32c550d5e054c1b11f40401","abstract_canon_sha256":"6bf83c0ae3e82d7b1e9ec1bc22735b42d0cbdcdf715fca35b132492648d714ef"},"schema_version":"1.0"},"canonical_sha256":"1cda3466d31c6fe34569d546bfe347f398b215b52116914988f1d6395c8e3d03","source":{"kind":"arxiv","id":"2507.10248","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10248","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10248v1","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10248","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"DTNDIZWTDRX6","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"pith_short_16","alias_value":"DTNDIZWTDRX6GRLJ","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"pith_short_8","alias_value":"DTNDIZWT","created_at":"2026-07-05T11:36:47Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2025:DTNDIZWTDRX6GRLJ2VDL7Y2H6O","target":"record","payload":{"canonical_record":{"source":{"id":"2507.10248","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-14T13:14:45Z","cross_cats_sorted":["cs.DM"],"title_canon_sha256":"1a820ed550edce07a3189241c2fd3250412919c1a32c550d5e054c1b11f40401","abstract_canon_sha256":"6bf83c0ae3e82d7b1e9ec1bc22735b42d0cbdcdf715fca35b132492648d714ef"},"schema_version":"1.0"},"canonical_sha256":"1cda3466d31c6fe34569d546bfe347f398b215b52116914988f1d6395c8e3d03","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:36:47.758213Z","signature_b64":"1b39KhBpWO4PN7lK1iUAVglk8KOiWZ1ufeh9HTrVHA7HFmOcCkFUXeJEDFIAHS/m5PQ7QKdVFEQiFrBw+CAxBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1cda3466d31c6fe34569d546bfe347f398b215b52116914988f1d6395c8e3d03","last_reissued_at":"2026-07-05T11:36:47.757459Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:36:47.757459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2507.10248","source_version":1,"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-07-05T11:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nMyYzagwzwn8NivH83RIYZt6tARQ9sgSMHBCBnf9BH8VouDyes6eFyKt7tjSllskWaZbkZhwUu5b8ixGe34TAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:00:44.251130Z"},"content_sha256":"bbf3dca339ec684fbaa90296683f827ecf196219b624934af9c5a080f661ba57","schema_version":"1.0","event_id":"sha256:bbf3dca339ec684fbaa90296683f827ecf196219b624934af9c5a080f661ba57"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2025:DTNDIZWTDRX6GRLJ2VDL7Y2H6O","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Bicriteria Submodular Maximization","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"Alan Kuhnle, Moran Feldman","submitted_at":"2025-07-14T13:14:45Z","abstract_excerpt":"Submodular functions and their optimization have found applications in diverse settings ranging from machine learning and data mining to game theory and economics. In this work, we consider the constrained maximization of a submodular function, for which we conduct a principled study of bicriteria approximation algorithms -- algorithms which can violate the constraint, but only up to a bounded factor. Bicrteria optimization allows constrained submodular maximization to capture additional important settings, such as the well-studied submodular cover problem and optimization under soft constrain"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10248","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2507.10248/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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-07-05T11:36:47Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"5sZbVdGTQE7rYvmYM6cebI6BPP9AjYzsy3nQcFsyJZONm19V24NA6TcLSP8LTsIbp7ZIgkVM92jmdRhkfpqVBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T21:00:44.251656Z"},"content_sha256":"824b43fae92494bb7ae12a4332848b739f86345f88e6b5d11219ad65b5f9fe94","schema_version":"1.0","event_id":"sha256:824b43fae92494bb7ae12a4332848b739f86345f88e6b5d11219ad65b5f9fe94"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/DTNDIZWTDRX6GRLJ2VDL7Y2H6O/bundle.json","state_url":"https://pith.science/pith/DTNDIZWTDRX6GRLJ2VDL7Y2H6O/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/DTNDIZWTDRX6GRLJ2VDL7Y2H6O/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-08-15T21:00:44Z","links":{"resolver":"https://pith.science/pith/DTNDIZWTDRX6GRLJ2VDL7Y2H6O","bundle":"https://pith.science/pith/DTNDIZWTDRX6GRLJ2VDL7Y2H6O/bundle.json","state":"https://pith.science/pith/DTNDIZWTDRX6GRLJ2VDL7Y2H6O/state.json","well_known_bundle":"https://pith.science/.well-known/pith/DTNDIZWTDRX6GRLJ2VDL7Y2H6O/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2025:DTNDIZWTDRX6GRLJ2VDL7Y2H6O","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":"6bf83c0ae3e82d7b1e9ec1bc22735b42d0cbdcdf715fca35b132492648d714ef","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-14T13:14:45Z","title_canon_sha256":"1a820ed550edce07a3189241c2fd3250412919c1a32c550d5e054c1b11f40401"},"schema_version":"1.0","source":{"id":"2507.10248","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2507.10248","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"arxiv_version","alias_value":"2507.10248v1","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.10248","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"pith_short_12","alias_value":"DTNDIZWTDRX6","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"pith_short_16","alias_value":"DTNDIZWTDRX6GRLJ","created_at":"2026-07-05T11:36:47Z"},{"alias_kind":"pith_short_8","alias_value":"DTNDIZWT","created_at":"2026-07-05T11:36:47Z"}],"graph_snapshots":[{"event_id":"sha256:824b43fae92494bb7ae12a4332848b739f86345f88e6b5d11219ad65b5f9fe94","target":"graph","created_at":"2026-07-05T11:36:47Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2507.10248/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Submodular functions and their optimization have found applications in diverse settings ranging from machine learning and data mining to game theory and economics. In this work, we consider the constrained maximization of a submodular function, for which we conduct a principled study of bicriteria approximation algorithms -- algorithms which can violate the constraint, but only up to a bounded factor. Bicrteria optimization allows constrained submodular maximization to capture additional important settings, such as the well-studied submodular cover problem and optimization under soft constrain","authors_text":"Alan Kuhnle, Moran Feldman","cross_cats":["cs.DM"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-14T13:14:45Z","title":"Bicriteria Submodular Maximization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.10248","kind":"arxiv","version":1},"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:bbf3dca339ec684fbaa90296683f827ecf196219b624934af9c5a080f661ba57","target":"record","created_at":"2026-07-05T11:36:47Z","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":"6bf83c0ae3e82d7b1e9ec1bc22735b42d0cbdcdf715fca35b132492648d714ef","cross_cats_sorted":["cs.DM"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2025-07-14T13:14:45Z","title_canon_sha256":"1a820ed550edce07a3189241c2fd3250412919c1a32c550d5e054c1b11f40401"},"schema_version":"1.0","source":{"id":"2507.10248","kind":"arxiv","version":1}},"canonical_sha256":"1cda3466d31c6fe34569d546bfe347f398b215b52116914988f1d6395c8e3d03","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1cda3466d31c6fe34569d546bfe347f398b215b52116914988f1d6395c8e3d03","first_computed_at":"2026-07-05T11:36:47.757459Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T11:36:47.757459Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"1b39KhBpWO4PN7lK1iUAVglk8KOiWZ1ufeh9HTrVHA7HFmOcCkFUXeJEDFIAHS/m5PQ7QKdVFEQiFrBw+CAxBw==","signature_status":"signed_v1","signed_at":"2026-07-05T11:36:47.758213Z","signed_message":"canonical_sha256_bytes"},"source_id":"2507.10248","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:bbf3dca339ec684fbaa90296683f827ecf196219b624934af9c5a080f661ba57","sha256:824b43fae92494bb7ae12a4332848b739f86345f88e6b5d11219ad65b5f9fe94"],"state_sha256":"7f2d138b1c32f229cbd5346b27a8b70e21e8b9295f34d9d34bbd82b3032879f3"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3/y4S7oPyEFsfwXH1U+bP14oD1f6Hy1x+TeG6FfRXux7g50RNx2DAFAkbwLLmRe6FtB03DH2ksPSZfMuOwZBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T21:00:44.257920Z","bundle_sha256":"9250aff2884ed71a44d243596d4c58dd129391c6470bdccf8ed3a4d4be87414e"}}