{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:MKVWW7WTODH7P7IOEBZMCR2OMN","short_pith_number":"pith:MKVWW7WT","schema_version":"1.0","canonical_sha256":"62ab6b7ed370cff7fd0e2072c1474e635ec1ecd1a807f70c8058b8558ea76e44","source":{"kind":"arxiv","id":"1702.02358","version":1},"attestation_state":"computed","paper":{"title":"Degenerate Matchings and Edge Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Julien Baste","submitted_at":"2017-02-08T10:24:50Z","abstract_excerpt":"A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in graphs, Discrete Mathematics 293 (2005) 129-138) introduced the notion of acyclic matchings, which coincide with $1$-degenerate matchings. Solving a problem they posed, we describe an efficient algorithm to determine the maximum size of an $r$-degenerate matching in a given chordal graph. Furthermore, we study the $r$-chromatic index of a graph defined as th"},"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":"1702.02358","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-02-08T10:24:50Z","cross_cats_sorted":[],"title_canon_sha256":"819f1e79e5f3c2a356eca5ce0f0c9b6b380da262b8cd8c963a00431523f3e8b3","abstract_canon_sha256":"188c21916e1f640f7f6e95a9f400c05d0b4cf378ad2427682bb08fbda5aef98e"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:51:06.158918Z","signature_b64":"208GBRw8Gjuo1GnupiGBa9M5wVNsvlkR/DeDuMQReg99qR+4WHzDzCRiJVBd5koalmnlIb9KZCJhPYDC250PDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"62ab6b7ed370cff7fd0e2072c1474e635ec1ecd1a807f70c8058b8558ea76e44","last_reissued_at":"2026-05-18T00:51:06.158478Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:51:06.158478Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Degenerate Matchings and Edge Colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Dieter Rautenbach, Julien Baste","submitted_at":"2017-02-08T10:24:50Z","abstract_excerpt":"A matching $M$ in a graph $G$ is $r$-degenerate if the subgraph of $G$ induced by the set of vertices incident with an edge in $M$ is $r$-degenerate. Goddard, Hedetniemi, Hedetniemi, and Laskar (Generalized subgraph-restricted matchings in graphs, Discrete Mathematics 293 (2005) 129-138) introduced the notion of acyclic matchings, which coincide with $1$-degenerate matchings. Solving a problem they posed, we describe an efficient algorithm to determine the maximum size of an $r$-degenerate matching in a given chordal graph. Furthermore, we study the $r$-chromatic index of a graph defined as th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1702.02358","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":"1702.02358","created_at":"2026-05-18T00:51:06.158554+00:00"},{"alias_kind":"arxiv_version","alias_value":"1702.02358v1","created_at":"2026-05-18T00:51:06.158554+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1702.02358","created_at":"2026-05-18T00:51:06.158554+00:00"},{"alias_kind":"pith_short_12","alias_value":"MKVWW7WTODH7","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_16","alias_value":"MKVWW7WTODH7P7IO","created_at":"2026-05-18T12:31:31.346846+00:00"},{"alias_kind":"pith_short_8","alias_value":"MKVWW7WT","created_at":"2026-05-18T12:31:31.346846+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/MKVWW7WTODH7P7IOEBZMCR2OMN","json":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN.json","graph_json":"https://pith.science/api/pith-number/MKVWW7WTODH7P7IOEBZMCR2OMN/graph.json","events_json":"https://pith.science/api/pith-number/MKVWW7WTODH7P7IOEBZMCR2OMN/events.json","paper":"https://pith.science/paper/MKVWW7WT"},"agent_actions":{"view_html":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN","download_json":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN.json","view_paper":"https://pith.science/paper/MKVWW7WT","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1702.02358&json=true","fetch_graph":"https://pith.science/api/pith-number/MKVWW7WTODH7P7IOEBZMCR2OMN/graph.json","fetch_events":"https://pith.science/api/pith-number/MKVWW7WTODH7P7IOEBZMCR2OMN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN/action/storage_attestation","attest_author":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN/action/author_attestation","sign_citation":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN/action/citation_signature","submit_replication":"https://pith.science/pith/MKVWW7WTODH7P7IOEBZMCR2OMN/action/replication_record"}},"created_at":"2026-05-18T00:51:06.158554+00:00","updated_at":"2026-05-18T00:51:06.158554+00:00"}