{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:42P2IFIXQFPAZO6NDDXOGQSRXH","short_pith_number":"pith:42P2IFIX","schema_version":"1.0","canonical_sha256":"e69fa41517815e0cbbcd18eee34251b9ebed08b2811c19e167022cd20ea3106a","source":{"kind":"arxiv","id":"1711.02916","version":2},"attestation_state":"computed","paper":{"title":"Rainbow matchings in Dirac bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillem Perarnau, Matthew Coulson","submitted_at":"2017-11-08T12:26:36Z","abstract_excerpt":"We show the existence of rainbow perfect matchings in $\\mu n$-bounded edge colourings of Dirac bipartite graphs, for a sufficiently small $\\mu>0$. As an application of our results, we obtain several results on the existence of rainbow $k$-factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree."},"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":"1711.02916","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2017-11-08T12:26:36Z","cross_cats_sorted":[],"title_canon_sha256":"ebcb574f579eedfcd3e249c2a25552c867d9262b44b85ac2dcc1c5eb9b8e84b4","abstract_canon_sha256":"1b37526190b385e6f6698adb07bd8499aadc4ebb0e4eb97a06b5605988d5acda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:28:01.748228Z","signature_b64":"htmx2H5BHL6XmkfeflL18NmMV7hut8wqIXCrqiTt/H5hr/F0SVEiJBqqqKTbtvEemZwhjtb6iYykAPCTpDy7DQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e69fa41517815e0cbbcd18eee34251b9ebed08b2811c19e167022cd20ea3106a","last_reissued_at":"2026-05-18T00:28:01.747543Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:28:01.747543Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Rainbow matchings in Dirac bipartite graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guillem Perarnau, Matthew Coulson","submitted_at":"2017-11-08T12:26:36Z","abstract_excerpt":"We show the existence of rainbow perfect matchings in $\\mu n$-bounded edge colourings of Dirac bipartite graphs, for a sufficiently small $\\mu>0$. As an application of our results, we obtain several results on the existence of rainbow $k$-factors in Dirac graphs and rainbow spanning subgraphs of bounded maximum degree on graphs with large minimum degree."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1711.02916","kind":"arxiv","version":2},"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":"1711.02916","created_at":"2026-05-18T00:28:01.747627+00:00"},{"alias_kind":"arxiv_version","alias_value":"1711.02916v2","created_at":"2026-05-18T00:28:01.747627+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1711.02916","created_at":"2026-05-18T00:28:01.747627+00:00"},{"alias_kind":"pith_short_12","alias_value":"42P2IFIXQFPA","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_16","alias_value":"42P2IFIXQFPAZO6N","created_at":"2026-05-18T12:30:58.224056+00:00"},{"alias_kind":"pith_short_8","alias_value":"42P2IFIX","created_at":"2026-05-18T12:30:58.224056+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/42P2IFIXQFPAZO6NDDXOGQSRXH","json":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH.json","graph_json":"https://pith.science/api/pith-number/42P2IFIXQFPAZO6NDDXOGQSRXH/graph.json","events_json":"https://pith.science/api/pith-number/42P2IFIXQFPAZO6NDDXOGQSRXH/events.json","paper":"https://pith.science/paper/42P2IFIX"},"agent_actions":{"view_html":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH","download_json":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH.json","view_paper":"https://pith.science/paper/42P2IFIX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1711.02916&json=true","fetch_graph":"https://pith.science/api/pith-number/42P2IFIXQFPAZO6NDDXOGQSRXH/graph.json","fetch_events":"https://pith.science/api/pith-number/42P2IFIXQFPAZO6NDDXOGQSRXH/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH/action/timestamp_anchor","attest_storage":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH/action/storage_attestation","attest_author":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH/action/author_attestation","sign_citation":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH/action/citation_signature","submit_replication":"https://pith.science/pith/42P2IFIXQFPAZO6NDDXOGQSRXH/action/replication_record"}},"created_at":"2026-05-18T00:28:01.747627+00:00","updated_at":"2026-05-18T00:28:01.747627+00:00"}