{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:I5K4TGGRX4BFZEC3TGCJZ75RWM","short_pith_number":"pith:I5K4TGGR","schema_version":"1.0","canonical_sha256":"4755c998d1bf025c905b99849cffb1b301bb25650a40e38cbab04bdfda899799","source":{"kind":"arxiv","id":"1602.04316","version":1},"attestation_state":"computed","paper":{"title":"Half-regular factorizations of the complete bipartite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Istvan Miklos, Kathleen Zhou, Mark Aksen","submitted_at":"2016-02-13T11:19:24Z","abstract_excerpt":"We consider a bipartite version of the color degree matrix problem. A bipartite graph $G(U,V,E)$ is half-regular if all vertices in $U$ have the same degree. We give necessary and sufficient conditions for a bipartite degree matrix (also known as demand matrix) to be the color degree matrix of an edge-disjoint union of half-regular graphs. We also give necessary and sufficient perturbations to transform realizations of a half-regular degree matrix into each other. Based on these perturbations, a Markov chain Monte Carlo method is designed in which the inverse of the acceptance ratios are polyn"},"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":"1602.04316","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-02-13T11:19:24Z","cross_cats_sorted":[],"title_canon_sha256":"0a2c7e475d3e6d3e6c1b31b2414a04109fba1347e01bd29c612a1965efc460a7","abstract_canon_sha256":"1fd55a3ddcf55f96b47b70a6baebd3bde5ddf27ae08fe51ee23a9d82ca0bc109"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:20:51.262487Z","signature_b64":"AjJ2UQhRsx6XPC2HLz/nrLgwKBIy64vNsUUCJ+xseF4CN0JzmfeXh1PItTTRVNYYA6uKlfBVvlIpFf6HICkaAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"4755c998d1bf025c905b99849cffb1b301bb25650a40e38cbab04bdfda899799","last_reissued_at":"2026-05-18T01:20:51.261835Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:20:51.261835Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Half-regular factorizations of the complete bipartite graph","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Istvan Miklos, Kathleen Zhou, Mark Aksen","submitted_at":"2016-02-13T11:19:24Z","abstract_excerpt":"We consider a bipartite version of the color degree matrix problem. A bipartite graph $G(U,V,E)$ is half-regular if all vertices in $U$ have the same degree. We give necessary and sufficient conditions for a bipartite degree matrix (also known as demand matrix) to be the color degree matrix of an edge-disjoint union of half-regular graphs. We also give necessary and sufficient perturbations to transform realizations of a half-regular degree matrix into each other. Based on these perturbations, a Markov chain Monte Carlo method is designed in which the inverse of the acceptance ratios are polyn"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1602.04316","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":"1602.04316","created_at":"2026-05-18T01:20:51.261930+00:00"},{"alias_kind":"arxiv_version","alias_value":"1602.04316v1","created_at":"2026-05-18T01:20:51.261930+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1602.04316","created_at":"2026-05-18T01:20:51.261930+00:00"},{"alias_kind":"pith_short_12","alias_value":"I5K4TGGRX4BF","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_16","alias_value":"I5K4TGGRX4BFZEC3","created_at":"2026-05-18T12:30:22.444734+00:00"},{"alias_kind":"pith_short_8","alias_value":"I5K4TGGR","created_at":"2026-05-18T12:30:22.444734+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/I5K4TGGRX4BFZEC3TGCJZ75RWM","json":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM.json","graph_json":"https://pith.science/api/pith-number/I5K4TGGRX4BFZEC3TGCJZ75RWM/graph.json","events_json":"https://pith.science/api/pith-number/I5K4TGGRX4BFZEC3TGCJZ75RWM/events.json","paper":"https://pith.science/paper/I5K4TGGR"},"agent_actions":{"view_html":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM","download_json":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM.json","view_paper":"https://pith.science/paper/I5K4TGGR","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1602.04316&json=true","fetch_graph":"https://pith.science/api/pith-number/I5K4TGGRX4BFZEC3TGCJZ75RWM/graph.json","fetch_events":"https://pith.science/api/pith-number/I5K4TGGRX4BFZEC3TGCJZ75RWM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM/action/storage_attestation","attest_author":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM/action/author_attestation","sign_citation":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM/action/citation_signature","submit_replication":"https://pith.science/pith/I5K4TGGRX4BFZEC3TGCJZ75RWM/action/replication_record"}},"created_at":"2026-05-18T01:20:51.261930+00:00","updated_at":"2026-05-18T01:20:51.261930+00:00"}