{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2012:4I4NTMJNXBZHRJQFNFMEF6NNTW","short_pith_number":"pith:4I4NTMJN","schema_version":"1.0","canonical_sha256":"e238d9b12db87278a605695842f9ad9d91a53f575c37ee57ac9e4a3726bee91c","source":{"kind":"arxiv","id":"1204.0392","version":2},"attestation_state":"computed","paper":{"title":"A sharp upper bound for the rainbow 2-connection number of 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sujuan Liu, Xueliang Li","submitted_at":"2012-04-02T12:51:34Z","abstract_excerpt":"A path in an edge-colored graph is called {\\em rainbow} if no two edges of it are colored the same. For an $\\ell$-connected graph $G$ and an integer $k$ with $1\\leq k\\leq \\ell$, the {\\em rainbow $k$-connection number} $rc_k(G)$ of $G$ is defined to be the minimum number of colors required to color the edges of $G$ such that every two distinct vertices of $G$ are connected by at least $k$ internally disjoint rainbow paths. Fujita et. al. proposed a problem that what is the minimum constant $\\alpha>0$ such that for all 2-connected graphs $G$ on $n$ vertices, we have $rc_2(G)\\leq \\alpha n$. In th"},"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":"1204.0392","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2012-04-02T12:51:34Z","cross_cats_sorted":[],"title_canon_sha256":"cc38d23e3ebfcebdc8589f8fa1a7bd05c51e34d8f540a46fa6bc009646ad867f","abstract_canon_sha256":"8059c52f9493a4e561beba123ac378a94463d7502498287ff95e97eb6a1c6405"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:58:12.289618Z","signature_b64":"7CdhQrnNMzUcbLpJqZOLqoSaANzEX9lIVjp4hPNQZ0m9BKfhfgp5Ur3zzVVPyEd011gNTX+m+PRub7eDEg/GCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e238d9b12db87278a605695842f9ad9d91a53f575c37ee57ac9e4a3726bee91c","last_reissued_at":"2026-05-18T03:58:12.289145Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:58:12.289145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A sharp upper bound for the rainbow 2-connection number of 2-connected graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Sujuan Liu, Xueliang Li","submitted_at":"2012-04-02T12:51:34Z","abstract_excerpt":"A path in an edge-colored graph is called {\\em rainbow} if no two edges of it are colored the same. For an $\\ell$-connected graph $G$ and an integer $k$ with $1\\leq k\\leq \\ell$, the {\\em rainbow $k$-connection number} $rc_k(G)$ of $G$ is defined to be the minimum number of colors required to color the edges of $G$ such that every two distinct vertices of $G$ are connected by at least $k$ internally disjoint rainbow paths. Fujita et. al. proposed a problem that what is the minimum constant $\\alpha>0$ such that for all 2-connected graphs $G$ on $n$ vertices, we have $rc_2(G)\\leq \\alpha n$. In th"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0392","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":"1204.0392","created_at":"2026-05-18T03:58:12.289211+00:00"},{"alias_kind":"arxiv_version","alias_value":"1204.0392v2","created_at":"2026-05-18T03:58:12.289211+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0392","created_at":"2026-05-18T03:58:12.289211+00:00"},{"alias_kind":"pith_short_12","alias_value":"4I4NTMJNXBZH","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_16","alias_value":"4I4NTMJNXBZHRJQF","created_at":"2026-05-18T12:26:53.410803+00:00"},{"alias_kind":"pith_short_8","alias_value":"4I4NTMJN","created_at":"2026-05-18T12:26:53.410803+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/4I4NTMJNXBZHRJQFNFMEF6NNTW","json":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW.json","graph_json":"https://pith.science/api/pith-number/4I4NTMJNXBZHRJQFNFMEF6NNTW/graph.json","events_json":"https://pith.science/api/pith-number/4I4NTMJNXBZHRJQFNFMEF6NNTW/events.json","paper":"https://pith.science/paper/4I4NTMJN"},"agent_actions":{"view_html":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW","download_json":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW.json","view_paper":"https://pith.science/paper/4I4NTMJN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1204.0392&json=true","fetch_graph":"https://pith.science/api/pith-number/4I4NTMJNXBZHRJQFNFMEF6NNTW/graph.json","fetch_events":"https://pith.science/api/pith-number/4I4NTMJNXBZHRJQFNFMEF6NNTW/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/action/timestamp_anchor","attest_storage":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/action/storage_attestation","attest_author":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/action/author_attestation","sign_citation":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/action/citation_signature","submit_replication":"https://pith.science/pith/4I4NTMJNXBZHRJQFNFMEF6NNTW/action/replication_record"}},"created_at":"2026-05-18T03:58:12.289211+00:00","updated_at":"2026-05-18T03:58:12.289211+00:00"}