{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HQ6YTOZWSB2IXG3B5XYU7XG2ZV","short_pith_number":"pith:HQ6YTOZW","canonical_record":{"source":{"id":"1811.08506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-20T22:04:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"98643544af9e30cc32523fda65f9dfcfc5598838c179c234066277ebfa6bebb3","abstract_canon_sha256":"3830bfb101c8942425d8442234c50914c12172c2a2d3e93c09285073fcc649e1"},"schema_version":"1.0"},"canonical_sha256":"3c3d89bb3690748b9b61edf14fdcdacd53993fd726ad171cda1d5b5777533f99","source":{"kind":"arxiv","id":"1811.08506","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08506","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08506v1","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08506","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"HQ6YTOZWSB2I","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HQ6YTOZWSB2IXG3B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HQ6YTOZW","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HQ6YTOZWSB2IXG3B5XYU7XG2ZV","target":"record","payload":{"canonical_record":{"source":{"id":"1811.08506","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-20T22:04:59Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"98643544af9e30cc32523fda65f9dfcfc5598838c179c234066277ebfa6bebb3","abstract_canon_sha256":"3830bfb101c8942425d8442234c50914c12172c2a2d3e93c09285073fcc649e1"},"schema_version":"1.0"},"canonical_sha256":"3c3d89bb3690748b9b61edf14fdcdacd53993fd726ad171cda1d5b5777533f99","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:00:12.341178Z","signature_b64":"xujTnMv4iz4+AO3EJNe2PYT6/KHdj1BUYQo18Cepxl7RP7qiw1yt7x0hK1ic6gI5JWWFaZowM7noOzMvt+yDBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3c3d89bb3690748b9b61edf14fdcdacd53993fd726ad171cda1d5b5777533f99","last_reissued_at":"2026-05-18T00:00:12.340505Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:00:12.340505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1811.08506","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-18T00:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PC8Oy2vIMge4N0stkMBhcRXjM+COxtDa3Q7tHBpS+cxAaGGMX6ORSeJo6EKkjZa+q1DerUFixjRAeB+DzUTUAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:32:11.634895Z"},"content_sha256":"c9d690da03c2d11bff82c32e63f4127f0a0a606f3302f2b82af1ab9fa5cd2947","schema_version":"1.0","event_id":"sha256:c9d690da03c2d11bff82c32e63f4127f0a0a606f3302f2b82af1ab9fa5cd2947"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HQ6YTOZWSB2IXG3B5XYU7XG2ZV","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Tight Approximation Ratio for Minimum Maximal Matching","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"cs.CC","authors_text":"Jan Marcinkowski (University of Wroc{\\l}aw, Mateusz Lewandowski, Poland), Szymon Dudycz","submitted_at":"2018-11-20T22:04:59Z","abstract_excerpt":"We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is hard to approximate with a constant smaller than 2, assuming the Unique Games Conjecture.\n  As a corollary we show, that Minimum Maximal Matching in bipartite graphs is hard to approximate with constant smaller than $\\frac{4}{3}$, with the same assumption. With a stronger variant of the Unique Games Conjecture --- that is Small Set Expansion Hypothesis --- we are able to improve the hardness result up to the factor o"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08506","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-18T00:00:12Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Oehwdb+axgcbvrkwvu1kCY223hSPFX5hnxX4RIbt7+rmP5piFxFfZgLqGR0BYDlCfcqG2/cm6/qLhclM44KpDA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-25T03:32:11.635243Z"},"content_sha256":"5779369f7eb28191c8e77f7c7428fb166895b81eed75673ecf805bd0cac3c323","schema_version":"1.0","event_id":"sha256:5779369f7eb28191c8e77f7c7428fb166895b81eed75673ecf805bd0cac3c323"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/bundle.json","state_url":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/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-25T03:32:11Z","links":{"resolver":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV","bundle":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/bundle.json","state":"https://pith.science/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HQ6YTOZWSB2IXG3B5XYU7XG2ZV/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HQ6YTOZWSB2IXG3B5XYU7XG2ZV","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":"3830bfb101c8942425d8442234c50914c12172c2a2d3e93c09285073fcc649e1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-20T22:04:59Z","title_canon_sha256":"98643544af9e30cc32523fda65f9dfcfc5598838c179c234066277ebfa6bebb3"},"schema_version":"1.0","source":{"id":"1811.08506","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1811.08506","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"arxiv_version","alias_value":"1811.08506v1","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1811.08506","created_at":"2026-05-18T00:00:12Z"},{"alias_kind":"pith_short_12","alias_value":"HQ6YTOZWSB2I","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HQ6YTOZWSB2IXG3B","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HQ6YTOZW","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:5779369f7eb28191c8e77f7c7428fb166895b81eed75673ecf805bd0cac3c323","target":"graph","created_at":"2026-05-18T00:00:12Z","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":"We study a combinatorial problem called Minimum Maximal Matching, where we are asked to find in a general graph the smallest that can not be extended. We show that this problem is hard to approximate with a constant smaller than 2, assuming the Unique Games Conjecture.\n  As a corollary we show, that Minimum Maximal Matching in bipartite graphs is hard to approximate with constant smaller than $\\frac{4}{3}$, with the same assumption. With a stronger variant of the Unique Games Conjecture --- that is Small Set Expansion Hypothesis --- we are able to improve the hardness result up to the factor o","authors_text":"Jan Marcinkowski (University of Wroc{\\l}aw, Mateusz Lewandowski, Poland), Szymon Dudycz","cross_cats":["cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-20T22:04:59Z","title":"Tight Approximation Ratio for Minimum Maximal Matching"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1811.08506","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:c9d690da03c2d11bff82c32e63f4127f0a0a606f3302f2b82af1ab9fa5cd2947","target":"record","created_at":"2026-05-18T00:00:12Z","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":"3830bfb101c8942425d8442234c50914c12172c2a2d3e93c09285073fcc649e1","cross_cats_sorted":["cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"cs.CC","submitted_at":"2018-11-20T22:04:59Z","title_canon_sha256":"98643544af9e30cc32523fda65f9dfcfc5598838c179c234066277ebfa6bebb3"},"schema_version":"1.0","source":{"id":"1811.08506","kind":"arxiv","version":1}},"canonical_sha256":"3c3d89bb3690748b9b61edf14fdcdacd53993fd726ad171cda1d5b5777533f99","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3c3d89bb3690748b9b61edf14fdcdacd53993fd726ad171cda1d5b5777533f99","first_computed_at":"2026-05-18T00:00:12.340505Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:00:12.340505Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"xujTnMv4iz4+AO3EJNe2PYT6/KHdj1BUYQo18Cepxl7RP7qiw1yt7x0hK1ic6gI5JWWFaZowM7noOzMvt+yDBg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:00:12.341178Z","signed_message":"canonical_sha256_bytes"},"source_id":"1811.08506","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c9d690da03c2d11bff82c32e63f4127f0a0a606f3302f2b82af1ab9fa5cd2947","sha256:5779369f7eb28191c8e77f7c7428fb166895b81eed75673ecf805bd0cac3c323"],"state_sha256":"6f6da50ed85c31a60b75fdc5586d6973eea057230c247261fb5e02573c776dbe"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Dt3N4hKC69GoLbXPiAQCnyoRoD0SV10Lxmiq5HA6tDs4oxsUMvmkRHAZjC0m9gSG2F6F/j1fiLQV+bSAEVdaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-25T03:32:11.637350Z","bundle_sha256":"b1c9b6224c2e3fcdc546966aab3666d14f40c8834c2e06f196dda0bf14925d8b"}}