{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2015:T3SJC2VNJHPEP4P45MZRATWMBF","short_pith_number":"pith:T3SJC2VN","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"},"canonical_sha256":"9ee4916aad49de47f1fceb33104ecc095263e14882bd5032308e2e83dee605f5","source":{"kind":"arxiv","id":"1503.04516","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04516","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04516v1","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04516","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"T3SJC2VNJHPE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T3SJC2VNJHPEP4P4","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T3SJC2VN","created_at":"2026-05-18T12:29:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2015:T3SJC2VNJHPEP4P45MZRATWMBF","target":"record","payload":{"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"},"canonical_sha256":"9ee4916aad49de47f1fceb33104ecc095263e14882bd5032308e2e83dee605f5","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"},"source_kind":"arxiv","source_id":"1503.04516","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-18T02:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Jb1LuTb+KqHnWX4qM7f2/jkV8+d1D4qkFBroIDNyPz4xr+KtfhY9d9grslpt+E0Pc95WQp5BEA1LzpUWiR7VAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:49.305897Z"},"content_sha256":"543ed9aa27453f670a5ae1bd5f61e6adf9402b8999a8e54bacb155ca59452975","schema_version":"1.0","event_id":"sha256:543ed9aa27453f670a5ae1bd5f61e6adf9402b8999a8e54bacb155ca59452975"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2015:T3SJC2VNJHPEP4P45MZRATWMBF","target":"graph","payload":{"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"},"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-18T02:23:24Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UfHBCUXXu/jyc41TpyZfu/aFSxDTOlONzJld2w60jMhxz/6CKbsIaanLeiO9OMjmLYDLvuj8OdFDKVgnmIXGBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-01T16:56:49.306272Z"},"content_sha256":"7484f1e707a4ecdc1579231716546fa8648373b4114843384243329a88712341","schema_version":"1.0","event_id":"sha256:7484f1e707a4ecdc1579231716546fa8648373b4114843384243329a88712341"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/bundle.json","state_url":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/T3SJC2VNJHPEP4P45MZRATWMBF/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-01T16:56:49Z","links":{"resolver":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF","bundle":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/bundle.json","state":"https://pith.science/pith/T3SJC2VNJHPEP4P45MZRATWMBF/state.json","well_known_bundle":"https://pith.science/.well-known/pith/T3SJC2VNJHPEP4P45MZRATWMBF/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2015:T3SJC2VNJHPEP4P45MZRATWMBF","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":"8fcb86eb9cb01df8b954db5abda14f464d3e26e00ce7332c36b0b8c4873b391b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T04:20:13Z","title_canon_sha256":"5687bdb2dcb6104de13bbbf8968ec4f66d30f713a9f95254f248411172a09df7"},"schema_version":"1.0","source":{"id":"1503.04516","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1503.04516","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"arxiv_version","alias_value":"1503.04516v1","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1503.04516","created_at":"2026-05-18T02:23:24Z"},{"alias_kind":"pith_short_12","alias_value":"T3SJC2VNJHPE","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_16","alias_value":"T3SJC2VNJHPEP4P4","created_at":"2026-05-18T12:29:42Z"},{"alias_kind":"pith_short_8","alias_value":"T3SJC2VN","created_at":"2026-05-18T12:29:42Z"}],"graph_snapshots":[{"event_id":"sha256:7484f1e707a4ecdc1579231716546fa8648373b4114843384243329a88712341","target":"graph","created_at":"2026-05-18T02:23:24Z","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":"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","authors_text":"He Chen, Xueliang Li","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T04:20:13Z","title":"Long rainbow path in properly edge-colored complete graphs"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1503.04516","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:543ed9aa27453f670a5ae1bd5f61e6adf9402b8999a8e54bacb155ca59452975","target":"record","created_at":"2026-05-18T02:23:24Z","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":"8fcb86eb9cb01df8b954db5abda14f464d3e26e00ce7332c36b0b8c4873b391b","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2015-03-16T04:20:13Z","title_canon_sha256":"5687bdb2dcb6104de13bbbf8968ec4f66d30f713a9f95254f248411172a09df7"},"schema_version":"1.0","source":{"id":"1503.04516","kind":"arxiv","version":1}},"canonical_sha256":"9ee4916aad49de47f1fceb33104ecc095263e14882bd5032308e2e83dee605f5","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"9ee4916aad49de47f1fceb33104ecc095263e14882bd5032308e2e83dee605f5","first_computed_at":"2026-05-18T02:23:24.788700Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T02:23:24.788700Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"SydMuuDGbpxFWbRjUJW3Bek7XMv/qjTCH2cG8eOnbPMpbqOOPrOYAlRwtIYv8BMXFgViuyWJNpcoEFLGrawGDw==","signature_status":"signed_v1","signed_at":"2026-05-18T02:23:24.789377Z","signed_message":"canonical_sha256_bytes"},"source_id":"1503.04516","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:543ed9aa27453f670a5ae1bd5f61e6adf9402b8999a8e54bacb155ca59452975","sha256:7484f1e707a4ecdc1579231716546fa8648373b4114843384243329a88712341"],"state_sha256":"5e67ae6234d4aa6f67bdb091c84dd04b8be6ca25c24c39e250c2b958d0ce05bb"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"kMiY8Bn9Ov6ajlaLC1j2yyTViuT2epzegCxy5xQ2xhO1h9NYJVmZJA0WKBGecbSHHy05Ah4oU1jlUbsom1Y3Ag==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-01T16:56:49.308088Z","bundle_sha256":"bf601e1c6d3bc4e142054b6afe684ab66a2d23cd63cacce9c06743bea30ac8a0"}}