{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:R6VW7S6WQ24T4AK4BL3M4I4AQB","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":"048e3e86a9726f7abb96ad370bd58d7f64dfad5d425a7ee7fd343091d509cc61","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T14:50:57Z","title_canon_sha256":"ed310e26423539108689f207af4a8f70cc288be82b343147b221beb498f24281"},"schema_version":"1.0","source":{"id":"1611.06815","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1611.06815","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"arxiv_version","alias_value":"1611.06815v1","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.06815","created_at":"2026-05-18T00:57:32Z"},{"alias_kind":"pith_short_12","alias_value":"R6VW7S6WQ24T","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_16","alias_value":"R6VW7S6WQ24T4AK4","created_at":"2026-05-18T12:30:41Z"},{"alias_kind":"pith_short_8","alias_value":"R6VW7S6W","created_at":"2026-05-18T12:30:41Z"}],"graph_snapshots":[{"event_id":"sha256:95a83e7e931e4344672861631a8cc11907f643418c1029b3456f664e1874e39d","target":"graph","created_at":"2026-05-18T00:57:32Z","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 uniquely restricted if no other matching covers exactly the same set of vertices. This notion was defined by Golumbic, Hirst, and Lewenstein and studied in a number of articles. Our contribution is twofold. We provide approximation algorithms for computing a uniquely restricted matching of maximum size in some bipartite graphs. In particular, we achieve a ratio of $9/5$ for subcubic bipartite graphs, improving over a $2$-approximation algorithm proposed by Mishra. Furthermore, we study the uniquely restricted chromatic index of a graph, defined as the minimum number of","authors_text":"Dieter Rautenbach, Ignasi Sau, Julien Baste","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T14:50:57Z","title":"Uniquely restricted matchings and edge colorings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.06815","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:d5bf4a5f94b10dfe7fd7d16321b24b73b83ba4ea17a4152cbc298668726bd9c5","target":"record","created_at":"2026-05-18T00:57:32Z","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":"048e3e86a9726f7abb96ad370bd58d7f64dfad5d425a7ee7fd343091d509cc61","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-21T14:50:57Z","title_canon_sha256":"ed310e26423539108689f207af4a8f70cc288be82b343147b221beb498f24281"},"schema_version":"1.0","source":{"id":"1611.06815","kind":"arxiv","version":1}},"canonical_sha256":"8fab6fcbd686b93e015c0af6ce23808065852d8de46b6dd1d8b2b9f4abe4933b","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"8fab6fcbd686b93e015c0af6ce23808065852d8de46b6dd1d8b2b9f4abe4933b","first_computed_at":"2026-05-18T00:57:32.796786Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:57:32.796786Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"tVr9dMjo9be3Yy5hi7PvzdARhwUM6OINJAEi9qCT6Uc9zDCYhPlBJcs7iLwMMC83lFn7ck1dfIYcPf1ZHtsMCg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:57:32.797271Z","signed_message":"canonical_sha256_bytes"},"source_id":"1611.06815","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:d5bf4a5f94b10dfe7fd7d16321b24b73b83ba4ea17a4152cbc298668726bd9c5","sha256:95a83e7e931e4344672861631a8cc11907f643418c1029b3456f664e1874e39d"],"state_sha256":"674be99008a7b353f7ac4983875cd17a80c910fb4b6a3d35733d07e285a6e194"}