{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2016:2CXY3NKUAV4Z7LTJXTTQTX4WS7","short_pith_number":"pith:2CXY3NKU","schema_version":"1.0","canonical_sha256":"d0af8db55405799fae69bce709df9697e3227300891186479844423876c37dd5","source":{"kind":"arxiv","id":"1611.08068","version":1},"attestation_state":"computed","paper":{"title":"Solutions for two conjectures on kaleidoscopic edge-colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu Zhu, Xueliang Li","submitted_at":"2016-11-24T05:03:15Z","abstract_excerpt":"For an $r$-regular graph $G$, we define an edge-coloring $c$ with colors from $\\{1,2,\\cdots,$ $k\\}$, in such a way that any vertex of $G$ is incident to at least one edge of each color. The multiset-color $c_m(v)$ of a vertex $v$ is defined as the ordered tuple $(a_1,a_2,\\cdots ,a_k)$, where $a_i \\ (1\\leq i\\leq k)$ denotes the number of edges with color $i$ which are incident with $v$ in $G$. Then this edge-coloring $c$ is called a {\\it $k$-kaleidoscopic coloring} of $G$ if every two distinct vertices in $G$ have different multiset-colors and in this way the graph $G$ is defined as a {\\it $k$-"},"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":"1611.08068","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"math.CO","submitted_at":"2016-11-24T05:03:15Z","cross_cats_sorted":[],"title_canon_sha256":"9f3b52c7971c877444efbc5eba7738e3a321bc703d0f2fbce06556ce178677f4","abstract_canon_sha256":"712a28a3a851c2572bc0c16d4247a6c07aa2f496dfa769833d203d9a64bed28a"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:56:44.526414Z","signature_b64":"HTEE+Fk0dxodzXdszK3zZIZ8iHdjlwd1ra/fFbqEAUITRtK5Sc7iQaTfl0GpjmvXgO5g14Bk1isTjDt/tm52Bw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0af8db55405799fae69bce709df9697e3227300891186479844423876c37dd5","last_reissued_at":"2026-05-18T00:56:44.525737Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:56:44.525737Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Solutions for two conjectures on kaleidoscopic edge-colorings","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"math.CO","authors_text":"Xiaoyu Zhu, Xueliang Li","submitted_at":"2016-11-24T05:03:15Z","abstract_excerpt":"For an $r$-regular graph $G$, we define an edge-coloring $c$ with colors from $\\{1,2,\\cdots,$ $k\\}$, in such a way that any vertex of $G$ is incident to at least one edge of each color. The multiset-color $c_m(v)$ of a vertex $v$ is defined as the ordered tuple $(a_1,a_2,\\cdots ,a_k)$, where $a_i \\ (1\\leq i\\leq k)$ denotes the number of edges with color $i$ which are incident with $v$ in $G$. Then this edge-coloring $c$ is called a {\\it $k$-kaleidoscopic coloring} of $G$ if every two distinct vertices in $G$ have different multiset-colors and in this way the graph $G$ is defined as a {\\it $k$-"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1611.08068","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":"1611.08068","created_at":"2026-05-18T00:56:44.525838+00:00"},{"alias_kind":"arxiv_version","alias_value":"1611.08068v1","created_at":"2026-05-18T00:56:44.525838+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1611.08068","created_at":"2026-05-18T00:56:44.525838+00:00"},{"alias_kind":"pith_short_12","alias_value":"2CXY3NKUAV4Z","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_16","alias_value":"2CXY3NKUAV4Z7LTJ","created_at":"2026-05-18T12:29:55.572404+00:00"},{"alias_kind":"pith_short_8","alias_value":"2CXY3NKU","created_at":"2026-05-18T12:29:55.572404+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/2CXY3NKUAV4Z7LTJXTTQTX4WS7","json":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7.json","graph_json":"https://pith.science/api/pith-number/2CXY3NKUAV4Z7LTJXTTQTX4WS7/graph.json","events_json":"https://pith.science/api/pith-number/2CXY3NKUAV4Z7LTJXTTQTX4WS7/events.json","paper":"https://pith.science/paper/2CXY3NKU"},"agent_actions":{"view_html":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7","download_json":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7.json","view_paper":"https://pith.science/paper/2CXY3NKU","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1611.08068&json=true","fetch_graph":"https://pith.science/api/pith-number/2CXY3NKUAV4Z7LTJXTTQTX4WS7/graph.json","fetch_events":"https://pith.science/api/pith-number/2CXY3NKUAV4Z7LTJXTTQTX4WS7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7/action/storage_attestation","attest_author":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7/action/author_attestation","sign_citation":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7/action/citation_signature","submit_replication":"https://pith.science/pith/2CXY3NKUAV4Z7LTJXTTQTX4WS7/action/replication_record"}},"created_at":"2026-05-18T00:56:44.525838+00:00","updated_at":"2026-05-18T00:56:44.525838+00:00"}