{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:QFWGH2RXNTERHBUQOLHW4Q6HDF","short_pith_number":"pith:QFWGH2RX","canonical_record":{"source":{"id":"1208.5670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-28T14:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"235bc9b13f4c79d353de87e2ca219e5efc4e5b01dfddba09b4048877cbc747c2","abstract_canon_sha256":"f7953f0adfb1bde661d4414cb4cf445292b635655e3af37f2b47525cef7da122"},"schema_version":"1.0"},"canonical_sha256":"816c63ea376cc913869072cf6e43c7197a0b2b9df8db99a06ccc80398dc50244","source":{"kind":"arxiv","id":"1208.5670","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5670","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5670v1","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5670","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"QFWGH2RXNTER","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QFWGH2RXNTERHBUQ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QFWGH2RX","created_at":"2026-05-18T12:27:18Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:QFWGH2RXNTERHBUQOLHW4Q6HDF","target":"record","payload":{"canonical_record":{"source":{"id":"1208.5670","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-28T14:05:43Z","cross_cats_sorted":[],"title_canon_sha256":"235bc9b13f4c79d353de87e2ca219e5efc4e5b01dfddba09b4048877cbc747c2","abstract_canon_sha256":"f7953f0adfb1bde661d4414cb4cf445292b635655e3af37f2b47525cef7da122"},"schema_version":"1.0"},"canonical_sha256":"816c63ea376cc913869072cf6e43c7197a0b2b9df8db99a06ccc80398dc50244","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:46:58.089704Z","signature_b64":"hQrIptTFNBCfKQnYMBerYmwqh0EvBbRoMDPBP5lQFnkCQSyEm92dWPAKkWzpip/a81BmQowOsTEsFDKkPB7wAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"816c63ea376cc913869072cf6e43c7197a0b2b9df8db99a06ccc80398dc50244","last_reissued_at":"2026-05-18T03:46:58.088966Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:46:58.088966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1208.5670","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-05-18T03:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3927jbGeCgEuOdEI0Oyx85DZmi4mk7JriVlAMpfckk71QaH5X3ldOK5Ha/GA5REh8i1vDFtA/DW7mgLWvGM6CQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:02:53.251678Z"},"content_sha256":"0d5f45e238110fce7b76dd1f21ee88aa8c77f42d326cde8dd1542560beee1ad2","schema_version":"1.0","event_id":"sha256:0d5f45e238110fce7b76dd1f21ee88aa8c77f42d326cde8dd1542560beee1ad2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:QFWGH2RXNTERHBUQOLHW4Q6HDF","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Rainbow matchings and partial transversals of Latin squares","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Andras Gyarfas, Gabor N. Sarkozy","submitted_at":"2012-08-28T14:05:43Z","abstract_excerpt":"In this paper we consider properly edge-colored graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A matching is called \\it rainbow \\rm if its edges have different colors. The minimum degree of a graph is denoted by $\\delta(G)$. We show that properly edge colored graphs $G$ with $|V(G)|\\ge 4\\delta(G)-3$ have rainbow matchings of size $\\delta(G)$, this gives the best known estimate to a recent question of Wang. Since one obviously needs at least $2\\delta(G)$ vertices to guarantee a rainbow matching of size $\\delta(G)$, we investigate what hap"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5670","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"},"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-05-18T03:46:58Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UyK+l05KOJaIIMU3xnZTZCyZK8Nui2tX22IsRsGjVLYMj2nzqptCHde/9hEXC4xPdMyDB+cp3qnnehew0FG0Bg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-05T00:02:53.252229Z"},"content_sha256":"fdb7f9d5e62d44f9926d15450cb6cf6a68e6624f5dad64bf459df79ba9301a86","schema_version":"1.0","event_id":"sha256:fdb7f9d5e62d44f9926d15450cb6cf6a68e6624f5dad64bf459df79ba9301a86"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/QFWGH2RXNTERHBUQOLHW4Q6HDF/bundle.json","state_url":"https://pith.science/pith/QFWGH2RXNTERHBUQOLHW4Q6HDF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/QFWGH2RXNTERHBUQOLHW4Q6HDF/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-06-05T00:02:53Z","links":{"resolver":"https://pith.science/pith/QFWGH2RXNTERHBUQOLHW4Q6HDF","bundle":"https://pith.science/pith/QFWGH2RXNTERHBUQOLHW4Q6HDF/bundle.json","state":"https://pith.science/pith/QFWGH2RXNTERHBUQOLHW4Q6HDF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/QFWGH2RXNTERHBUQOLHW4Q6HDF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:QFWGH2RXNTERHBUQOLHW4Q6HDF","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":"f7953f0adfb1bde661d4414cb4cf445292b635655e3af37f2b47525cef7da122","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-28T14:05:43Z","title_canon_sha256":"235bc9b13f4c79d353de87e2ca219e5efc4e5b01dfddba09b4048877cbc747c2"},"schema_version":"1.0","source":{"id":"1208.5670","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1208.5670","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"arxiv_version","alias_value":"1208.5670v1","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1208.5670","created_at":"2026-05-18T03:46:58Z"},{"alias_kind":"pith_short_12","alias_value":"QFWGH2RXNTER","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_16","alias_value":"QFWGH2RXNTERHBUQ","created_at":"2026-05-18T12:27:18Z"},{"alias_kind":"pith_short_8","alias_value":"QFWGH2RX","created_at":"2026-05-18T12:27:18Z"}],"graph_snapshots":[{"event_id":"sha256:fdb7f9d5e62d44f9926d15450cb6cf6a68e6624f5dad64bf459df79ba9301a86","target":"graph","created_at":"2026-05-18T03:46:58Z","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"},"paper":{"abstract_excerpt":"In this paper we consider properly edge-colored graphs, i.e. two edges with the same color cannot share an endpoint, so each color class is a matching. A matching is called \\it rainbow \\rm if its edges have different colors. The minimum degree of a graph is denoted by $\\delta(G)$. We show that properly edge colored graphs $G$ with $|V(G)|\\ge 4\\delta(G)-3$ have rainbow matchings of size $\\delta(G)$, this gives the best known estimate to a recent question of Wang. Since one obviously needs at least $2\\delta(G)$ vertices to guarantee a rainbow matching of size $\\delta(G)$, we investigate what hap","authors_text":"Andras Gyarfas, Gabor N. Sarkozy","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-28T14:05:43Z","title":"Rainbow matchings and partial transversals of Latin squares"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1208.5670","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:0d5f45e238110fce7b76dd1f21ee88aa8c77f42d326cde8dd1542560beee1ad2","target":"record","created_at":"2026-05-18T03:46:58Z","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":"f7953f0adfb1bde661d4414cb4cf445292b635655e3af37f2b47525cef7da122","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-08-28T14:05:43Z","title_canon_sha256":"235bc9b13f4c79d353de87e2ca219e5efc4e5b01dfddba09b4048877cbc747c2"},"schema_version":"1.0","source":{"id":"1208.5670","kind":"arxiv","version":1}},"canonical_sha256":"816c63ea376cc913869072cf6e43c7197a0b2b9df8db99a06ccc80398dc50244","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"816c63ea376cc913869072cf6e43c7197a0b2b9df8db99a06ccc80398dc50244","first_computed_at":"2026-05-18T03:46:58.088966Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:46:58.088966Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"hQrIptTFNBCfKQnYMBerYmwqh0EvBbRoMDPBP5lQFnkCQSyEm92dWPAKkWzpip/a81BmQowOsTEsFDKkPB7wAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:46:58.089704Z","signed_message":"canonical_sha256_bytes"},"source_id":"1208.5670","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:0d5f45e238110fce7b76dd1f21ee88aa8c77f42d326cde8dd1542560beee1ad2","sha256:fdb7f9d5e62d44f9926d15450cb6cf6a68e6624f5dad64bf459df79ba9301a86"],"state_sha256":"e434bd2ef326dadde8f2d6d58f6f832c43cdf8d0c8fb887e0c6e6cce19d4240a"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZP+NHhyOqi/rPqGqPBIUtBmQzrFG958A/RV8x7Jgd2ArjcbDfjmah+qxm2UhvZL1tjB49Uy03o4ZbidKRYc2Dg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-05T00:02:53.255847Z","bundle_sha256":"560711649a991689c810da56ae6ee7879737a12f27724ed03857bae50572d21d"}}