{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:TNB2WWRNXSDPVLSLAOZ3ORKVOM","short_pith_number":"pith:TNB2WWRN","schema_version":"1.0","canonical_sha256":"9b43ab5a2dbc86faae4b03b3b74555732fce7186b62065bbe7eab50b0b3a4b9d","source":{"kind":"arxiv","id":"2109.06755","version":1},"attestation_state":"computed","paper":{"title":"Construction of $k$-matchings and $k$-regular subgraphs in graph products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Anna Lindeberg, Marc Hellmuth","submitted_at":"2021-09-14T15:20:08Z","abstract_excerpt":"A $k$-matching $M$ of a graph $G=(V,E)$ is a subset $M\\subseteq E$ such that each connected component in the subgraph $F = (V,M)$ of $G$ is either a single-vertex graph or $k$-regular, i.e., each vertex has degree $k$. In this contribution, we are interested in $k$-matchings within the four standard graph products: the Cartesian, strong, direct and lexicographic product.\n  As we shall see, the problem of finding non-empty $k$-matchings ($k\\geq 3$) in graph products is NP-complete. Due to the general intractability of this problem, we focus on distinct polynomial-time constructions of $k$-match"},"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":"2109.06755","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-14T15:20:08Z","cross_cats_sorted":["cs.DM","cs.DS"],"title_canon_sha256":"473edfc5bcf5d6353dcf5d6903c505f04fa58ba6bc288db4ceb68c6b299d0ce3","abstract_canon_sha256":"ae80d8a5eb1cb39cffe2b2d2f7c263e1855f48274e1f1b721e99dd2feea336c8"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:14:29.871238Z","signature_b64":"IsobexhyHksu7jbwVkgrsKVfbXoWnwyG0qmeFTqjSZjfNdffqLdUHHXNMDKIfwyaoQdyoUOY8CObPK6mNRi1Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9b43ab5a2dbc86faae4b03b3b74555732fce7186b62065bbe7eab50b0b3a4b9d","last_reissued_at":"2026-07-05T03:14:29.870898Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:14:29.870898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Construction of $k$-matchings and $k$-regular subgraphs in graph products","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM","cs.DS"],"primary_cat":"math.CO","authors_text":"Anna Lindeberg, Marc Hellmuth","submitted_at":"2021-09-14T15:20:08Z","abstract_excerpt":"A $k$-matching $M$ of a graph $G=(V,E)$ is a subset $M\\subseteq E$ such that each connected component in the subgraph $F = (V,M)$ of $G$ is either a single-vertex graph or $k$-regular, i.e., each vertex has degree $k$. In this contribution, we are interested in $k$-matchings within the four standard graph products: the Cartesian, strong, direct and lexicographic product.\n  As we shall see, the problem of finding non-empty $k$-matchings ($k\\geq 3$) in graph products is NP-complete. Due to the general intractability of this problem, we focus on distinct polynomial-time constructions of $k$-match"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.06755","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2109.06755/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2109.06755","created_at":"2026-07-05T03:14:29.870954+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.06755v1","created_at":"2026-07-05T03:14:29.870954+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.06755","created_at":"2026-07-05T03:14:29.870954+00:00"},{"alias_kind":"pith_short_12","alias_value":"TNB2WWRNXSDP","created_at":"2026-07-05T03:14:29.870954+00:00"},{"alias_kind":"pith_short_16","alias_value":"TNB2WWRNXSDPVLSL","created_at":"2026-07-05T03:14:29.870954+00:00"},{"alias_kind":"pith_short_8","alias_value":"TNB2WWRN","created_at":"2026-07-05T03:14:29.870954+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/TNB2WWRNXSDPVLSLAOZ3ORKVOM","json":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM.json","graph_json":"https://pith.science/api/pith-number/TNB2WWRNXSDPVLSLAOZ3ORKVOM/graph.json","events_json":"https://pith.science/api/pith-number/TNB2WWRNXSDPVLSLAOZ3ORKVOM/events.json","paper":"https://pith.science/paper/TNB2WWRN"},"agent_actions":{"view_html":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM","download_json":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM.json","view_paper":"https://pith.science/paper/TNB2WWRN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.06755&json=true","fetch_graph":"https://pith.science/api/pith-number/TNB2WWRNXSDPVLSLAOZ3ORKVOM/graph.json","fetch_events":"https://pith.science/api/pith-number/TNB2WWRNXSDPVLSLAOZ3ORKVOM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/action/storage_attestation","attest_author":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/action/author_attestation","sign_citation":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/action/citation_signature","submit_replication":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/action/replication_record"}},"created_at":"2026-07-05T03:14:29.870954+00:00","updated_at":"2026-07-05T03:14:29.870954+00:00"}