{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:TRM4YQ6VYXSX64GE7O4YP2ISVD","short_pith_number":"pith:TRM4YQ6V","schema_version":"1.0","canonical_sha256":"9c59cc43d5c5e57f70c4fbb987e912a8d388760518980f1493dd3c1284e9d16f","source":{"kind":"arxiv","id":"1212.6091","version":1},"attestation_state":"computed","paper":{"title":"Perfect partition of some regular bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chi-Kwong Li, Gexin Yu, Jeff Soosiah","submitted_at":"2012-12-25T22:20:46Z","abstract_excerpt":"A graph has a perfect partition if all its perfect matchings can be partitioned so that each part is a 1-factorization of the graph. Let $L_{rm, r}=K_{rm,rm}-mK_{r,r}$. We first give a formula to count the number of perfect matchings of $L_{rm, r}$, then show that $L_{6,1}$ and $L_{8,2}$ have perfect partitions."},"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":"1212.6091","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-12-25T22:20:46Z","cross_cats_sorted":[],"title_canon_sha256":"09ac963b78bb16aa9ea90c16b3dde0b63f24b6bfa720f8ddb1b102ec139361e8","abstract_canon_sha256":"a83743754d6b712349eb09d46a763bed7da1a433469cfadbdd53e867a0eca9ee"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:37:42.799081Z","signature_b64":"ffLy1GxX7wQCJdEtFaX3PsxZLg62FiuASOjhxPVe5t1Lh5YxBIZb8N+4BmHJeKK5fdoZ7KX2VwIq2KaIoQC8Dw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9c59cc43d5c5e57f70c4fbb987e912a8d388760518980f1493dd3c1284e9d16f","last_reissued_at":"2026-05-18T03:37:42.798590Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:37:42.798590Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Perfect partition of some regular bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Chi-Kwong Li, Gexin Yu, Jeff Soosiah","submitted_at":"2012-12-25T22:20:46Z","abstract_excerpt":"A graph has a perfect partition if all its perfect matchings can be partitioned so that each part is a 1-factorization of the graph. Let $L_{rm, r}=K_{rm,rm}-mK_{r,r}$. We first give a formula to count the number of perfect matchings of $L_{rm, r}$, then show that $L_{6,1}$ and $L_{8,2}$ have perfect partitions."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1212.6091","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":"1212.6091","created_at":"2026-05-18T03:37:42.798653+00:00"},{"alias_kind":"arxiv_version","alias_value":"1212.6091v1","created_at":"2026-05-18T03:37:42.798653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1212.6091","created_at":"2026-05-18T03:37:42.798653+00:00"},{"alias_kind":"pith_short_12","alias_value":"TRM4YQ6VYXSX","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_16","alias_value":"TRM4YQ6VYXSX64GE","created_at":"2026-05-18T12:27:23.164592+00:00"},{"alias_kind":"pith_short_8","alias_value":"TRM4YQ6V","created_at":"2026-05-18T12:27:23.164592+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/TRM4YQ6VYXSX64GE7O4YP2ISVD","json":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD.json","graph_json":"https://pith.science/api/pith-number/TRM4YQ6VYXSX64GE7O4YP2ISVD/graph.json","events_json":"https://pith.science/api/pith-number/TRM4YQ6VYXSX64GE7O4YP2ISVD/events.json","paper":"https://pith.science/paper/TRM4YQ6V"},"agent_actions":{"view_html":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD","download_json":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD.json","view_paper":"https://pith.science/paper/TRM4YQ6V","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1212.6091&json=true","fetch_graph":"https://pith.science/api/pith-number/TRM4YQ6VYXSX64GE7O4YP2ISVD/graph.json","fetch_events":"https://pith.science/api/pith-number/TRM4YQ6VYXSX64GE7O4YP2ISVD/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD/action/timestamp_anchor","attest_storage":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD/action/storage_attestation","attest_author":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD/action/author_attestation","sign_citation":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD/action/citation_signature","submit_replication":"https://pith.science/pith/TRM4YQ6VYXSX64GE7O4YP2ISVD/action/replication_record"}},"created_at":"2026-05-18T03:37:42.798653+00:00","updated_at":"2026-05-18T03:37:42.798653+00:00"}