{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:KGQH2SMR3WZQYMZBZWTUAFEM4M","short_pith_number":"pith:KGQH2SMR","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"},"canonical_sha256":"51a07d4991ddb30c3321cda740148ce3170cecd37364f160f7b50bb08d3f4c91","source":{"kind":"arxiv","id":"1812.05930","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05930","created_at":"2026-05-17T23:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05930v1","created_at":"2026-05-17T23:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05930","created_at":"2026-05-17T23:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"KGQH2SMR3WZQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KGQH2SMR3WZQYMZB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KGQH2SMR","created_at":"2026-05-18T12:32:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:KGQH2SMR3WZQYMZBZWTUAFEM4M","target":"record","payload":{"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"},"canonical_sha256":"51a07d4991ddb30c3321cda740148ce3170cecd37364f160f7b50bb08d3f4c91","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"},"source_kind":"arxiv","source_id":"1812.05930","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"BsFzvH+Yinw8+vhz1Q6142SEpONrw4QxzS+rUh+XFzl4MCYA4SloLc1Zju2g1YGUNkWVo6GybIPzsKrQTYrvDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:02.153685Z"},"content_sha256":"c60e6c7723cfe63af7483c3d98bfd18186cf4275accf9cd8d290a57eb1a2f146","schema_version":"1.0","event_id":"sha256:c60e6c7723cfe63af7483c3d98bfd18186cf4275accf9cd8d290a57eb1a2f146"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:KGQH2SMR3WZQYMZBZWTUAFEM4M","target":"graph","payload":{"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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-05-17T23:58:17Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"srcQIaef78lKL16OwJyFOn7vZWEFBC88P7oC7zseYLnFjA1lGBGstJA1VmR3tdnEQSUiYqv0YiqiGe6BtScFCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-11T22:08:02.154462Z"},"content_sha256":"ff32523a62d2e26ed0a9106a20c9ad02929f4c5e32d8f2a7734e860df2a29a60","schema_version":"1.0","event_id":"sha256:ff32523a62d2e26ed0a9106a20c9ad02929f4c5e32d8f2a7734e860df2a29a60"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/bundle.json","state_url":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-06-11T22:08:02Z","links":{"resolver":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M","bundle":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/bundle.json","state":"https://pith.science/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/state.json","well_known_bundle":"https://pith.science/.well-known/pith/KGQH2SMR3WZQYMZBZWTUAFEM4M/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:KGQH2SMR3WZQYMZBZWTUAFEM4M","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"6fb91f7375564391a1891ec080b6cf6c673d9ec29506ecf13e4782c167d718d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T13:48:25Z","title_canon_sha256":"2692ddad8acbe9f47fb1e9b669f1fd955257491eead3ad108cd7296d0c6d7434"},"schema_version":"1.0","source":{"id":"1812.05930","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.05930","created_at":"2026-05-17T23:58:17Z"},{"alias_kind":"arxiv_version","alias_value":"1812.05930v1","created_at":"2026-05-17T23:58:17Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.05930","created_at":"2026-05-17T23:58:17Z"},{"alias_kind":"pith_short_12","alias_value":"KGQH2SMR3WZQ","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_16","alias_value":"KGQH2SMR3WZQYMZB","created_at":"2026-05-18T12:32:33Z"},{"alias_kind":"pith_short_8","alias_value":"KGQH2SMR","created_at":"2026-05-18T12:32:33Z"}],"graph_snapshots":[{"event_id":"sha256:ff32523a62d2e26ed0a9106a20c9ad02929f4c5e32d8f2a7734e860df2a29a60","target":"graph","created_at":"2026-05-17T23:58:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"paper":{"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","authors_text":"Dieter Rautenbach, Julien Baste, Maximilian F\\\"urst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T13:48:25Z","title":"Linear programming based approximation for unweighted induced matchings --- breaking the $\\Delta$ barrier"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.05930","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:c60e6c7723cfe63af7483c3d98bfd18186cf4275accf9cd8d290a57eb1a2f146","target":"record","created_at":"2026-05-17T23:58:17Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"6fb91f7375564391a1891ec080b6cf6c673d9ec29506ecf13e4782c167d718d2","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-14T13:48:25Z","title_canon_sha256":"2692ddad8acbe9f47fb1e9b669f1fd955257491eead3ad108cd7296d0c6d7434"},"schema_version":"1.0","source":{"id":"1812.05930","kind":"arxiv","version":1}},"canonical_sha256":"51a07d4991ddb30c3321cda740148ce3170cecd37364f160f7b50bb08d3f4c91","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"51a07d4991ddb30c3321cda740148ce3170cecd37364f160f7b50bb08d3f4c91","first_computed_at":"2026-05-17T23:58:17.773640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:58:17.773640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"x8ohr9h3gcKkKfUpXthLDvzFQklOdHYbh3ZeQ2dr6366cCKA7W7XAg68Q6WX55iMZrMw4e9ZZFI3SVlJ+YDhAg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:58:17.774284Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.05930","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c60e6c7723cfe63af7483c3d98bfd18186cf4275accf9cd8d290a57eb1a2f146","sha256:ff32523a62d2e26ed0a9106a20c9ad02929f4c5e32d8f2a7734e860df2a29a60"],"state_sha256":"5659ecc15ff5f8c3c06d65865994befa19e87fc89528e1382344dddc554750ff"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"vr4mU72eGXW7A+zwwdXioZckJvBFG0qQJlz7WkAQEHdbtgn+dwYvkKdh0gSTk8OfyVWY/to9EViDdk/DZO7ADg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-11T22:08:02.158514Z","bundle_sha256":"94f69d077dd56f536f8f64468fe5adc42f7402209ebae45104f0e542650e0ad8"}}