{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:4QEMK6TBSHELSUKSIIQ2LK3A4A","short_pith_number":"pith:4QEMK6TB","schema_version":"1.0","canonical_sha256":"e408c57a6191c8b951524221a5ab60e02471571496e7f61dabbf258c9400d2f5","source":{"kind":"arxiv","id":"1801.07937","version":3},"attestation_state":"computed","paper":{"title":"Integrality Gaps for Colorful Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Georgios Stamoulis, Steven Kelk","submitted_at":"2018-01-24T11:44:12Z","abstract_excerpt":"We study the integrality gap of the natural linear programming relaxation for the \\textit{Bounded Color Matching} (BCM) problem. We provide several families of instances and establish lower bounds on their integrality gaps and we study how the Sherali-Adams \"lift-and-project\" technique behaves on these instances. We complement these results by showing that if we exclude certain simple sub-structures from our input graphs, then the integrality gap of the natural linear formulation strictly improves. To prove this, we adapt for our purposes the results of F\\\"{u}redi [\\emph{Combinatorica}, 1(2):1"},"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":"1801.07937","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.DM","submitted_at":"2018-01-24T11:44:12Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"20809be29c7d1c6a1a5aa4e45bd9bcbac59914e4fa8e1d1693d03a213477d763","abstract_canon_sha256":"5beb7402d3b5c36afbe0987dd35054b7bfd3b040abb9f3b6226e07f67c03a049"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:56:30.055702Z","signature_b64":"7A+AaDEiyCSDIFa/GedvYwAyoNOdz5v9pRLZ4aSLPK12WgU9d9JUzo4iw1yJOlCJ/SLmfWBJ/bzwbT3wj+DSBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e408c57a6191c8b951524221a5ab60e02471571496e7f61dabbf258c9400d2f5","last_reissued_at":"2026-05-17T23:56:30.055291Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:56:30.055291Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Integrality Gaps for Colorful Matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"cs.DM","authors_text":"Georgios Stamoulis, Steven Kelk","submitted_at":"2018-01-24T11:44:12Z","abstract_excerpt":"We study the integrality gap of the natural linear programming relaxation for the \\textit{Bounded Color Matching} (BCM) problem. We provide several families of instances and establish lower bounds on their integrality gaps and we study how the Sherali-Adams \"lift-and-project\" technique behaves on these instances. We complement these results by showing that if we exclude certain simple sub-structures from our input graphs, then the integrality gap of the natural linear formulation strictly improves. To prove this, we adapt for our purposes the results of F\\\"{u}redi [\\emph{Combinatorica}, 1(2):1"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1801.07937","kind":"arxiv","version":3},"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":"1801.07937","created_at":"2026-05-17T23:56:30.055364+00:00"},{"alias_kind":"arxiv_version","alias_value":"1801.07937v3","created_at":"2026-05-17T23:56:30.055364+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1801.07937","created_at":"2026-05-17T23:56:30.055364+00:00"},{"alias_kind":"pith_short_12","alias_value":"4QEMK6TBSHEL","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_16","alias_value":"4QEMK6TBSHELSUKS","created_at":"2026-05-18T12:32:05.422762+00:00"},{"alias_kind":"pith_short_8","alias_value":"4QEMK6TB","created_at":"2026-05-18T12:32:05.422762+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/4QEMK6TBSHELSUKSIIQ2LK3A4A","json":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A.json","graph_json":"https://pith.science/api/pith-number/4QEMK6TBSHELSUKSIIQ2LK3A4A/graph.json","events_json":"https://pith.science/api/pith-number/4QEMK6TBSHELSUKSIIQ2LK3A4A/events.json","paper":"https://pith.science/paper/4QEMK6TB"},"agent_actions":{"view_html":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A","download_json":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A.json","view_paper":"https://pith.science/paper/4QEMK6TB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1801.07937&json=true","fetch_graph":"https://pith.science/api/pith-number/4QEMK6TBSHELSUKSIIQ2LK3A4A/graph.json","fetch_events":"https://pith.science/api/pith-number/4QEMK6TBSHELSUKSIIQ2LK3A4A/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A/action/storage_attestation","attest_author":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A/action/author_attestation","sign_citation":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A/action/citation_signature","submit_replication":"https://pith.science/pith/4QEMK6TBSHELSUKSIIQ2LK3A4A/action/replication_record"}},"created_at":"2026-05-17T23:56:30.055364+00:00","updated_at":"2026-05-17T23:56:30.055364+00:00"}