{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:TNB2WWRNXSDPVLSLAOZ3ORKVOM","short_pith_number":"pith:TNB2WWRN","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"},"canonical_sha256":"9b43ab5a2dbc86faae4b03b3b74555732fce7186b62065bbe7eab50b0b3a4b9d","source":{"kind":"arxiv","id":"2109.06755","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.06755","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"2109.06755v1","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.06755","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"TNB2WWRNXSDP","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"TNB2WWRNXSDPVLSL","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"TNB2WWRN","created_at":"2026-07-05T03:14:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:TNB2WWRNXSDPVLSLAOZ3ORKVOM","target":"record","payload":{"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"},"canonical_sha256":"9b43ab5a2dbc86faae4b03b3b74555732fce7186b62065bbe7eab50b0b3a4b9d","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"},"source_kind":"arxiv","source_id":"2109.06755","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-07-05T03:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"K7uLP2/XJVlkwZa54YLjWa/mFjjcB1aNIXYu5LY4ZQSkzfsyeWMMz4Mi610TPfAizPw/yrZ6/uc3+t7lx8bZAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:11:30.236491Z"},"content_sha256":"e182d29e828d0673e52e3a4ee3c50467a9bd319e4a1bb3c705cd0c6a59688e05","schema_version":"1.0","event_id":"sha256:e182d29e828d0673e52e3a4ee3c50467a9bd319e4a1bb3c705cd0c6a59688e05"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:TNB2WWRNXSDPVLSLAOZ3ORKVOM","target":"graph","payload":{"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"},"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-07-05T03:14:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"mcJMx/XQnS3dMn6J8tpn00lqWIeVBUNnrbV8oan1357JlvsYng0kzL8/DNW9r+7wGWXQj69xF5GB9ZlALIz4BA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-13T18:11:30.237430Z"},"content_sha256":"9961f8c8919dee7449bce09ff4c767c8a01204600d0acd0182fb4bdd0287269b","schema_version":"1.0","event_id":"sha256:9961f8c8919dee7449bce09ff4c767c8a01204600d0acd0182fb4bdd0287269b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/bundle.json","state_url":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/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-08-13T18:11:30Z","links":{"resolver":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM","bundle":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/bundle.json","state":"https://pith.science/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/state.json","well_known_bundle":"https://pith.science/.well-known/pith/TNB2WWRNXSDPVLSLAOZ3ORKVOM/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:TNB2WWRNXSDPVLSLAOZ3ORKVOM","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":"ae80d8a5eb1cb39cffe2b2d2f7c263e1855f48274e1f1b721e99dd2feea336c8","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-14T15:20:08Z","title_canon_sha256":"473edfc5bcf5d6353dcf5d6903c505f04fa58ba6bc288db4ceb68c6b299d0ce3"},"schema_version":"1.0","source":{"id":"2109.06755","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2109.06755","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"arxiv_version","alias_value":"2109.06755v1","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.06755","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"pith_short_12","alias_value":"TNB2WWRNXSDP","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"pith_short_16","alias_value":"TNB2WWRNXSDPVLSL","created_at":"2026-07-05T03:14:29Z"},{"alias_kind":"pith_short_8","alias_value":"TNB2WWRN","created_at":"2026-07-05T03:14:29Z"}],"graph_snapshots":[{"event_id":"sha256:9961f8c8919dee7449bce09ff4c767c8a01204600d0acd0182fb4bdd0287269b","target":"graph","created_at":"2026-07-05T03:14:29Z","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"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2109.06755/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"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","authors_text":"Anna Lindeberg, Marc Hellmuth","cross_cats":["cs.DM","cs.DS"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-14T15:20:08Z","title":"Construction of $k$-matchings and $k$-regular subgraphs in graph products"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.06755","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:e182d29e828d0673e52e3a4ee3c50467a9bd319e4a1bb3c705cd0c6a59688e05","target":"record","created_at":"2026-07-05T03:14:29Z","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":"ae80d8a5eb1cb39cffe2b2d2f7c263e1855f48274e1f1b721e99dd2feea336c8","cross_cats_sorted":["cs.DM","cs.DS"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2021-09-14T15:20:08Z","title_canon_sha256":"473edfc5bcf5d6353dcf5d6903c505f04fa58ba6bc288db4ceb68c6b299d0ce3"},"schema_version":"1.0","source":{"id":"2109.06755","kind":"arxiv","version":1}},"canonical_sha256":"9b43ab5a2dbc86faae4b03b3b74555732fce7186b62065bbe7eab50b0b3a4b9d","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9b43ab5a2dbc86faae4b03b3b74555732fce7186b62065bbe7eab50b0b3a4b9d","first_computed_at":"2026-07-05T03:14:29.870898Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:14:29.870898Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"IsobexhyHksu7jbwVkgrsKVfbXoWnwyG0qmeFTqjSZjfNdffqLdUHHXNMDKIfwyaoQdyoUOY8CObPK6mNRi1Cg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:14:29.871238Z","signed_message":"canonical_sha256_bytes"},"source_id":"2109.06755","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:e182d29e828d0673e52e3a4ee3c50467a9bd319e4a1bb3c705cd0c6a59688e05","sha256:9961f8c8919dee7449bce09ff4c767c8a01204600d0acd0182fb4bdd0287269b"],"state_sha256":"cd95a79b5b2d66870a545dbcdbd352d026cc8594e65d2ad87a94e7137a944a7c"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fDjQR9ywfGEUeuxkO+BCvYMXU0SkjZbYmNh1j/E0dmcj1c4WJUF7K251iQcEnG9TGl/icVlRI1LS6L5DpQ+hDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-13T18:11:30.268077Z","bundle_sha256":"0c112d1529ce50bacfb56a5aa13f7845d2fb9b919ec135a57ae9fdb6fc6ad205"}}