{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MWLLLYCVVX4WJETTF4AJPWGZPE","short_pith_number":"pith:MWLLLYCV","schema_version":"1.0","canonical_sha256":"6596b5e055adf96492732f0097d8d97903b2a88542d7f92dae12942624d72a54","source":{"kind":"arxiv","id":"1710.06339","version":1},"attestation_state":"computed","paper":{"title":"Understanding the Correlation Gap for Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Euiwoong Lee, Guru Guruganesh","submitted_at":"2017-10-17T15:14:44Z","abstract_excerpt":"Given a set of vertices $V$ with $|V| = n$, a weight vector $w \\in (\\mathbb{R}^+ \\cup \\{ 0 \\})^{\\binom{V}{2}}$, and a probability vector $x \\in [0, 1]^{\\binom{V}{2}}$ in the matching polytope, we study the quantity $\\frac{E_{G}[ \\nu_w(G)]}{\\sum_{(u, v) \\in \\binom{V}{2}} w_{u, v} x_{u, v}}$ where $G$ is a random graph where each edge $e$ with weight $w_e$ appears with probability $x_e$ independently, and let $\\nu_w(G)$ denotes the weight of the maximum matching of $G$. This quantity is closely related to correlation gap and contention resolution schemes, which are important tools in the design "},"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":"1710.06339","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DS","submitted_at":"2017-10-17T15:14:44Z","cross_cats_sorted":[],"title_canon_sha256":"e29845818dfebe7ba48e3149a0d4bc63a4729c7f7751f3c20e357523bb448d7a","abstract_canon_sha256":"33997824a9b49bbd66494036aed2d2b574ef6ba13f872d0da3a94f6417056dfe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:32:37.062606Z","signature_b64":"2lavefP88+aqLQX3bQP87Ig8+R99KXKMfXRHc6g/DPbjpZl+L5SC9POokhHeTxfd6jJwKZt/wFiCkQ87tGAkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"6596b5e055adf96492732f0097d8d97903b2a88542d7f92dae12942624d72a54","last_reissued_at":"2026-05-18T00:32:37.061908Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:32:37.061908Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Understanding the Correlation Gap for Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Euiwoong Lee, Guru Guruganesh","submitted_at":"2017-10-17T15:14:44Z","abstract_excerpt":"Given a set of vertices $V$ with $|V| = n$, a weight vector $w \\in (\\mathbb{R}^+ \\cup \\{ 0 \\})^{\\binom{V}{2}}$, and a probability vector $x \\in [0, 1]^{\\binom{V}{2}}$ in the matching polytope, we study the quantity $\\frac{E_{G}[ \\nu_w(G)]}{\\sum_{(u, v) \\in \\binom{V}{2}} w_{u, v} x_{u, v}}$ where $G$ is a random graph where each edge $e$ with weight $w_e$ appears with probability $x_e$ independently, and let $\\nu_w(G)$ denotes the weight of the maximum matching of $G$. This quantity is closely related to correlation gap and contention resolution schemes, which are important tools in the design "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1710.06339","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":"1710.06339","created_at":"2026-05-18T00:32:37.062011+00:00"},{"alias_kind":"arxiv_version","alias_value":"1710.06339v1","created_at":"2026-05-18T00:32:37.062011+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1710.06339","created_at":"2026-05-18T00:32:37.062011+00:00"},{"alias_kind":"pith_short_12","alias_value":"MWLLLYCVVX4W","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MWLLLYCVVX4WJETT","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MWLLLYCV","created_at":"2026-05-18T12:31:31.346846+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2106.06892","citing_title":"Improved Guarantees for Offline Stochastic Matching via New Ordered Contention Resolution Schemes","ref_index":20,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE","json":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE.json","graph_json":"https://pith.science/api/pith-number/MWLLLYCVVX4WJETTF4AJPWGZPE/graph.json","events_json":"https://pith.science/api/pith-number/MWLLLYCVVX4WJETTF4AJPWGZPE/events.json","paper":"https://pith.science/paper/MWLLLYCV"},"agent_actions":{"view_html":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE","download_json":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE.json","view_paper":"https://pith.science/paper/MWLLLYCV","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1710.06339&json=true","fetch_graph":"https://pith.science/api/pith-number/MWLLLYCVVX4WJETTF4AJPWGZPE/graph.json","fetch_events":"https://pith.science/api/pith-number/MWLLLYCVVX4WJETTF4AJPWGZPE/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE/action/storage_attestation","attest_author":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE/action/author_attestation","sign_citation":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE/action/citation_signature","submit_replication":"https://pith.science/pith/MWLLLYCVVX4WJETTF4AJPWGZPE/action/replication_record"}},"created_at":"2026-05-18T00:32:37.062011+00:00","updated_at":"2026-05-18T00:32:37.062011+00:00"}