{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:JOCPRUTOJNVZUFVRKZO33Z4K3Q","short_pith_number":"pith:JOCPRUTO","schema_version":"1.0","canonical_sha256":"4b84f8d26e4b6b9a16b1565dbde78adc2c766d3a6057f933265e41f6365920cd","source":{"kind":"arxiv","id":"1611.07866","version":1},"attestation_state":"computed","paper":{"title":"Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eden Chlamt\\'a\\v{c}, Michael Dinitz, Yury Makarychev","submitted_at":"2016-11-23T16:24:45Z","abstract_excerpt":"In the Minimum k-Union problem (MkU) we are given a set system with n sets and are asked to select k sets in order to minimize the size of their union. Despite being a very natural problem, it has received surprisingly little attention: the only known approximation algorithm is an $O(\\sqrt{n})$-approximation due to [Chlamt\\'a\\v{c} et al APPROX '16]. This problem can also be viewed as the bipartite version of the Small Set Vertex Expansion problem (SSVE), which we call the Small Set Bipartite Vertex Expansion problem (SSBVE). SSVE, in which we are asked to find a set of k nodes to minimize thei"},"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":"1611.07866","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2016-11-23T16:24:45Z","cross_cats_sorted":[],"title_canon_sha256":"e1f93faaa093e2b13ac289c8ab04e3b684c8c34459bc326c0459bb2de7d41c1c","abstract_canon_sha256":"caa922f6131305c5625b3812ea6a8cd5999e1321a4e2f89de95dd040c2f10331"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:59.652729Z","signature_b64":"NXhP6syt4uxfr5XWPtKDSYEPGONBSNJiKMNRYoDIhD5imWjBNZvXHbRrzzztoxuGWVw4VJ3rpSXBUu4CBZmNDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4b84f8d26e4b6b9a16b1565dbde78adc2c766d3a6057f933265e41f6365920cd","last_reissued_at":"2026-05-18T00:56:59.652234Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:59.652234Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Minimizing the Union: Tight Approximations for Small Set Bipartite Vertex Expansion","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Eden Chlamt\\'a\\v{c}, Michael Dinitz, Yury Makarychev","submitted_at":"2016-11-23T16:24:45Z","abstract_excerpt":"In the Minimum k-Union problem (MkU) we are given a set system with n sets and are asked to select k sets in order to minimize the size of their union. Despite being a very natural problem, it has received surprisingly little attention: the only known approximation algorithm is an $O(\\sqrt{n})$-approximation due to [Chlamt\\'a\\v{c} et al APPROX '16]. This problem can also be viewed as the bipartite version of the Small Set Vertex Expansion problem (SSVE), which we call the Small Set Bipartite Vertex Expansion problem (SSBVE). SSVE, in which we are asked to find a set of k nodes to minimize thei"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.07866","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":"1611.07866","created_at":"2026-05-18T00:56:59.652302+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.07866v1","created_at":"2026-05-18T00:56:59.652302+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.07866","created_at":"2026-05-18T00:56:59.652302+00:00"},{"alias_kind":"pith_short_12","alias_value":"JOCPRUTOJNVZ","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_16","alias_value":"JOCPRUTOJNVZUFVR","created_at":"2026-05-18T12:30:25.849896+00:00"},{"alias_kind":"pith_short_8","alias_value":"JOCPRUTO","created_at":"2026-05-18T12:30:25.849896+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/JOCPRUTOJNVZUFVRKZO33Z4K3Q","json":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q.json","graph_json":"https://pith.science/api/pith-number/JOCPRUTOJNVZUFVRKZO33Z4K3Q/graph.json","events_json":"https://pith.science/api/pith-number/JOCPRUTOJNVZUFVRKZO33Z4K3Q/events.json","paper":"https://pith.science/paper/JOCPRUTO"},"agent_actions":{"view_html":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q","download_json":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q.json","view_paper":"https://pith.science/paper/JOCPRUTO","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.07866&json=true","fetch_graph":"https://pith.science/api/pith-number/JOCPRUTOJNVZUFVRKZO33Z4K3Q/graph.json","fetch_events":"https://pith.science/api/pith-number/JOCPRUTOJNVZUFVRKZO33Z4K3Q/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q/action/timestamp_anchor","attest_storage":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q/action/storage_attestation","attest_author":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q/action/author_attestation","sign_citation":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q/action/citation_signature","submit_replication":"https://pith.science/pith/JOCPRUTOJNVZUFVRKZO33Z4K3Q/action/replication_record"}},"created_at":"2026-05-18T00:56:59.652302+00:00","updated_at":"2026-05-18T00:56:59.652302+00:00"}