{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2015:T3SJC2VNJHPEP4P45MZRATWMBF","short_pith_number":"pith:T3SJC2VN","schema_version":"1.0","canonical_sha256":"9ee4916aad49de47f1fceb33104ecc095263e14882bd5032308e2e83dee605f5","source":{"kind":"arxiv","id":"1503.04516","version":1},"attestation_state":"computed","paper":{"title":"Long rainbow path in properly edge-colored complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"He Chen, Xueliang Li","submitted_at":"2015-03-16T04:20:13Z","abstract_excerpt":"Let $G$ be an edge-colored graph. A rainbow (heterochromatic, or multicolored) path of $G$ is such a path in which no two edges have the same color. Let the color degree of a vertex $v$ be the number of different colors that are used on the edges incident to $v$, and denote it to be $d^c(v)$. It was shown that if $d^c(v)\\geq k$ for every vertex $v$ of $G$, then $G$ has a rainbow path of length at least $\\min\\{\\lceil\\frac{2k+1}{3}\\rceil,k-1\\}$. In the present paper, we consider the properly edge-colored complete graph $K_n$ only and improve the lower bound of the length of the longest rainbow p"},"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":"1503.04516","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T04:20:13Z","cross_cats_sorted":[],"title_canon_sha256":"5687bdb2dcb6104de13bbbf8968ec4f66d30f713a9f95254f248411172a09df7","abstract_canon_sha256":"8fcb86eb9cb01df8b954db5abda14f464d3e26e00ce7332c36b0b8c4873b391b"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:23:24.789377Z","signature_b64":"SydMuuDGbpxFWbRjUJW3Bek7XMv/qjTCH2cG8eOnbPMpbqOOPrOYAlRwtIYv8BMXFgViuyWJNpcoEFLGrawGDw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"9ee4916aad49de47f1fceb33104ecc095263e14882bd5032308e2e83dee605f5","last_reissued_at":"2026-05-18T02:23:24.788700Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:23:24.788700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Long rainbow path in properly edge-colored complete graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"He Chen, Xueliang Li","submitted_at":"2015-03-16T04:20:13Z","abstract_excerpt":"Let $G$ be an edge-colored graph. A rainbow (heterochromatic, or multicolored) path of $G$ is such a path in which no two edges have the same color. Let the color degree of a vertex $v$ be the number of different colors that are used on the edges incident to $v$, and denote it to be $d^c(v)$. It was shown that if $d^c(v)\\geq k$ for every vertex $v$ of $G$, then $G$ has a rainbow path of length at least $\\min\\{\\lceil\\frac{2k+1}{3}\\rceil,k-1\\}$. In the present paper, we consider the properly edge-colored complete graph $K_n$ only and improve the lower bound of the length of the longest rainbow p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04516","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":"1503.04516","created_at":"2026-05-18T02:23:24.788806+00:00"},{"alias_kind":"arxiv_version","alias_value":"1503.04516v1","created_at":"2026-05-18T02:23:24.788806+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04516","created_at":"2026-05-18T02:23:24.788806+00:00"},{"alias_kind":"pith_short_12","alias_value":"T3SJC2VNJHPE","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_16","alias_value":"T3SJC2VNJHPEP4P4","created_at":"2026-05-18T12:29:42.218222+00:00"},{"alias_kind":"pith_short_8","alias_value":"T3SJC2VN","created_at":"2026-05-18T12:29:42.218222+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/T3SJC2VNJHPEP4P45MZRATWMBF","json":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF.json","graph_json":"https://pith.science/api/pith-number/T3SJC2VNJHPEP4P45MZRATWMBF/graph.json","events_json":"https://pith.science/api/pith-number/T3SJC2VNJHPEP4P45MZRATWMBF/events.json","paper":"https://pith.science/paper/T3SJC2VN"},"agent_actions":{"view_html":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF","download_json":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF.json","view_paper":"https://pith.science/paper/T3SJC2VN","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1503.04516&json=true","fetch_graph":"https://pith.science/api/pith-number/T3SJC2VNJHPEP4P45MZRATWMBF/graph.json","fetch_events":"https://pith.science/api/pith-number/T3SJC2VNJHPEP4P45MZRATWMBF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/action/storage_attestation","attest_author":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/action/author_attestation","sign_citation":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/action/citation_signature","submit_replication":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/action/replication_record"}},"created_at":"2026-05-18T02:23:24.788806+00:00","updated_at":"2026-05-18T02:23:24.788806+00:00"}