{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:KGQH2SMR3WZQYMZBZWTUAFEM4M","short_pith_number":"pith:KGQH2SMR","schema_version":"1.0","canonical_sha256":"51a07d4991ddb30c3321cda740148ce3170cecd37364f160f7b50bb08d3f4c91","source":{"kind":"arxiv","id":"1812.05930","version":1},"attestation_state":"computed","paper":{"title":"Linear programming based approximation for unweighted induced matchings --- breaking the $\\Delta$ barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Julien Baste, Maximilian F\\\"urst","submitted_at":"2018-12-14T13:48:25Z","abstract_excerpt":"A matching in a graph is induced if no two of its edges are joined by an edge, and finding a large induced matching is a very hard problem. Lin et al. (Approximating weighted induced matchings, Discrete Applied Mathematics 243 (2018) 304-310) provide an approximation algorithm with ratio $\\Delta$ for the weighted version of the induced matching problem on graphs of maximum degree $\\Delta$. Their approach is based on an integer linear programming formulation whose integrality gap is at least $\\Delta-1$, that is, their approach offers only little room for improvement in the weighted case. For th"},"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":"1812.05930","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T13:48:25Z","cross_cats_sorted":[],"title_canon_sha256":"2692ddad8acbe9f47fb1e9b669f1fd955257491eead3ad108cd7296d0c6d7434","abstract_canon_sha256":"6fb91f7375564391a1891ec080b6cf6c673d9ec29506ecf13e4782c167d718d2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:58:17.774284Z","signature_b64":"x8ohr9h3gcKkKfUpXthLDvzFQklOdHYbh3ZeQ2dr6366cCKA7W7XAg68Q6WX55iMZrMw4e9ZZFI3SVlJ+YDhAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"51a07d4991ddb30c3321cda740148ce3170cecd37364f160f7b50bb08d3f4c91","last_reissued_at":"2026-05-17T23:58:17.773640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:58:17.773640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Linear programming based approximation for unweighted induced matchings --- breaking the $\\Delta$ barrier","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Julien Baste, Maximilian F\\\"urst","submitted_at":"2018-12-14T13:48:25Z","abstract_excerpt":"A matching in a graph is induced if no two of its edges are joined by an edge, and finding a large induced matching is a very hard problem. Lin et al. (Approximating weighted induced matchings, Discrete Applied Mathematics 243 (2018) 304-310) provide an approximation algorithm with ratio $\\Delta$ for the weighted version of the induced matching problem on graphs of maximum degree $\\Delta$. Their approach is based on an integer linear programming formulation whose integrality gap is at least $\\Delta-1$, that is, their approach offers only little room for improvement in the weighted case. For th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05930","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":"1812.05930","created_at":"2026-05-17T23:58:17.773722+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.05930v1","created_at":"2026-05-17T23:58:17.773722+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05930","created_at":"2026-05-17T23:58:17.773722+00:00"},{"alias_kind":"pith_short_12","alias_value":"KGQH2SMR3WZQ","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_16","alias_value":"KGQH2SMR3WZQYMZB","created_at":"2026-05-18T12:32:33.847187+00:00"},{"alias_kind":"pith_short_8","alias_value":"KGQH2SMR","created_at":"2026-05-18T12:32:33.847187+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/KGQH2SMR3WZQYMZBZWTUAFEM4M","json":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M.json","graph_json":"https://pith.science/api/pith-number/KGQH2SMR3WZQYMZBZWTUAFEM4M/graph.json","events_json":"https://pith.science/api/pith-number/KGQH2SMR3WZQYMZBZWTUAFEM4M/events.json","paper":"https://pith.science/paper/KGQH2SMR"},"agent_actions":{"view_html":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M","download_json":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M.json","view_paper":"https://pith.science/paper/KGQH2SMR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.05930&json=true","fetch_graph":"https://pith.science/api/pith-number/KGQH2SMR3WZQYMZBZWTUAFEM4M/graph.json","fetch_events":"https://pith.science/api/pith-number/KGQH2SMR3WZQYMZBZWTUAFEM4M/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/action/timestamp_anchor","attest_storage":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/action/storage_attestation","attest_author":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/action/author_attestation","sign_citation":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/action/citation_signature","submit_replication":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/action/replication_record"}},"created_at":"2026-05-17T23:58:17.773722+00:00","updated_at":"2026-05-17T23:58:17.773722+00:00"}