{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:635YCNZTUFMOARE5GDEKFCK6GC","short_pith_number":"pith:635YCNZT","schema_version":"1.0","canonical_sha256":"f6fb813733a158e0449d30c8a2895e308601d37525c1a12208f5dea2332e6db7","source":{"kind":"arxiv","id":"1812.09038","version":1},"attestation_state":"computed","paper":{"title":"On the hardness of deciding the equality of the induced and the uniquely restricted matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maximilian F\\\"urst","submitted_at":"2018-12-21T10:39:48Z","abstract_excerpt":"If $G(M)$ denotes the subgraph of a graph $G$ induced by the set of vertices that are covered by some matching $M$ in $G$, then $M$ is an induced or a uniquely restricted matching if $G(M)$ is $1$-regular or if $M$ is the unique perfect matching of $G(M)$, respectively. Let $\\nu_s(G)$ and $\\nu_{ur}(G)$ denote the maximum cardinality of an induced and a uniquely restricted matching in $G$. Golumbic, Hirst, and Lewenstein (Uniquely restricted matchings, Algorithmica 31 (2001) 139-154) posed the problem to characterize the graphs $G$ with $\\nu_{ur}(G) = \\nu_{s}(G)$. We prove that the correspondin"},"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.09038","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T10:39:48Z","cross_cats_sorted":[],"title_canon_sha256":"5c9e33b5fce698a1aef08cb5a5efed10529c49747467dbcf4b67301c85c57ff4","abstract_canon_sha256":"2a97cd77e96b5e73c8ef53f207fc9189ec02c28490ccbed06b62194936b866be"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:57:45.576148Z","signature_b64":"eLNYgHpm7ScEETlI34YYm8DP4Rn/S3N0C5W9wnajsAkIdIG6B4E7uJTYnISEL1AaWnkrLByB93492LOLjK81DA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f6fb813733a158e0449d30c8a2895e308601d37525c1a12208f5dea2332e6db7","last_reissued_at":"2026-05-17T23:57:45.575640Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:57:45.575640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On the hardness of deciding the equality of the induced and the uniquely restricted matching number","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Maximilian F\\\"urst","submitted_at":"2018-12-21T10:39:48Z","abstract_excerpt":"If $G(M)$ denotes the subgraph of a graph $G$ induced by the set of vertices that are covered by some matching $M$ in $G$, then $M$ is an induced or a uniquely restricted matching if $G(M)$ is $1$-regular or if $M$ is the unique perfect matching of $G(M)$, respectively. Let $\\nu_s(G)$ and $\\nu_{ur}(G)$ denote the maximum cardinality of an induced and a uniquely restricted matching in $G$. Golumbic, Hirst, and Lewenstein (Uniquely restricted matchings, Algorithmica 31 (2001) 139-154) posed the problem to characterize the graphs $G$ with $\\nu_{ur}(G) = \\nu_{s}(G)$. We prove that the correspondin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09038","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.09038","created_at":"2026-05-17T23:57:45.575727+00:00"},{"alias_kind":"arxiv_version","alias_value":"1812.09038v1","created_at":"2026-05-17T23:57:45.575727+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09038","created_at":"2026-05-17T23:57:45.575727+00:00"},{"alias_kind":"pith_short_12","alias_value":"635YCNZTUFMO","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_16","alias_value":"635YCNZTUFMOARE5","created_at":"2026-05-18T12:32:08.215937+00:00"},{"alias_kind":"pith_short_8","alias_value":"635YCNZT","created_at":"2026-05-18T12:32:08.215937+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/635YCNZTUFMOARE5GDEKFCK6GC","json":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC.json","graph_json":"https://pith.science/api/pith-number/635YCNZTUFMOARE5GDEKFCK6GC/graph.json","events_json":"https://pith.science/api/pith-number/635YCNZTUFMOARE5GDEKFCK6GC/events.json","paper":"https://pith.science/paper/635YCNZT"},"agent_actions":{"view_html":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC","download_json":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC.json","view_paper":"https://pith.science/paper/635YCNZT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1812.09038&json=true","fetch_graph":"https://pith.science/api/pith-number/635YCNZTUFMOARE5GDEKFCK6GC/graph.json","fetch_events":"https://pith.science/api/pith-number/635YCNZTUFMOARE5GDEKFCK6GC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/action/storage_attestation","attest_author":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/action/author_attestation","sign_citation":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/action/citation_signature","submit_replication":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/action/replication_record"}},"created_at":"2026-05-17T23:57:45.575727+00:00","updated_at":"2026-05-17T23:57:45.575727+00:00"}