{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:OXZNX6UYRTWHBNGW2VJVGH3VNT","short_pith_number":"pith:OXZNX6UY","schema_version":"1.0","canonical_sha256":"75f2dbfa988cec70b4d6d553531f756cf959c901d10bb722988acd3f770267e8","source":{"kind":"arxiv","id":"1605.01857","version":1},"attestation_state":"computed","paper":{"title":"Algorithm on rainbow connection for maximal outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guiying Yan, Hengzhe Li, Xingchao Deng","submitted_at":"2016-05-06T08:23:11Z","abstract_excerpt":"In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) $G$, we give sufficient conditions to guarantee that $rc(G) = diam(G).$ Moreover, we produce the graph with given diameter $d$ and give their rainbow coloring in linear time. X.Deng et al. $\\cite{XD}$ give a polynomial time algorithm to compute the rainbow connection number of MOPs by the Maximal fan partition method, but only obtain a compact upper bound. J. Lauri $\\cite{JL}$ proved that, for chordal outerplanar graphs given an edge-coloring, to verify whether it is ra"},"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":"1605.01857","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T08:23:11Z","cross_cats_sorted":[],"title_canon_sha256":"3567613190b48d0760d2f2aed38862d7ae4a9115c6d60d7c95ba408c36a79842","abstract_canon_sha256":"8e76fd751b332eb7e55be080fd28de239a3841a3ddcc91a01378aea9d046692b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:15:31.115509Z","signature_b64":"KYSa1q5nMoG95p5RrW12subWHa0Y6VcsO7xx3gDAGT4GrZKJ6x5hadjiToe5mVeVTRgKwnO9VGcsdLWQvjn+Aw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"75f2dbfa988cec70b4d6d553531f756cf959c901d10bb722988acd3f770267e8","last_reissued_at":"2026-05-18T01:15:31.114828Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:15:31.114828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Algorithm on rainbow connection for maximal outerplanar graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Guiying Yan, Hengzhe Li, Xingchao Deng","submitted_at":"2016-05-06T08:23:11Z","abstract_excerpt":"In this paper, we consider rainbow connection number of maximal outerplanar graphs(MOPs) on algorithmic aspect. For the (MOP) $G$, we give sufficient conditions to guarantee that $rc(G) = diam(G).$ Moreover, we produce the graph with given diameter $d$ and give their rainbow coloring in linear time. X.Deng et al. $\\cite{XD}$ give a polynomial time algorithm to compute the rainbow connection number of MOPs by the Maximal fan partition method, but only obtain a compact upper bound. J. Lauri $\\cite{JL}$ proved that, for chordal outerplanar graphs given an edge-coloring, to verify whether it is ra"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01857","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":"1605.01857","created_at":"2026-05-18T01:15:31.114917+00:00"},{"alias_kind":"arxiv_version","alias_value":"1605.01857v1","created_at":"2026-05-18T01:15:31.114917+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01857","created_at":"2026-05-18T01:15:31.114917+00:00"},{"alias_kind":"pith_short_12","alias_value":"OXZNX6UYRTWH","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_16","alias_value":"OXZNX6UYRTWHBNGW","created_at":"2026-05-18T12:30:36.002864+00:00"},{"alias_kind":"pith_short_8","alias_value":"OXZNX6UY","created_at":"2026-05-18T12:30:36.002864+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/OXZNX6UYRTWHBNGW2VJVGH3VNT","json":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT.json","graph_json":"https://pith.science/api/pith-number/OXZNX6UYRTWHBNGW2VJVGH3VNT/graph.json","events_json":"https://pith.science/api/pith-number/OXZNX6UYRTWHBNGW2VJVGH3VNT/events.json","paper":"https://pith.science/paper/OXZNX6UY"},"agent_actions":{"view_html":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT","download_json":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT.json","view_paper":"https://pith.science/paper/OXZNX6UY","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1605.01857&json=true","fetch_graph":"https://pith.science/api/pith-number/OXZNX6UYRTWHBNGW2VJVGH3VNT/graph.json","fetch_events":"https://pith.science/api/pith-number/OXZNX6UYRTWHBNGW2VJVGH3VNT/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/action/storage_attestation","attest_author":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/action/author_attestation","sign_citation":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/action/citation_signature","submit_replication":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/action/replication_record"}},"created_at":"2026-05-18T01:15:31.114917+00:00","updated_at":"2026-05-18T01:15:31.114917+00:00"}