{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:EXEXSTII7B5HCMUTPOYBMGX4GE","short_pith_number":"pith:EXEXSTII","schema_version":"1.0","canonical_sha256":"25c9794d08f87a7132937bb0161afc312cc161e873429495658f882941767dd5","source":{"kind":"arxiv","id":"1907.07230","version":1},"attestation_state":"computed","paper":{"title":"The Complexity of Partial Function Extension for Coverage Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Gunjan Kumar, Umang Bhaskar","submitted_at":"2019-07-16T19:39:55Z","abstract_excerpt":"Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the complexity of partial function extension to coverage functions. That is, given a partial function consisting of a family of subsets of $[m]$ and a value at each point, does there exist a coverage function defined on all subsets of $[m]$ that extends this partial function? Partial function extension is previously studied for other function classes, including boolean functions and convex functions, and is useful in many "},"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":"1907.07230","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2019-07-16T19:39:55Z","cross_cats_sorted":["cs.GT"],"title_canon_sha256":"8e6044dbed0152204ee75c86ae3c9ad97223520ab6a814b8ee8b91789fd57aa1","abstract_canon_sha256":"eccfcf26dfbe60cead34ac061194cf3b7b38c0d26ba4c02d68b501f54bd45e3e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:40:27.373408Z","signature_b64":"+KVklkKkJEMjo705zSbnKQ3qs2ok4JI9lsda7ExZQB6bWPuJmF7vOE4fURR3h+5GgmRQCTOYnDfpg0XBVCJ6Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"25c9794d08f87a7132937bb0161afc312cc161e873429495658f882941767dd5","last_reissued_at":"2026-05-17T23:40:27.372799Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:40:27.372799Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"The Complexity of Partial Function Extension for Coverage Functions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.GT"],"primary_cat":"cs.DS","authors_text":"Gunjan Kumar, Umang Bhaskar","submitted_at":"2019-07-16T19:39:55Z","abstract_excerpt":"Coverage functions are an important subclass of submodular functions, finding applications in machine learning, game theory, social networks, and facility location. We study the complexity of partial function extension to coverage functions. That is, given a partial function consisting of a family of subsets of $[m]$ and a value at each point, does there exist a coverage function defined on all subsets of $[m]$ that extends this partial function? Partial function extension is previously studied for other function classes, including boolean functions and convex functions, and is useful in many "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1907.07230","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":""},"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":"1907.07230","created_at":"2026-05-17T23:40:27.372889+00:00"},{"alias_kind":"arxiv_version","alias_value":"1907.07230v1","created_at":"2026-05-17T23:40:27.372889+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1907.07230","created_at":"2026-05-17T23:40:27.372889+00:00"},{"alias_kind":"pith_short_12","alias_value":"EXEXSTII7B5H","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_16","alias_value":"EXEXSTII7B5HCMUT","created_at":"2026-05-18T12:33:15.570797+00:00"},{"alias_kind":"pith_short_8","alias_value":"EXEXSTII","created_at":"2026-05-18T12:33:15.570797+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE","json":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE.json","graph_json":"https://pith.science/api/pith-number/EXEXSTII7B5HCMUTPOYBMGX4GE/graph.json","events_json":"https://pith.science/api/pith-number/EXEXSTII7B5HCMUTPOYBMGX4GE/events.json","paper":"https://pith.science/paper/EXEXSTII"},"agent_actions":{"view_html":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE","download_json":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE.json","view_paper":"https://pith.science/paper/EXEXSTII","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1907.07230&json=true","fetch_graph":"https://pith.science/api/pith-number/EXEXSTII7B5HCMUTPOYBMGX4GE/graph.json","fetch_events":"https://pith.science/api/pith-number/EXEXSTII7B5HCMUTPOYBMGX4GE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE/action/storage_attestation","attest_author":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE/action/author_attestation","sign_citation":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE/action/citation_signature","submit_replication":"https://pith.science/pith/EXEXSTII7B5HCMUTPOYBMGX4GE/action/replication_record"}},"created_at":"2026-05-17T23:40:27.372889+00:00","updated_at":"2026-05-17T23:40:27.372889+00:00"}