{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2010:XKAACQI2ZVKSXIJRXS2G34QY5R","short_pith_number":"pith:XKAACQI2","schema_version":"1.0","canonical_sha256":"ba8001411acd552ba131bcb46df218ec4433cada5ae8706685b7b0ef2b686865","source":{"kind":"arxiv","id":"1008.4265","version":1},"attestation_state":"computed","paper":{"title":"On perfect k-matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu","submitted_at":"2010-08-25T12:41:43Z","abstract_excerpt":"In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching problem is equivalent to that matching question. Moreover, for regular graphs, we provide a sufficient condition of perfect k-matching in terms of edge connectivity."},"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":"1008.4265","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2010-08-25T12:41:43Z","cross_cats_sorted":[],"title_canon_sha256":"94ab9cceee6a80e4028407930a78a35920e1d445d9026d1467ed418d4007b812","abstract_canon_sha256":"a56f3dcf900f81d3dbe08a0306c684a65b156b944478233e198e2d0685e9a259"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:41:53.309495Z","signature_b64":"zaZpNLh5MXNFV1FS1ye0a/VpVqClzOl+nV0zl/iwhgGZdCp/lzGRLnpYd8Oxif1eC2tEMBUNBZMZiic74Af9AA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ba8001411acd552ba131bcb46df218ec4433cada5ae8706685b7b0ef2b686865","last_reissued_at":"2026-05-18T04:41:53.309010Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:41:53.309010Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"On perfect k-matchings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hongliang Lu","submitted_at":"2010-08-25T12:41:43Z","abstract_excerpt":"In this paper, we generalize the notions of perfect matchings, perfect 2-matchings to perfect k-matchings and give a necessary and sufficient condition for existence of perfect k-matchings. For bipartite graphs, we show that this k-matching problem is equivalent to that matching question. Moreover, for regular graphs, we provide a sufficient condition of perfect k-matching in terms of edge connectivity."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1008.4265","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":"1008.4265","created_at":"2026-05-18T04:41:53.309094+00:00"},{"alias_kind":"arxiv_version","alias_value":"1008.4265v1","created_at":"2026-05-18T04:41:53.309094+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1008.4265","created_at":"2026-05-18T04:41:53.309094+00:00"},{"alias_kind":"pith_short_12","alias_value":"XKAACQI2ZVKS","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_16","alias_value":"XKAACQI2ZVKSXIJR","created_at":"2026-05-18T12:26:17.028572+00:00"},{"alias_kind":"pith_short_8","alias_value":"XKAACQI2","created_at":"2026-05-18T12:26:17.028572+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/XKAACQI2ZVKSXIJRXS2G34QY5R","json":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R.json","graph_json":"https://pith.science/api/pith-number/XKAACQI2ZVKSXIJRXS2G34QY5R/graph.json","events_json":"https://pith.science/api/pith-number/XKAACQI2ZVKSXIJRXS2G34QY5R/events.json","paper":"https://pith.science/paper/XKAACQI2"},"agent_actions":{"view_html":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R","download_json":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R.json","view_paper":"https://pith.science/paper/XKAACQI2","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1008.4265&json=true","fetch_graph":"https://pith.science/api/pith-number/XKAACQI2ZVKSXIJRXS2G34QY5R/graph.json","fetch_events":"https://pith.science/api/pith-number/XKAACQI2ZVKSXIJRXS2G34QY5R/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R/action/timestamp_anchor","attest_storage":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R/action/storage_attestation","attest_author":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R/action/author_attestation","sign_citation":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R/action/citation_signature","submit_replication":"https://pith.science/pith/XKAACQI2ZVKSXIJRXS2G34QY5R/action/replication_record"}},"created_at":"2026-05-18T04:41:53.309094+00:00","updated_at":"2026-05-18T04:41:53.309094+00:00"}