{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:5Y4TTSTCUG2PLADWRQF6ILHCGW","short_pith_number":"pith:5Y4TTSTC","schema_version":"1.0","canonical_sha256":"ee3939ca62a1b4f580768c0be42ce23583f9f1a6cb684e3f2cb5b004f6cdbd7e","source":{"kind":"arxiv","id":"1203.3030","version":1},"attestation_state":"computed","paper":{"title":"Note on minimally $k$-rainbow connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yan Zhao, Yuefang Sun","submitted_at":"2012-03-14T09:35:41Z","abstract_excerpt":"An edge-colored graph $G$, where adjacent edges may have the same color, is {\\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors. A graph $G$ is {\\it $k$-rainbow connected} if one can use $k$ colors to make $G$ rainbow connected. For integers $n$ and $d$ let $t(n,d)$ denote the minimum size (number of edges) in $k$-rainbow connected graphs of order $n$. Schiermeyer got some exact values and upper bounds for $t(n,d)$. However, he did not get a lower bound of $t(n,d)$ for $3\\leq d<\\lceil\\frac{n}{2}\\rceil $. In this paper, we improve his lowe"},"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":"1203.3030","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-03-14T09:35:41Z","cross_cats_sorted":[],"title_canon_sha256":"09542223cc7ff53379c7ba27b5c6295352a3d982acb32cd737ad0ba6fed7142e","abstract_canon_sha256":"cb1c1e796858cc427ed161753d1a939749c8d8c7b6253268e69675a3972d3c37"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T04:00:12.825347Z","signature_b64":"ECxSy35+c5Wj9vczCdZzgBWLKeSIQKeR4CksLPu4mxOc2EuDx6KGxNWQcVG4FzsqFd8NrEg7PHw5qwr5IeZHDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ee3939ca62a1b4f580768c0be42ce23583f9f1a6cb684e3f2cb5b004f6cdbd7e","last_reissued_at":"2026-05-18T04:00:12.824613Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T04:00:12.824613Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Note on minimally $k$-rainbow connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Hengzhe Li, Xueliang Li, Yan Zhao, Yuefang Sun","submitted_at":"2012-03-14T09:35:41Z","abstract_excerpt":"An edge-colored graph $G$, where adjacent edges may have the same color, is {\\it rainbow connected} if every two vertices of $G$ are connected by a path whose edge has distinct colors. A graph $G$ is {\\it $k$-rainbow connected} if one can use $k$ colors to make $G$ rainbow connected. For integers $n$ and $d$ let $t(n,d)$ denote the minimum size (number of edges) in $k$-rainbow connected graphs of order $n$. Schiermeyer got some exact values and upper bounds for $t(n,d)$. However, he did not get a lower bound of $t(n,d)$ for $3\\leq d<\\lceil\\frac{n}{2}\\rceil $. In this paper, we improve his lowe"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1203.3030","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":"1203.3030","created_at":"2026-05-18T04:00:12.824723+00:00"},{"alias_kind":"arxiv_version","alias_value":"1203.3030v1","created_at":"2026-05-18T04:00:12.824723+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1203.3030","created_at":"2026-05-18T04:00:12.824723+00:00"},{"alias_kind":"pith_short_12","alias_value":"5Y4TTSTCUG2P","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_16","alias_value":"5Y4TTSTCUG2PLADW","created_at":"2026-05-18T12:26:56.085431+00:00"},{"alias_kind":"pith_short_8","alias_value":"5Y4TTSTC","created_at":"2026-05-18T12:26:56.085431+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/5Y4TTSTCUG2PLADWRQF6ILHCGW","json":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW.json","graph_json":"https://pith.science/api/pith-number/5Y4TTSTCUG2PLADWRQF6ILHCGW/graph.json","events_json":"https://pith.science/api/pith-number/5Y4TTSTCUG2PLADWRQF6ILHCGW/events.json","paper":"https://pith.science/paper/5Y4TTSTC"},"agent_actions":{"view_html":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW","download_json":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW.json","view_paper":"https://pith.science/paper/5Y4TTSTC","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1203.3030&json=true","fetch_graph":"https://pith.science/api/pith-number/5Y4TTSTCUG2PLADWRQF6ILHCGW/graph.json","fetch_events":"https://pith.science/api/pith-number/5Y4TTSTCUG2PLADWRQF6ILHCGW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW/action/storage_attestation","attest_author":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW/action/author_attestation","sign_citation":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW/action/citation_signature","submit_replication":"https://pith.science/pith/5Y4TTSTCUG2PLADWRQF6ILHCGW/action/replication_record"}},"created_at":"2026-05-18T04:00:12.824723+00:00","updated_at":"2026-05-18T04:00:12.824723+00:00"}