{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2018:DPP7JVFXHUVKHXDNJM6MXZ2HX5","short_pith_number":"pith:DPP7JVFX","schema_version":"1.0","canonical_sha256":"1bdff4d4b73d2aa3dc6d4b3ccbe747bf774847064a9527de63ca29bca90b780b","source":{"kind":"arxiv","id":"1802.03918","version":2},"attestation_state":"computed","paper":{"title":"Improved bounds for rainbow numbers of matchings in plane triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yongtang Shi, Yongxin Lan, Zhongmei Qin","submitted_at":"2018-02-12T07:24:27Z","abstract_excerpt":"Given two graphs $G$ and $H$, the {\\it rainbow number} $rb(G,H)$ for $H$ with respect to $G$ is defined as the minimum number $k$ such that any $k$-edge-coloring of $G$ contains a rainbow $H$, i.e., a copy of $H$, all of whose edges have different colors. Denote by $kK_2$ a matching of size $k$ and $\\mathcal {T}_n$ the class of all plane triangulations of order $n$, respectively. In [S. Jendrol$'$, I. Schiermeyer and J. Tu, Rainbow numbers for matchings in plane triangulations, Discrete Math. 331(2014), 158--164], the authors determined the exact values of $rb(\\mathcal {T}_n, kK_2)$ for $2\\leq"},"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":"1802.03918","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2018-02-12T07:24:27Z","cross_cats_sorted":[],"title_canon_sha256":"8ce0decc5eafdebaf4b7520cbbb4bd292ba32d722926032f7fd02027fdbddc8a","abstract_canon_sha256":"134a3862509c0891c4edbb9f570e8cb7a11234f99b3b9e653f494b6b118ae665"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:04:45.014052Z","signature_b64":"6hc8T7XNaRKuRiJSB2GluOfILChbuBQCiDlJUO377mVKOTcpwAOSvxfqA43S8LBxtIhOS+fkLfSrzOEWP5FGAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1bdff4d4b73d2aa3dc6d4b3ccbe747bf774847064a9527de63ca29bca90b780b","last_reissued_at":"2026-05-18T00:04:45.013511Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:04:45.013511Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Improved bounds for rainbow numbers of matchings in plane triangulations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Yongtang Shi, Yongxin Lan, Zhongmei Qin","submitted_at":"2018-02-12T07:24:27Z","abstract_excerpt":"Given two graphs $G$ and $H$, the {\\it rainbow number} $rb(G,H)$ for $H$ with respect to $G$ is defined as the minimum number $k$ such that any $k$-edge-coloring of $G$ contains a rainbow $H$, i.e., a copy of $H$, all of whose edges have different colors. Denote by $kK_2$ a matching of size $k$ and $\\mathcal {T}_n$ the class of all plane triangulations of order $n$, respectively. In [S. Jendrol$'$, I. Schiermeyer and J. Tu, Rainbow numbers for matchings in plane triangulations, Discrete Math. 331(2014), 158--164], the authors determined the exact values of $rb(\\mathcal {T}_n, kK_2)$ for $2\\leq"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1802.03918","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":"1802.03918","created_at":"2026-05-18T00:04:45.013594+00:00"},{"alias_kind":"arxiv_version","alias_value":"1802.03918v2","created_at":"2026-05-18T00:04:45.013594+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1802.03918","created_at":"2026-05-18T00:04:45.013594+00:00"},{"alias_kind":"pith_short_12","alias_value":"DPP7JVFXHUVK","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_16","alias_value":"DPP7JVFXHUVKHXDN","created_at":"2026-05-18T12:32:19.392346+00:00"},{"alias_kind":"pith_short_8","alias_value":"DPP7JVFX","created_at":"2026-05-18T12:32:19.392346+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/DPP7JVFXHUVKHXDNJM6MXZ2HX5","json":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5.json","graph_json":"https://pith.science/api/pith-number/DPP7JVFXHUVKHXDNJM6MXZ2HX5/graph.json","events_json":"https://pith.science/api/pith-number/DPP7JVFXHUVKHXDNJM6MXZ2HX5/events.json","paper":"https://pith.science/paper/DPP7JVFX"},"agent_actions":{"view_html":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5","download_json":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5.json","view_paper":"https://pith.science/paper/DPP7JVFX","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1802.03918&json=true","fetch_graph":"https://pith.science/api/pith-number/DPP7JVFXHUVKHXDNJM6MXZ2HX5/graph.json","fetch_events":"https://pith.science/api/pith-number/DPP7JVFXHUVKHXDNJM6MXZ2HX5/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5/action/storage_attestation","attest_author":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5/action/author_attestation","sign_citation":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5/action/citation_signature","submit_replication":"https://pith.science/pith/DPP7JVFXHUVKHXDNJM6MXZ2HX5/action/replication_record"}},"created_at":"2026-05-18T00:04:45.013594+00:00","updated_at":"2026-05-18T00:04:45.013594+00:00"}