{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2016:OXZNX6UYRTWHBNGW2VJVGH3VNT","short_pith_number":"pith:OXZNX6UY","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"},"canonical_sha256":"75f2dbfa988cec70b4d6d553531f756cf959c901d10bb722988acd3f770267e8","source":{"kind":"arxiv","id":"1605.01857","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01857","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01857v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01857","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"OXZNX6UYRTWH","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXZNX6UYRTWHBNGW","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXZNX6UY","created_at":"2026-05-18T12:30:36Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2016:OXZNX6UYRTWHBNGW2VJVGH3VNT","target":"record","payload":{"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"},"canonical_sha256":"75f2dbfa988cec70b4d6d553531f756cf959c901d10bb722988acd3f770267e8","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"},"source_kind":"arxiv","source_id":"1605.01857","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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/3XO8ra9t/4fNh97WWyooB5/9yq1+iWWFuL53gGIc30UghYRomQXtDMVfLcNk8/zSjGK8Tgr8f0Y+XMal5idBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:49:43.383540Z"},"content_sha256":"9bcdee0e826729cfb584c904500a0529acd5df5077c352ec81d91271414ad39f","schema_version":"1.0","event_id":"sha256:9bcdee0e826729cfb584c904500a0529acd5df5077c352ec81d91271414ad39f"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2016:OXZNX6UYRTWHBNGW2VJVGH3VNT","target":"graph","payload":{"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"},"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-18T01:15:31Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ssfLxFDl3a0fFqWpEzkdpod19DduwEmnQGEsQ9FRk4jekRwbdM5ingTv6YCgGJsPGb/5BZG0zaI6SCLbjq9bDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-04T06:49:43.383908Z"},"content_sha256":"1028c8a8fa2f53acfecb0bec61646ebb380c7b8a0b30e6c8b09a613676c48d52","schema_version":"1.0","event_id":"sha256:1028c8a8fa2f53acfecb0bec61646ebb380c7b8a0b30e6c8b09a613676c48d52"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/bundle.json","state_url":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/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-04T06:49:43Z","links":{"resolver":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT","bundle":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/bundle.json","state":"https://pith.science/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OXZNX6UYRTWHBNGW2VJVGH3VNT/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2016:OXZNX6UYRTWHBNGW2VJVGH3VNT","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":"8e76fd751b332eb7e55be080fd28de239a3841a3ddcc91a01378aea9d046692b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T08:23:11Z","title_canon_sha256":"3567613190b48d0760d2f2aed38862d7ae4a9115c6d60d7c95ba408c36a79842"},"schema_version":"1.0","source":{"id":"1605.01857","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1605.01857","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"arxiv_version","alias_value":"1605.01857v1","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1605.01857","created_at":"2026-05-18T01:15:31Z"},{"alias_kind":"pith_short_12","alias_value":"OXZNX6UYRTWH","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_16","alias_value":"OXZNX6UYRTWHBNGW","created_at":"2026-05-18T12:30:36Z"},{"alias_kind":"pith_short_8","alias_value":"OXZNX6UY","created_at":"2026-05-18T12:30:36Z"}],"graph_snapshots":[{"event_id":"sha256:1028c8a8fa2f53acfecb0bec61646ebb380c7b8a0b30e6c8b09a613676c48d52","target":"graph","created_at":"2026-05-18T01:15:31Z","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 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","authors_text":"Guiying Yan, Hengzhe Li, Xingchao Deng","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T08:23:11Z","title":"Algorithm on rainbow connection for maximal outerplanar graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1605.01857","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:9bcdee0e826729cfb584c904500a0529acd5df5077c352ec81d91271414ad39f","target":"record","created_at":"2026-05-18T01:15:31Z","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":"8e76fd751b332eb7e55be080fd28de239a3841a3ddcc91a01378aea9d046692b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-05-06T08:23:11Z","title_canon_sha256":"3567613190b48d0760d2f2aed38862d7ae4a9115c6d60d7c95ba408c36a79842"},"schema_version":"1.0","source":{"id":"1605.01857","kind":"arxiv","version":1}},"canonical_sha256":"75f2dbfa988cec70b4d6d553531f756cf959c901d10bb722988acd3f770267e8","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"75f2dbfa988cec70b4d6d553531f756cf959c901d10bb722988acd3f770267e8","first_computed_at":"2026-05-18T01:15:31.114828Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T01:15:31.114828Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"KYSa1q5nMoG95p5RrW12subWHa0Y6VcsO7xx3gDAGT4GrZKJ6x5hadjiToe5mVeVTRgKwnO9VGcsdLWQvjn+Aw==","signature_status":"signed_v1","signed_at":"2026-05-18T01:15:31.115509Z","signed_message":"canonical_sha256_bytes"},"source_id":"1605.01857","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9bcdee0e826729cfb584c904500a0529acd5df5077c352ec81d91271414ad39f","sha256:1028c8a8fa2f53acfecb0bec61646ebb380c7b8a0b30e6c8b09a613676c48d52"],"state_sha256":"2ca210bcf11d31722c4fefe16f5ff5c1c50941e4eaf996240e56193ed5ca54ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"dzL196fn0+k/wZrXjqY0PS1a3NiZGz5sjSepp8y/x+RBKpwfEl3Q90dhNsmkpTx1TEJVaJ7/H/oK4wKk7JFxCA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-04T06:49:43.385920Z","bundle_sha256":"910bffe679db8fd1154fd012037ae6135d236301118e622d089bcc6f870466c2"}}