{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:635YCNZTUFMOARE5GDEKFCK6GC","short_pith_number":"pith:635YCNZT","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"},"canonical_sha256":"f6fb813733a158e0449d30c8a2895e308601d37525c1a12208f5dea2332e6db7","source":{"kind":"arxiv","id":"1812.09038","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09038","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09038v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09038","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"635YCNZTUFMO","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"635YCNZTUFMOARE5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"635YCNZT","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:635YCNZTUFMOARE5GDEKFCK6GC","target":"record","payload":{"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"},"canonical_sha256":"f6fb813733a158e0449d30c8a2895e308601d37525c1a12208f5dea2332e6db7","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"},"source_kind":"arxiv","source_id":"1812.09038","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:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"of0izV4DYnnxNBi8UP/csRyDQaArCGl8QRx7gMOtt1Um8fPWMOmXFS4JvB/KNH3bwzaWNsu1tpuHDe8dXD0RCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:29:41.853902Z"},"content_sha256":"02075efc118709463a26681f132e6027471919b724a0d9ffc6add726dfc24a4e","schema_version":"1.0","event_id":"sha256:02075efc118709463a26681f132e6027471919b724a0d9ffc6add726dfc24a4e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:635YCNZTUFMOARE5GDEKFCK6GC","target":"graph","payload":{"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"},"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:57:45Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"610VKTtLGMOR/cLEvDtRzQSXgqa3MqFb+47T4b5zW8D0tjyUMWzGFu7XnjGsDNMxORtznh/GbKHlpvcdw46KAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-07-02T18:29:41.854241Z"},"content_sha256":"b52667918c808d894b6cbaa65eaf98120be4e4edf3c13661990c05c294100a0b","schema_version":"1.0","event_id":"sha256:b52667918c808d894b6cbaa65eaf98120be4e4edf3c13661990c05c294100a0b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/bundle.json","state_url":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/635YCNZTUFMOARE5GDEKFCK6GC/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-07-02T18:29:41Z","links":{"resolver":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC","bundle":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/bundle.json","state":"https://pith.science/pith/635YCNZTUFMOARE5GDEKFCK6GC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/635YCNZTUFMOARE5GDEKFCK6GC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:635YCNZTUFMOARE5GDEKFCK6GC","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":"2a97cd77e96b5e73c8ef53f207fc9189ec02c28490ccbed06b62194936b866be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T10:39:48Z","title_canon_sha256":"5c9e33b5fce698a1aef08cb5a5efed10529c49747467dbcf4b67301c85c57ff4"},"schema_version":"1.0","source":{"id":"1812.09038","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1812.09038","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"arxiv_version","alias_value":"1812.09038v1","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1812.09038","created_at":"2026-05-17T23:57:45Z"},{"alias_kind":"pith_short_12","alias_value":"635YCNZTUFMO","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"635YCNZTUFMOARE5","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"635YCNZT","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:b52667918c808d894b6cbaa65eaf98120be4e4edf3c13661990c05c294100a0b","target":"graph","created_at":"2026-05-17T23:57:45Z","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":"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","authors_text":"Maximilian F\\\"urst","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T10:39:48Z","title":"On the hardness of deciding the equality of the induced and the uniquely restricted matching number"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1812.09038","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:02075efc118709463a26681f132e6027471919b724a0d9ffc6add726dfc24a4e","target":"record","created_at":"2026-05-17T23:57:45Z","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":"2a97cd77e96b5e73c8ef53f207fc9189ec02c28490ccbed06b62194936b866be","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-12-21T10:39:48Z","title_canon_sha256":"5c9e33b5fce698a1aef08cb5a5efed10529c49747467dbcf4b67301c85c57ff4"},"schema_version":"1.0","source":{"id":"1812.09038","kind":"arxiv","version":1}},"canonical_sha256":"f6fb813733a158e0449d30c8a2895e308601d37525c1a12208f5dea2332e6db7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f6fb813733a158e0449d30c8a2895e308601d37525c1a12208f5dea2332e6db7","first_computed_at":"2026-05-17T23:57:45.575640Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:57:45.575640Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"eLNYgHpm7ScEETlI34YYm8DP4Rn/S3N0C5W9wnajsAkIdIG6B4E7uJTYnISEL1AaWnkrLByB93492LOLjK81DA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:57:45.576148Z","signed_message":"canonical_sha256_bytes"},"source_id":"1812.09038","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:02075efc118709463a26681f132e6027471919b724a0d9ffc6add726dfc24a4e","sha256:b52667918c808d894b6cbaa65eaf98120be4e4edf3c13661990c05c294100a0b"],"state_sha256":"e1e6afc42c58ec18e3d488e1b20f390a43becafe8a4d24f5463164475e66b5b6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Eapl5R1O47Nb0/m00juNGAVBYPojHJMq9j6LxqlXPjaVlkiLPTCD6npw3f5ES9fYrGwzUFxtjirpjNqXsJq6Dw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-07-02T18:29:41.856144Z","bundle_sha256":"39a550cfd51c722533531cd2567ec0566b67a6ba8d28a3cf4a36252b7d9e80de"}}